#include <stdio.h>
long long x, y;
long long ret;
int main() {
scanf("%lld%lld", &x, &y);
long long last = x, i, j, n;
for(i = x+1; i <= y; i++) {
for(n = i; n > 0; n /= 10) {
if(n % 10 != 3 && n % 10 != 5 && n % 10 != 8) break;
}
if(n > 0) continue;
ret = (ret + last * i) % 19980305;
last = i;
}
printf("%lld\n", ret);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
884 KB |
Output is correct |
2 |
Correct |
0 ms |
884 KB |
Output is correct |
3 |
Correct |
0 ms |
884 KB |
Output is correct |
4 |
Correct |
0 ms |
884 KB |
Output is correct |
5 |
Correct |
0 ms |
884 KB |
Output is correct |
6 |
Correct |
0 ms |
884 KB |
Output is correct |
7 |
Correct |
0 ms |
884 KB |
Output is correct |
8 |
Correct |
0 ms |
884 KB |
Output is correct |
9 |
Correct |
0 ms |
884 KB |
Output is correct |
10 |
Correct |
0 ms |
884 KB |
Output is correct |
11 |
Correct |
0 ms |
884 KB |
Output is correct |
12 |
Correct |
0 ms |
884 KB |
Output is correct |
13 |
Correct |
0 ms |
884 KB |
Output is correct |
14 |
Correct |
0 ms |
884 KB |
Output is correct |
15 |
Correct |
0 ms |
884 KB |
Output is correct |
16 |
Correct |
0 ms |
884 KB |
Output is correct |
17 |
Correct |
0 ms |
884 KB |
Output is correct |
18 |
Correct |
0 ms |
884 KB |
Output is correct |
19 |
Correct |
0 ms |
884 KB |
Output is correct |
20 |
Correct |
0 ms |
884 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
363 ms |
884 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
0 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
0 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
0 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |