//UVA10935ThrowingCardAwayI
//#define LOCAL
#include<cstdio>
#include<iostream>
#include<queue>
#include<string>
#include<algorithm>
using namespace std;
int main() {
int n;
while(scanf("%d", &n) == 1 && n) {
queue<int> Card;
for(int i = 1; i <= n; i++) Card.push(i);
int cnt = 0;
printf("Discarded cards:");
while(Card.size() > 1) {
int t1 = (int)Card.front(); Card.pop();
if(cnt++) printf(",");
printf(" %d", t1);
int t2 = Card.front(); Card.pop();
Card.push(t2);
}
printf("\nRemaining card: %d\n", (int)Card.front());
}
return 0;
}
UVA10935ThrowingCardAwayI
最新推荐文章于 2020-12-09 23:31:13 发布