code-problems/Algorithm/Queue/boj2164.cpp at master · wildDoubt/code-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
#include <iostream>
#include <deque>

using namespace std;

int main() {
    int N;
    cin >> N;
    deque<int> cards(N);
    for (int i = 0; i < N; ++i) {
        cards[i] = i;
    }

    bool discard = true;
    while (cards.size() != 1) {
        if (discard) {
            cards.pop_front();
        } else {
            cards.push_back(cards.front());
            cards.pop_front();
        }
        discard=!discard;
    }
    cout<<cards.front()+1<<'\n';
    return 0;
}