5564：Clarke and digits

题目描述

Clarke is a patient with multiple personality disorder. One day, Clarke turned into a researcher, did a research on digits.
He wants to know the number of positive integers which have a length in $[l, r]$ and are divisible by $7$ and the sum of any adjacent digits can not be $k$.

输入解释

The first line contains an integer $T(1 \le T \le 5)$, the number of the test cases.
Each test case contains three integers $l, r, k(1 \le l \le r \le 10^9, 0 \le k \le 18)$.

输出解释

Each test case print a line with a number, the answer modulo $10^9+7$.

输入样例

2
1 2 5
2 3 5

输出样例

13
125

Hint:
At the first sample there are 13 number $7,21,28,35,42,49,56,63,70,77,84,91,98$ satisfied.

来自杭电HDUOJ的附加信息

Recommend

hujie

该题目是Virtual Judge题目，来自杭电HDUOJ

题目来源 BestCoder Round #62 (div.2)

源链接： HDU-5564

最后修改于 2020-10-25T23:23:48+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
5000/3000MS(Java/Others)	65536/65536K(Java/Others)