uva10935(栈)
来源:互联网 发布:java编程笔试题 编辑:程序博客网 时间:2024/05/15 06:47
Problem B: Throwing cards away I
对于此题,我只能说很无奈,就是因为输入1的时候没有控制好,所以答案一直是错误的!
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
7191060
Output for sample input
Discarded cards: 1, 3, 5, 7, 4, 2Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 4, 8, 12, 16, 2, 10, 18, 14Remaining card: 6Discarded cards: 1, 3, 5, 7, 9, 2, 6, 10, 8Remaining card: 4Discarded cards: 1, 3, 5, 2, 6Remaining 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(栈)
- uva10935
- UVA10935
- uva10935
- UVa10935
- Uva10935
- UVa10935(队列) Throwing cards away I
- 队列与栈的使用——以UVa10935&UVa1594为例
- UVA10935-卡片游戏
- uva10935解题报告
- UVA10935纸牌问题
- UVa10935 - Throwing cards away I
- UVA10935 - Throwing cards away I
- uva10935 - Throwing cards away I
- UVa10935 - Throwing cards away I
- 5-3卡片游戏 uva10935
- 习题5-3 卡片游戏 UVa10935
- Uva10935——Throwing cards away I
- 将 confirm的确定取消修改为是否
- Box2D创建圆角刚体
- PAT (Basic Level) Practise (中文)—— 1008. 数组元素循环右移问题
- Android 中的防锯齿
- 用户体验的建议
- uva10935(栈)
- JavaScript入门之事件、cookie、定时篇
- 【Java】简单数据同步(日志同步)设计(1)
- 字符、字符串输入格式总结
- 关于struct 的定义
- 关于Android试水项目的思考
- VC++和OLE开发CAD
- 经由过程百度地图API,将百度坐标转换成GPS经纬度
- Android XML解析器的问题