QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#499523 | #6731. Digit Product | 122 | TL | 0ms | 3572kb | C++14 | 766b | 2024-07-31 15:17:19 | 2024-07-31 15:17:20 |
Judging History
answer
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int mod = 1e9 + 7;
int f(int a)
{
int sum = 1;
while (a / 10)
{
int tem = a % 10;
sum *= tem;
a /= 10;
}
int tem = a % 10;
sum *= tem;
a /= 10;
return sum;
}
signed main() {
IOS;
int t;
cin >> t;
while (t--)
{
int l, r;
bool flag=true;
cin >> l >> r;
if(r-l>=10)
{
flag=false;
cout<<0<<endl;
}
int ans = 1;
for (int i = l; i <= r; i++)
{
ans *= f(i);
ans %= mod;
}
if(flag)cout << ans << endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3572kb
input:
2 1 9 97 99
output:
362880 367416
result:
ok 2 number(s): "362880 367416"
Test #2:
score: -100
Time Limit Exceeded
input:
100000 657483518 657483518 296765674 296765675 500554849 500554849 392403 392411 962255578 962255578 35428433 35428436 362396272 362396273 284893570 974440644 115568436 806300808 751214641 751214647 646086592 646086598 437591523 437591526 263956058 263956059 558669721 558669723 655489691 655489692 2...
output:
806400 174246393 0 0 1512000 -245012473 343669753 0