#include<stdio.h>
int cnt[1000111][3];
int d[1000111];
int coin[3]={3,5,8};
int main()
{
int i,j,k,t,n;
scanf("%d",&t);
for(i=1;i<=t;i++){
scanf("%d",&n);
for(j=1;j<=n;j++){
cnt[j][0]=cnt[j][1]=cnt[j][2]=0;
d[j]=0;
}
d[3]=1;cnt[3][0]=1;
d[5]=1;cnt[5][1]=1;
d[8]=1;cnt[8][2]=1;
for(j=1;j<=n;j++){
if(!d[j]) continue;
for(k=0;k<3;k++){
if(d[j]+1<d[j+coin[k]] || !d[j+coin[k]]){
d[j+coin[k]]=d[j]+1;
cnt[j+coin[k]][0]=cnt[j][0];
cnt[j+coin[k]][1]=cnt[j][1];
cnt[j+coin[k]][2]=cnt[j][2];
cnt[j+coin[k]][k]++;
}
}
}
if(!d[n]) printf("-1\n");
else{
for(j=0;j<3;j++){
if(cnt[n][j]){
for(k=1;k<=cnt[n][j];k++)
printf("%d",coin[j]);
}
}
}
printf("\n");
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
16512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
16512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
16512 KB |
Output is correct |
2 |
Correct |
1 ms |
16512 KB |
Output is correct |
3 |
Correct |
1 ms |
16512 KB |
Output is correct |
4 |
Correct |
0 ms |
16512 KB |
Output is correct |
5 |
Correct |
0 ms |
16512 KB |
Output is correct |
6 |
Correct |
0 ms |
16512 KB |
Output is correct |
7 |
Correct |
1 ms |
16512 KB |
Output is correct |
8 |
Correct |
1 ms |
16512 KB |
Output is correct |
9 |
Correct |
1 ms |
16512 KB |
Output is correct |
10 |
Correct |
0 ms |
16512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1000 ms |
16512 KB |
Program timed out |
2 |
Halted |
0 ms |
0 KB |
- |