| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 2149 | mhkim4886 | 생일수 I (GA4_birthday1) | C++98 | 0 ms | 0 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>
typedef struct _Num
{
int num;
int total;
} Num;
int out[101], n, qrear = 1, qtail = 1;
Num que[100001];
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
int k;
scanf("%d", &k);
qrear = 1;
qtail = 1;
que[qtail].num = que[qtail++].total = 3;
que[qtail].num = que[qtail++].total = 5;
que[qtail].num = que[qtail++].total = 8;
while(true)
{
int q = que[qrear++].total;
if(q == k)
{
out[i] = que[qrear-1].num;
break;
}
else
{
if(que[qrear-1].total + 3 <= k) que[qtail++] = { que[qrear-1].num * 10 + 3, que[qrear-1].total + 3 };
if(que[qrear-1].total + 5 <= k) que[qtail++] = { que[qrear-1].num * 10 + 5, que[qrear-1].total + 5 };
if(que[qrear-1].total + 8 <= k) que[qtail++] = { que[qrear-1].num * 10 + 8, que[qrear-1].total + 8 };
}
if(qrear == qtail) { out[i] = -1; break; }
}
}
for(int i = 1; i <= n; i++) printf("%d\n", out[i]);
}