백준 2164번 카드2 C++

queue를 사용했을 때

#include <iostream>
#include <queue>
using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n = 0;
	cin >> n;

	queue<int> q;
	for (int i = 1; i <= n; ++i)
		q.push(i);

	for (int i = 1; i <= n - 1; ++i) {
		q.pop();

		q.push(q.front());
		q.pop();
	}
	cout << q.front() << '\n';

	return 0;
}

 

deque를 사용했을 때

#include <iostream>
#include <deque>
using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n = 0;
	cin >> n;

	deque<int> q;
	for (int i = 1; i <= n; ++i)
		q.push_back(i);

	for (int i = 1; i <= n - 1; ++i) {
		q.pop_front();

		q.push_back(q.front());
		q.pop_front();
	}
	cout << q.front() << '\n';

	return 0;
}

 

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

2164번: 카드2