233162026-01-19 11:01:30KoszorusBlankaTáblajátékcpp17Partially correct 36/501ms508 KiB
#include <iostream>

using namespace std;

int main()
{
    int K;
    cin >> K;

    int mezo = 0, sor = 0, L;
    for (int i = 1; i <= K; i++) {
        cin >> L;
        switch(L) {
            case 0:
                mezo *= 2;
                sor += 1;
                break;
            case 1:
                mezo = mezo*2+1;
                sor += 1;
                break;
            case 2:
                mezo /= 2;
                sor -= 1;
                break;
            case 3:
                mezo -= 1;
                break;
            case 4:
                mezo += 1;
                break;
        }
    }

    int binaris = 0, hatv = 1;
    do {
        binaris += mezo%2*hatv;
        mezo /= 2;
        hatv *= 10;
    } while (mezo > 0);

    cout << sor << endl << binaris;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base36/50
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms316 KiB
6Partially correct1/31ms316 KiB
7Accepted3/31ms316 KiB
8Partially correct1/31ms316 KiB
9Accepted3/31ms316 KiB
10Partially correct1/31ms508 KiB
11Accepted3/31ms316 KiB
12Partially correct1/31ms316 KiB
13Accepted4/41ms316 KiB
14Partially correct1/41ms316 KiB
15Accepted4/41ms316 KiB
16Partially correct1/41ms500 KiB
17Accepted4/41ms316 KiB