Submission #17523

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
17523	2015-12-25 13:50:33	atomzeno	생일수 I (GA4_birthday1)	C++98	100 / 100	127 ms	4988 KiB

birthday1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#define MX 1000001
int A[MX],B[3]={3,5,8},a,num[3];
int main(){
    int i,j,n;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    A[0]=0;
    for(i=1;i<MX;i++){A[i]=MX+1;}
    for(i=1;i<MX;i++){
        for(j=0;j<3;j++){
            if(i>=B[j]&&(A[i-B[j]]+1)<A[i]){
                A[i]=(A[i-B[j]]+1);
            }
        }
    }
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&a);
        if(A[a]==MX+1){printf("-1\n");}
        else{
            for(j=0;j<3;j++){num[j]=0;}
            for(j=a;j!=0;){
                if(j>=8&&(A[j-8]+1)==A[j]){
                    num[2]++;
                    j-=8;\
                }
                else if(j>=5&&(A[j-5]+1)==A[j]){
                    num[1]++;
                    j-=5;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 19 / 19
• Subtask 3: 26 / 26
• Subtask 4: 41 / 41