UVA 120 --- Stacks of Flapjacks 模拟
来源:互联网 发布:杀蚊软件 编辑:程序博客网 时间:2024/06/10 05:22
一开始根本没看懂题,后来才看懂,一摞饼,直径不一样,怎么翻才能让饼的直径从上到下依次为从小到大,输出从下往上数第几个饼下面插进铲子翻饼。。。。。
#include <stdio.h>#include <stdlib.h>#include <ctype.h>#include <string.h>#include <algorithm>using namespace std;const char *p = " ";int s[35];int st[35];char sr[5010];int jl[3000];bool pd(int k){ for(int i = 0; i < k; i++) { if(s[i] != st[i]) return false; } return true;}int main(){ int k; char zh[4]; char *q = zh; while(gets(sr)) { k = 0; int js = 0; q = strtok(sr,p); while(q != NULL) { s[k] = atoi(q); st[k] = s[k]; k++; q = strtok(NULL,p); } for(int i = 0;i < k;i++) { printf("%d",s[i]); if(i < k - 1) printf(" "); } printf("\n"); sort(st,st + k); int n = k; while(!pd(k) && n != 0) { int mx = -1; int xb = -1; for(int i = 0;i < n;i++) { if(mx < s[i]) { mx = s[i]; xb = i; } } if(s[n - 1] != mx) { if(s[0] == mx) { int *x = &s[0]; int *y = &s[n - 1]; while(x < y) { int tmp = *x; *x = *y; *y = tmp; x++; y--; } jl[js++] = k - n + 1; n--; } else { int *x = &s[0]; int *y = &s[xb]; while(x < y) { int tmp = *x; *x = *y; *y = tmp; x++; y--; } jl[js++] = k - xb; } } else n--; } for(int i = 0;i < js;i++) { printf("%d ",jl[i]); } printf("0\n"); } return 0;}
0 0
- uva 120 Stacks of Flapjacks(模拟)
- UVA 120 --- Stacks of Flapjacks 模拟
- UVA 120 Stacks of Flapjacks
- UVa 120 - Stacks of Flapjacks
- uva 120 Stacks of Flapjacks
- UVA 120 - Stacks of Flapjacks
- uva 120 - Stacks of Flapjacks
- UVa 120 - Stacks of Flapjacks
- UVA 120 - Stacks of Flapjacks
- UVa 120 - Stacks of Flapjacks
- UVA 120Stacks of Flapjacks
- UVA 120 - Stacks of Flapjacks
- uva 120 Stacks of Flapjacks
- UVA 120 Stacks of Flapjacks
- uva 120 Stacks of Flapjacks
- uva - 120 - Stacks of Flapjacks
- UVa 120 - Stacks of Flapjacks
- UVA - 120 - Stacks of Flapjacks
- 【C语言】二分查找法
- 写一个函数返回参数值为1的个数 比如:15 0000 1111 4个1
- java applet嵌入IE8-IE11无法加载或提示java jre升级更新,更新成
- daemon进程
- remine chart2安装
- UVA 120 --- Stacks of Flapjacks 模拟
- getOutputStream() has already been called for this response
- oracle数据库存储过程的一个实例(运用到游标和循环)
- 求10个数中最大值
- 问题:如何获取当前步骤的子步骤所有处理人?见正文
- 初学cocos2d-x之抄袭别人的旅程之跑酷01-前言
- Java源码乱码问题 编码转换器
- 雷观(十六):以习近平为首的新一届领导集体,大权在握,做事很有信心
- UVA 156 --- Ananagrams 排序去重