zoj 2172 Symmetric Order
来源:互联网 发布:网红晚晚的淘宝店 编辑:程序博客网 时间:2024/04/29 13:06
#include<stdio.h>#include<string.h>int main(){int i,j,flag,n,times,num;char str[15][26];char ch[26];times = 1;while(scanf("%d",&n)&&n){flag = 0;i = 0;j = n - 1;num = n;while(n--){scanf("%s",ch);if(flag == 0){strcpy(str[i],ch);flag = 1;i++;}else{strcpy(str[j],ch);flag = 0;j--;}}printf("SET %d\n",times);for(i = 0;i<num;i++)printf("%s\n",str[i]);times++;}return 0;}
0 0
- zoj 2172 Symmetric Order
- zoj 2172 Symmetric Order
- zoj 2172 Symmetric Order
- ZOJ 2172 Symmetric Order
- ZOJ 2172 Symmetric Order
- zoj 2172 Symmetric Order
- ZOJ 2172 Symmetric Order
- zoj 2172 Symmetric Order水题
- Symmetric Order
- Symmetric Order
- Symmetric Order
- Symmetric Order
- ZOJ2172 Symmetric Order
- poj 2013 Symmetric Order
- poj 2013 Symmetric Order
- poj 2013 Symmetric Order
- POJ2013浅析------Symmetric Order
- Symmetric Order (P2013)
- Add Two Numbers
- 【OC学习-11】ARC和内存管理里面的alloc、assign、new、retain、copy、mutableCopy、release说明
- 数据库查询语句关键字总结
- 开源License对比分析
- 边际成本
- zoj 2172 Symmetric Order
- jdk 1.6新特性
- 截屏+notification的小例子
- Treap原理和实现方法
- ios检查版本更新
- 网页视频播放器-插件
- Android中Preference的使用以及监听事件分析
- Integer比较也是要用.equals
- NYOJ-孪生素数问题