# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20877 | jjwdi0 | 생일수 I (GA4_birthday1) | C++11 | 263 ms | 16740 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#define INF 987654321
int dp[1000035][4], test, a[3]={3, 5, 8};
main()
{
scanf("%d", &test);
for(int i=0; i<=1000000; i++)dp[i][0]=INF;
dp[3][0]=dp[3][1]=dp[5][0]=dp[5][2]=dp[8][0]=dp[8][3]=1;
for(int i=0; i<=999997; i++)
{
if(dp[i][0]!=INF)
{
for(int j=0; j<3; j++)
{
if(dp[i+a[j]][0]>dp[i][0]+1)
{
for(int k=1; k<=3; k++)dp[i+a[j]][k]=dp[i][k];
dp[i+a[j]][0]=dp[i][0]+1;
dp[i+a[j]][j+1]++;
}
}
}
}
while(test--)
{
int n;
scanf("%d", &n);
if(dp[n][0]==INF)puts("-1");
else
{
for(int i=0; i<dp[n][1]; i++)printf("3");
for(int i=0; i<dp[n][2]; i++)printf("5");
for(int i=0; i<dp[n][3]; i++)printf("8");
puts("");
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |