本文主要是介绍uva10935（栈），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Problem B: Throwing cards away I
对于此题，我只能说很无奈，就是因为输入1的时候没有控制好，所以答案一直是错误的！
Given is an ordered deck of
n cards numbered 1 to
nwith card 1 at the top and card
n at the bottom.The following operation is performed as long as there are at least two cardsin the deck:
Throw away the top card and move the card that is now on the top of thedeck to the bottom of the deck.
Your task is to find the sequence of discarded cards and the last, remainingcard.
Each line of input (except the last) contains a numbern ≤ 50. The last line contains 0 and thisline should not be processed. For each number from the input producetwo lines of output. The first line presents the sequence of discarded cards,the second line reports the last remaining card. No line will have leading or trailing spaces.See the sample for the expected format.
Sample input
7 19 10 6 0
Output for sample input
Discarded cards: 1, 3, 5, 7, 4, 2 Remaining card: 6 Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14 Remaining card: 6 Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8 Remaining card: 4 Discarded cards: 1, 3, 5, 2, 6 Remaining card: 4
Folklore, adapted by Piotr Rudnicki
c#include<stdio.h>
#include<string.h>
int a[10000];
int main()
{int i,n,count;while(scanf("%d",&n)!=EOF){if(n==0) break;if(n==1) {printf("Discarded cards:\nRemaining card: 1\n");continue;}memset(a,0,sizeof(a));printf("Discarded cards:");count=0;for(i=0;i<n;i++)a[i]=i+1;int r=n,f=0;while(f<r){if(count!=0) printf(",");printf(" %d",a[f++]);a[r++]=a[f++];count++;if(count==n-1) break;}printf("\nRemaining card: %d\n",a[f]);}return 0;}c++#include<stdio.h>
#include<string.h>
struct queue
{int f,r,n,k,a[100];void init(int len){memset(a,0,sizeof(a));n=len;f=k=r=0;}void push(int x){a[(k++)%n]=x;r++;}void pop(){f++;}int ff(){return a[f%n];}int f_(){return f;}int rr(){return a[r%n];}int r_(){return r;}int length(){return n;}int empty(){return f<r?0:1;}
};
main()
{int n,i;queue q;while(scanf("%d",&n)!=EOF){if(n==0) break;if(n==1) {printf("Discarded cards:\nRemaining card: 1\n");continue;}printf("Discarded cards:");q.init(n);for(i=0;i<n;i++)q.push(i+1);while(!q.empty()){if(q.r-q.f==2) break;printf(" %d,",q.ff());q.pop();q.push(q.ff());q.pop();}printf(" %d",q.ff());q.pop();q.push(q.ff());q.pop();printf("\nRemaining card: %d\n",q.ff());}return 0;
}这篇关于uva10935（栈）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
