백준 2164 : 카드2

https://www.acmicpc.net/problem/2164

2164번: 카드2

 

#include <iostream>
#include <queue>
using namespace std;
int n;
queue<int> q;
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) q.push(i);
	while (q.size() > 1) {
		q.pop();
		q.push(q.front());
		q.pop();
	}
	printf("%d", q.front());
}