QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#499527 | #6731. Digit Product | 122 | AC ✓ | 32ms | 3564kb | C++14 | 807b | 2024-07-31 15:22:36 | 2024-07-31 15:22:37 |
Judging History
answer
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
#define int long long
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;
continue;
}
int ans = 1;
for (int i = l; i <= r; i++)
{
ans *= f(i);
ans %= mod;
}
if(flag)cout << ans << endl;
}
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
input:
2 1 9 97 99
output:
362880 367416
result:
ok 2 number(s): "362880 367416"
Test #2:
score: 0
Accepted
time: 32ms
memory: 3560kb
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 410944971 0 0 1512000 155233636 998375151 0 0 414306437 0 208997103 0 129273888 911603819 243342348 649464275 0 0 0 0 722813914 4320 11337408 653184 787649465 0 652380550 189496944 4608 0 26880 0 0 99347696 311040 0 208177374 0 16458092 489888 51840 0 888464445 0 933120 0 0 0 748384125 483840...
result:
ok 100000 numbers