#include<cstdio>
long long a[100000],an;
void backtracking(long long i,int j)
{
if(j==0)a[an++]=i;
else
{
backtracking(i*10+3,j-1);
backtracking(i*10+5,j-1);
backtracking(i*10+8,j-1);
}
}
int main()
{
long long x,y,before=0,res=0;
int i;
for(i=1;i<10;i++)backtracking(0,i);
scanf("%lld%lld",&x,&y);
for(i=0;i<an;i++)
{
if(a[i]>=x&&a[i]<=y)
{
res+=before*a[i];
res%=19980305;
before=a[i];
}
}
printf("%lld",res);
}
# |
결과 |
실행 시간 |
메모리 |
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 |
0 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 |
0 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 |
3 ms |
2108 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2108 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |