| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 2144 | 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 main()
{
int out[101], n, qrear = 1, qtail = 1;
Num queue[100001];
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
int k;
scanf("%d", &k);
qrear = 1;
qtail = 1;
queue[qtail++] = { 3, 3 };
queue[qtail++] = { 5, 5 };
queue[qtail++] = { 8, 8 };
while(true)
{
int q = queue[qrear++].total;
if(q == k)
{
out[i] = queue[qrear-1].num;
break;
}
else
{
if(queue[qrear-1].total + 3 <= k) queue[qtail++] = { queue[qrear-1].num * 10 + 3, queue[qrear-1].total + 3 };
if(queue[qrear-1].total + 5 <= k) queue[qtail++] = { queue[qrear-1].num * 10 + 5, queue[qrear-1].total + 5 };
if(queue[qrear-1].total + 8 <= k) queue[qtail++] = { queue[qrear-1].num * 10 + 8, queue[qrear-1].total + 8 };
}
}
}
for(int i = 1; i <= n; i++) printf("%d\n", out[i]);
}