algorithmStudy/1158.cpp at master · judy5050/algorithmStudy · 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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//
//  1158.cpp
//  algo
//
//  Created by 박효정 on 2021/07/28.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;

int main(){

    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);

    int n,k;
    cin>>n>>k;

    vector<int>v(n);
    queue<int>tmp;
    for(int i=0;i<n;i++){
        tmp.push(i+1);
    }

    int cnt=0;
    int index=0;
    queue<int>q;
    while (!tmp.empty()) {
        cnt++;
        if(cnt%k==0){
            q.push(tmp.front());
            tmp.pop();
            index--;
        }else{
            tmp.push(tmp.front());
            tmp.pop();
        }
        index++;


    }


    cout<<'<';
    while(q.size()>1){

        cout<<q.front()<<','<<' ';
        q.pop();
    }

    cout<<q.front()<<'>'<<"\n";

    return 0;
}