QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#499392#6731. Digit Product1DemonS1AC ✓22ms3692kbC++20874b2024-07-31 13:43:342024-07-31 13:43:36

Judging History

你现在查看的是最新测评结果

  • [2024-07-31 13:43:36]
  • 评测
  • 测评结果:AC
  • 用时:22ms
  • 内存:3692kb
  • [2024-07-31 13:43:34]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define ll long long
#define PII std::pair<int,int>
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int T; cin >> T;
    while (T--) {
        int l, r; cin >> l >> r;
        bool flag = false;
        int ans = 1;
        for (int i = l; i <= r; ++i) {
            int num = i;
            while (num) {
                int temp = num % 10;
                if (temp == 0) {
                    flag = true;
                    break;
                }
                ans = ans * temp % mod;
                num /= 10;
            }
            if (flag) break;
        }
        if (flag) cout << "0" << endl;
        else cout << ans % mod << endl;
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3556kb

input:

2
1 9
97 99

output:

362880
367416

result:

ok 2 number(s): "362880 367416"

Test #2:

score: 0
Accepted
time: 22ms
memory: 3692kb

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