C++(씨쁠쁠)(cplusplus)-백준(baekjoon)(BaekJoon)코딩 2164번:카드 2 답

#include <iostream>
using namespace std;
int n, a[1000001],p,r=1;
void insert_node(int x);
void delete_node();
int main() {
    int n;
    cin >> n;
    p = n+1;
    for (int i = 1; i <= n; i++)
        a[i] = i;
    while(n>=2)
    {
        delete_node();
        int tmp = a[r];
        delete_node();
        insert_node(tmp);
        n--;
    }
    for(int i = 1; i<=1000001; i++)
        if (a[i]) { cout << a[i] << '\n'; break; }
}
void insert_node(int x)
{
    a[p++] = x;
}
void delete_node() 
{
    a[r++] = 0;
}