#include<stdio.h>
const long long int T=19980305;
long long int ans;
long long int ls[100010];
int l;
bool check(int x)
{
while(x){
if(x%10!=3&&x%10!=5&&x%10!=8)return false;
x/=10;
}
return true;
}
int main()
{
int x,y;
scanf("%d%d",&x,&y);
int i;
for(i=x;i<=y;i++){
if(check(i)){ls[l]=i;l++;}
}
for(i=1;i<l;i++){
ans+=ls[i]*ls[i-1];
ans%=T;
}printf("%lld",ans);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1668 KB |
Output is correct |
2 |
Correct |
0 ms |
1668 KB |
Output is correct |
3 |
Correct |
0 ms |
1668 KB |
Output is correct |
4 |
Correct |
0 ms |
1668 KB |
Output is correct |
5 |
Correct |
0 ms |
1668 KB |
Output is correct |
6 |
Correct |
0 ms |
1668 KB |
Output is correct |
7 |
Correct |
0 ms |
1668 KB |
Output is correct |
8 |
Correct |
0 ms |
1668 KB |
Output is correct |
9 |
Correct |
0 ms |
1668 KB |
Output is correct |
10 |
Correct |
0 ms |
1668 KB |
Output is correct |
11 |
Correct |
0 ms |
1668 KB |
Output is correct |
12 |
Correct |
0 ms |
1668 KB |
Output is correct |
13 |
Correct |
1 ms |
1668 KB |
Output is correct |
14 |
Correct |
0 ms |
1668 KB |
Output is correct |
15 |
Correct |
0 ms |
1668 KB |
Output is correct |
16 |
Correct |
0 ms |
1668 KB |
Output is correct |
17 |
Correct |
0 ms |
1668 KB |
Output is correct |
18 |
Correct |
0 ms |
1668 KB |
Output is correct |
19 |
Correct |
0 ms |
1668 KB |
Output is correct |
20 |
Correct |
0 ms |
1668 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
330 ms |
1668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1668 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2104 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
2100 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |