149912025-02-10 20:30:45PappMatyasTáblajáték 2 (70 pont)cpp17Partially correct 68/701ms756 KiB
#include <iostream>

using namespace std;

int main()
{
    int a, x, A[100] = {0}, n = 0;
    bool first = false;
    cin >> a;
    for(int i = 0; i < a; i++)
    {
        cin >> x;
        if(x < 3)
        {
            for(int j = 1; j < 100; j++)
            {
                A[j - 1] = A[j];
            }
            A[99] = x;
            n++;
        }
        if(x == 3)
        {
            for(int j = 99; j >= 0; j--)
            {
                A[j+1] = A[j];
            }
            n--;
        }
        if(x == 4)
        {
            if(A[99] == 0)
            {
                for(int i = 99; i >= 0; i--)
                {
                    if(A[i] > 0)
                    {
                        A[i]--;
                        break;
                    }
                    else
                    {
                        A[i] = 2;
                    }
                }
            }
            else
            {
                A[99]--;
            }
        }
        if(x == 5)
        {
            if(A[99] == 2)
            {
                for(int i = 99; i >= 0; i--)
                {
                    if(A[i] < 2)
                    {
                        A[i]++;
                        break;
                    }
                    else
                    {
                        A[i] = 0;
                    }
                }
            }
            else
            {
                A[99]++;
            }
        }
    }
    cout << n << endl;
    for(int i = 0; i < 100; i++)
    {
        if(first)
        {
            cout << A[i];
        }
        else
        {
            if(A[i] != 0)
            {
                first = true;
                cout << A[i];
            }
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base68/70
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted2/21ms316 KiB
4Accepted3/31ms332 KiB
5Accepted3/31ms756 KiB
6Accepted3/31ms508 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms408 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms404 KiB
12Accepted3/31ms508 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted4/41ms508 KiB
16Accepted4/41ms316 KiB
17Accepted4/41ms316 KiB
18Accepted4/41ms396 KiB
19Accepted4/41ms316 KiB
20Accepted4/41ms564 KiB
21Accepted4/41ms316 KiB
22Accepted4/41ms316 KiB
23Partially correct1/31ms500 KiB