QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#499524 | #6731. Digit Product | 122 | WA | 51ms | 3656kb | C++14 | 786b | 2024-07-31 15:18:40 | 2024-07-31 15:18:41 |
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;
continue;
}
int ans = 1;
for (int i = l; i <= r; i++)
{
ans *= f(i);
ans %= mod;
}
if(flag)cout << ans << endl;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
input:
2 1 9 97 99
output:
362880 367416
result:
ok 2 number(s): "362880 367416"
Test #2:
score: -100
Wrong Answer
time: 51ms
memory: 3656kb
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 0 0 0 332300288 0 -869820601 464551936 390680368 -998244352 0 0 0 0 -924894713 4320 11337408 653184 402653184 0 13265906 -127810553 4608 0 26880 0 0 -508729617 311040 0 198030841 0 -147483634 489888 51840 0 -816068649 0 933120 0 0 0 0 483840 335183...
result:
wrong answer 2nd numbers differ - expected: '410944971', found: '174246393'