1072 : Modulo Nine
- 时间限制Time Limit
- 5 秒Sec
- 内存限制Memory Limit
- 512 兆MB
- 提交次数Submitted
- 17 次Times
- 通过次数Solved
- 10 次Times
标准评测 Standard
从标准输入读入,结果写到标准输出。评测将输出拆成 token,与标准答案逐项比较,不按整段逐字节比对。
Read from standard input and write to standard output. The judge splits the output into tokens and compares them with the official answer; it does not compare raw bytes.
| 比对Compare | token 相同即通过。中间的空格、制表符、换行可多可少。Matching tokens pass. Extra spaces, tabs, or newlines between them are ignored. |
|---|---|
| 不同则错Differs | token 个数或内容不同即错误。23 与 2 3、02 与 2、2.0 与 2 均视为不同。A different token count or value is wrong. 23 vs 2 3, 02 vs 2, and 2.0 vs 2 all differ. |
| 输入Input | 标准输入,格式见题面。Standard input; format as in the statement. |
| 输出Output | 标准输出。Standard output. |
| 时间与内存Time and memory | 记这一份程序的 CPU 时间和内存峰值。题目上的时间限制、内存限制就是这一份的上限。The record is this program’s CPU time and peak memory. The limits on the problem apply to this one run. |
题目描述Description
Bobo has a decimal integer \(\overline{a_{1} a_{2} \dots a_{n}}\), possibly with leading zeros. He knows that for \(m\) ranges \([l_1, r_1], [l_2, r_2], \dots, [l_m, r_m]\), it holds that \(a_{l_i} \times a_{l_i + 1} \times \dots \times a_{r_i} \bmod 9 = 0\). Find the number of valid integers \(\overline{a_1 a_2 \dots a_n}\), modulo \((10^9+7)\).
输入格式Input
The input consists of several test cases and is terminated by end-of-file.
The first line of each test case contains two integers \(n\) and \(m\).
The \(i\)th of the following \(m\) lines contains two integers \(l_i\) and \(r_i\).
- \(1 \leq n, m \leq 50\)
- \(1 \leq l_i \leq r_i \leq n\)
- There are at most \(100\) test cases.
输出格式Output
For each test case, print an integer which denotes the result.
样例Sample
出题Author
ftiasch
来源Source
湖南省第十五届大学生计算机程序设计竞赛(HNCPC2019)
题目到此结束End of problem