https://www.acmicpc.net/problem/1158
#include <stdio.h>
#define MAX 5000
int queue[MAX + 1];
int front = 0; //큐의 앞
int rear = 0; // 큐의 뒤
int size = 0; // 큐 안에 들어가있는 요소들
// 원형 큐 push
void enqueue(int item){
rear = (rear + 1) % MAX;
queue[rear] = item;
size++;
}
// 원형 큐 pop
int dequeue(){
front = (front + 1) % MAX;
size--;
return queue[front];
}
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 1; i <= n; i++){
enqueue(i); // 1~n까지의 값 큐에 넣기
}
int idx = 0; // 현재 몇명이 제거되었는지 확인하는 변수
printf("<");
while(size != 0){
for(int i = 1; i <= k; i++){
if(i == k){
++idx;
if(idx == n){
printf("%d",dequeue());
}
else{
printf("%d, ",dequeue());
}
}
else{
enqueue(dequeue());
}
}
}
printf(">");
return 0;
}
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define fastio cin.tie(0)->sync_with_stdio(0)
#define sz(v) (int)(v).size()
#define all(v) v.begin(), v.end()
#define rall(v) (v).rbegin(), (v).rend()
#define compress(v) sort(all(v)), (v).erase(unique(all(v)), (v).end())
#define OOB(x, y) ((x) < 0 || (x) >= n || (y) < 0 || (y) >= m)
#define debug(x) cout << (#x) << ": " << (x) << '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using ldb = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vs = vector<string>;
using tii = tuple<int,int,int>;
template<typename T> using wector = vector<vector<T>>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;
int main() {
fastio;
int n,k; cin >> n >> k;
queue<int> Q;
for(int i = 1; i <= n; i++) Q.push(i);
vi v(n);
for(int i = 0; i < n; i++){
for(int i = 0; i < k - 1; i++){
auto temp = Q.front();
Q.push(temp);
Q.pop();
}
v[i] = Q.front();
Q.pop();
}
cout << '<';
for(int i = 0; i < v.size(); i++){
cout << v[i];
if(i != v.size() - 1) cout << ',' << ' ';
}
cout << '>';
return 0;
}