[UVA10935]Throwing cards away I(模拟+双端队列)

题目

https://odzkskevi.qnssl.com/bc8f4a27cb57cafb184320d2484b0cda?v=1526822479

思路

模拟，直接上STL吧……

代码

#include <bits/stdc++.h>
using namespace std;

int n;
deque<int> qu;
vector<int> dcards;
int remain;

void init() {
    for(int i = 1; i <= n; i++) {
        qu.push_back(i);
    }
}

void simulation() {
    while(qu.size() != 1) {
        dcards.push_back(qu.front());
        qu.pop_front();
        qu.push_back(qu.front());
        qu.pop_front();
    }
    remain = qu.front();
}

int main() {
    //freopen("input.txt", "r", stdin);
    while(cin >> n && n) {
        qu.clear(); dcards.clear();
        init();
        simulation();
        cout << "Discarded cards:";
        int fir = 1;
        for(int i = 0; i < dcards.size(); i++) 
            if (fir == 0) {cout << ", " << dcards[i]; }
            else {cout << " " << dcards[i]; fir = 0; }
        cout << endl;
        cout << "Remaining card:";
        cout << " " << remain << endl;;
    }
    return 0;
}