[SNCPC2019] Digit Product
题面翻译
【题目描述】
定义正整数 x x x 的 “数字乘积” f ( x ) f(x) f(x) 为其所有数字的乘积。例如, f ( 1234 ) = 1 × 2 × 3 × 4 = 24 f(1234) = 1 \times 2 \times 3 \times 4 = 24 f(1234)=1×2×3×4=24, f ( 100 ) = 1 × 0 × 0 = 0 f(100) = 1 \times 0 \times 0 = 0 f(100)=1×0×0=0。
给定两个整数
l
l
l 和
r
r
r,请计算以下值:
(
∏
i
=
l
r
f
(
i
)
)
m
o
d
(
1
0
9
+
7
)
(\prod_{i=l}^r f(i)) \mod (10^9+7)
(i=l∏rf(i))mod(109+7)
如果你不知道
∏
\prod
∏ 表示什么,上述表达式等同于
(
f
(
l
)
×
f
(
l
+
1
)
×
⋯
×
f
(
r
)
)
m
o
d
(
1
0
9
+
7
)
(f(l) \times f(l+1) \times \dots \times f(r)) \mod (10^9+7)
(f(l)×f(l+1)×⋯×f(r))mod(109+7)
【输入格式】
有多个测试用例。输入的第一行包含一个整数 T T T(大约 1 0 5 10^5 105),表示测试用例的数量。对于每个测试用例:
第一行且唯一一行包含两个整数 l l l 和 r r r( 1 ≤ l ≤ r ≤ 1 0 9 1 \le l \le r \le 10^9 1≤l≤r≤109),表示给定的两个整数。这些整数没有前导零。
【输出格式】
对于每个测试用例,输出一行,包含一个整数,表示答案。
【样例解释】
对于第一个样例测试用例,答案是 9 ! m o d ( 1 0 9 + 7 ) = 362880 9! \mod (10^9+7) = 362880 9!mod(109+7)=362880。
对于第二个样例测试用例,答案是 ( f ( 97 ) × f ( 98 ) × f ( 99 ) ) m o d ( 1 0 9 + 7 ) = ( 9 × 7 × 9 × 8 × 9 × 9 ) m o d ( 1 0 9 + 7 ) = 367416 (f(97) \times f(98) \times f(99)) \mod (10^9+7) = (9 \times 7 \times 9 \times 8 \times 9 \times 9) \mod (10^9+7) = 367416 (f(97)×f(98)×f(99))mod(109+7)=(9×7×9×8×9×9)mod(109+7)=367416。
翻译来自于:ChatGPT。
题目描述
Define the ‘‘digit product’’ f ( x ) f(x) f(x) of a positive integer x x x as the product of all its digits. For example, f ( 1234 ) = 1 × 2 × 3 × 4 = 24 f(1234) = 1 \times 2 \times 3 \times 4 = 24 f(1234)=1×2×3×4=24, and f ( 100 ) = 1 × 0 × 0 = 0 f(100) = 1 \times 0 \times 0 = 0 f(100)=1×0×0=0.
Given two integers
l
l
l and
r
r
r, please calculate the following value:
(
∏
i
=
l
r
f
(
i
)
)
m
o
d
(
1
0
9
+
7
)
(\prod_{i=l}^r f(i)) \mod (10^9+7)
(i=l∏rf(i))mod(109+7)
In case that you don’t know what
∏
\prod
∏ represents, the above expression is the same as
(
f
(
l
)
×
f
(
l
+
1
)
×
⋯
×
f
(
r
)
)
m
o
d
(
1
0
9
+
7
)
(f(l) \times f(l+1) \times \dots \times f(r)) \mod (10^9+7)
(f(l)×f(l+1)×⋯×f(r))mod(109+7)
输入格式
There are multiple test cases. The first line of the input contains an integer T T T (about 1 0 5 10^5 105), indicating the number of test cases. For each test case:
The first and only line contains two integers l l l and r r r ( 1 ≤ l ≤ r ≤ 1 0 9 1 \le l \le r \le 10^9 1≤l≤r≤109), indicating the given two integers. The integers are given without leading zeros.
输出格式
For each test case output one line containing one integer indicating the answer.
样例 #1
样例输入 #1
2
1 9
97 99
样例输出 #1
362880
367416
提示
For the first sample test case, the answer is 9 ! m o d ( 1 0 9 + 7 ) = 362880 9! \mod (10^9+7) = 362880 9!mod(109+7)=362880.
For the second sample test case, the answer is ( f ( 97 ) × f ( 98 ) × f ( 99 ) ) m o d ( 1 0 9 + 7 ) = ( 9 × 7 × 9 × 8 × 9 × 9 ) m o d ( 1 0 9 + 7 ) = 367416 (f(97) \times f(98) \times f(99)) \mod (10^9+7) = (9 \times 7 \times 9 \times 8 \times 9 \times 9) \mod (10^9+7) = 367416 (f(97)×f(98)×f(99))mod(109+7)=(9×7×9×8×9×9)mod(109+7)=367416.
C++实现
#include
using namespace std;
int n,l,r,s,st,t,mod=1e9+7;
int main() {
cin>>n;
for(int i=0;i<n;i++){
cin>>l>>r;
s=1;
for(int j=l;j<=r&&s;j++){
t=j;
while(t&&s){
s*=(t%10);
s%=mod;
t/=10;
}
}
cout<<s;
}
return 0;
}
后续
接下来我会不断用C++来实现信奥比赛中的算法题、GESP C++考级编程题实现、白名单赛事考题实现,感兴趣的请关注,我后续将继续分享相关内容