难度:2
队列的简单应用,需要注意输入是1时,是没有抛弃的卡片的。
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int main() {
int n;
while (cin >> n && n) {
queue<int> q;
for (int i = 1; i <= n; i++) {
q.push(i);
}
cout << "Discarded cards:";
int ok = 0;
while (q.size() >= 2) {
if (ok == 0) {
ok = 1;
} else cout << ",";
cout << " " << q.front();
q.pop();
q.push(q.front());
q.pop();
}
cout << endl << "Remaining card: " << q.front() << endl;
}
return 0;
}