제출 #2150

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
2150		mhkim4886	생일수 I (GA4_birthday1)	C++98	14 / 100	0 ms	1668 KiB

birthday1

#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].num = que[qrear-1].num * 10 + 3;
                    que[qtail++].total = que[qrear-1].total + 3;
                }
                if(que[qrear-1].total + 5 <= k)
                {
                    que[qtail].num = que[qrear-1].num * 10 + 5;
                    que[qtail++].total = que[qrear-1].total + 5;
                }
                if(que[qrear-1].total + 8 <= k)
                {
                    que[qtail].num = que[qrear-1].num * 10 + 8;
                    que[qtail++].total = que[qrear-1].total + 8;
                }
            }

            if(qrear == qtail)
            {
                out[i] = -1;
                break;
            }
        }
    }

    for(int i = 1; i <= n; i++) printf("%d\n", out[i]);
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 19
• Subtask 3: 0 / 26
• Subtask 4: 0 / 41