oj.uz

Submission #2294

# Submission time Handle Problem Language Result Execution time Memory
2294 2013-07-21T01:41:23 Z rbwhddl2000 생일수 I (GA4_birthday1) C
14 / 100
 110 ms 8600 KB 
#include<stdio.h>
int d[101], t3[101], t5[101], kk[101], f3[1000001], f5[1000001];
int main()
{
    int n, i, a, j, maxim=0, mini, k, tt;
    scanf("%d", &n);
    for(i=1;i<=n;i++){
            scanf("%d", &d[i]);
            if(maxim<d[i]) maxim=d[i];
    }
    for(i=3;i<=maxim;i+=3)f3[i]=i/3;
    for(i=5;i<=maxim;i+=5)f5[i]=i/5;
    for(i=1;i<=n;i++){
        mini=9999999;
        k=0;
        tt=d[i];
        while(1){
            if(tt<0)break;
            if(tt==0){
                t3[i]=0;
                t5[i]=0;
                kk[i]=k;
            }
            if(f3[tt]!=0 && f3[tt]+k < mini){
                mini=f3[tt]+k;
                t3[i]=f3[tt];
                t5[i]=0;
                kk[i]=k;
            }
            if(f5[tt]!=0 && f5[tt]+k < mini){
                mini=f5[tt]+k;
                t5[i]=f5[tt];
                t3[i]=0;
                kk[i]=k;
            }
            k++;
            tt-=8;
        }
    }for(i=1;i<=n;i++){
        if(t3[i]==0 && t5[i]==0 && kk[i]==0)printf("-1");
        for(j=1;j<=t3[i];j++)printf("3");
        for(j=1;j<=t5[i];j++)printf("5");
        for(j=1;j<=kk[i];j++)printf("8");
        printf("\n");
    }
    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 8600 KB Output is correct

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 8600 KB Output isn't correct

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 8600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 41.0

# Verdict Execution time Memory Grader output
1 Incorrect 110 ms 8600 KB Output isn't correct
2 Halted 0 ms 0 KB -