답안 #1513

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1513	2013-07-07T14:51:09 Z	gs13068	생일수 II (GA4_birthday2)	C++	25 / 100	3 ms	8700 KB

birthday2

#include<cstdio>
#include<cstring>

long long a[1000000],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);
    }
}

char x[1001];
char y[1001];

int main()
{
    long long X,Y,before,res=0,j=0;
    int i,k,xn,yn;
    for(i=1;i<=11;i++)backtracking(0,i);
    scanf("%s%s",x,y);
    xn=strlen(x);yn=strlen(y);
    if(xn==yn)
    {
        for(i=0;x[i]==y[i]&&i<xn&&i<yn;i++)j=(j*10+x[i]-'0')%19980305;
        sscanf(x+i,"%lld",&X);
        sscanf(y+i,"%lld",&Y);
        for(;i++<xn;)j=j*10%19980305;
    }
    else
    {
        sscanf(x,"%lld",&X);
        sscanf(y,"%lld",&Y);
    }
    before=-j;
    for(i=0;i<an;i++)
    {
        if(a[i]>=X&&a[i]<=Y)
        {
            res+=(j+before)%19980305*(j+a[i])%19980305;
            res%=19980305;
            before=a[i];
        }
    }
    printf("%lld",res);
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	8700 KB	Output is correct
2	Correct	2 ms	8700 KB	Output is correct
3	Correct	0 ms	8700 KB	Output is correct
4	Correct	0 ms	8700 KB	Output is correct
5	Correct	2 ms	8700 KB	Output is correct
6	Correct	2 ms	8700 KB	Output is correct
7	Correct	0 ms	8700 KB	Output is correct
8	Correct	0 ms	8700 KB	Output is correct
9	Correct	0 ms	8700 KB	Output is correct
10	Correct	0 ms	8700 KB	Output is correct
11	Correct	0 ms	8700 KB	Output is correct
12	Correct	0 ms	8700 KB	Output is correct
13	Correct	1 ms	8700 KB	Output is correct
14	Correct	2 ms	8700 KB	Output is correct
15	Correct	0 ms	8700 KB	Output is correct
16	Correct	2 ms	8700 KB	Output is correct
17	Correct	0 ms	8700 KB	Output is correct
18	Correct	1 ms	8700 KB	Output is correct
19	Correct	1 ms	8700 KB	Output is correct
20	Correct	0 ms	8700 KB	Output is correct

Subtask #2

15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	8700 KB	Output is correct
2	Correct	2 ms	8700 KB	Output is correct
3	Correct	0 ms	8700 KB	Output is correct
4	Correct	1 ms	8700 KB	Output is correct
5	Correct	0 ms	8700 KB	Output is correct
6	Correct	1 ms	8700 KB	Output is correct
7	Correct	1 ms	8700 KB	Output is correct
8	Correct	1 ms	8700 KB	Output is correct
9	Correct	1 ms	8700 KB	Output is correct
10	Correct	0 ms	8700 KB	Output is correct
11	Correct	0 ms	8700 KB	Output is correct
12	Correct	1 ms	8700 KB	Output is correct
13	Correct	0 ms	8700 KB	Output is correct
14	Correct	1 ms	8700 KB	Output is correct
15	Correct	1 ms	8700 KB	Output is correct
16	Correct	3 ms	8700 KB	Output is correct
17	Correct	0 ms	8700 KB	Output is correct
18	Correct	2 ms	8700 KB	Output is correct
19	Correct	1 ms	8700 KB	Output is correct
20	Correct	1 ms	8700 KB	Output is correct

Subtask #3

0.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	8700 KB	Output is correct
2	Correct	1 ms	8700 KB	Output is correct
3	Correct	1 ms	8700 KB	Output is correct
4	Correct	1 ms	8700 KB	Output is correct
5	Correct	1 ms	8700 KB	Output is correct
6	Correct	1 ms	8700 KB	Output is correct
7	Correct	1 ms	8700 KB	Output is correct
8	Correct	1 ms	8700 KB	Output is correct
9	Correct	1 ms	8700 KB	Output is correct
10	Correct	2 ms	8700 KB	Output is correct
11	Correct	1 ms	8700 KB	Output is correct
12	Correct	2 ms	8700 KB	Output is correct
13	Correct	2 ms	8700 KB	Output is correct
14	Correct	0 ms	8700 KB	Output is correct
15	Correct	1 ms	8700 KB	Output is correct
16	Correct	1 ms	8700 KB	Output is correct
17	Correct	0 ms	8700 KB	Output is correct
18	Correct	1 ms	8700 KB	Output is correct
19	Incorrect	1 ms	8700 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	0 ms	8696 KB	SIGSEGV Segmentation fault
2	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	0 ms	8696 KB	SIGSEGV Segmentation fault
2	Halted	0 ms	0 KB	-