ZOJ-3121
2014-01-12 17:27
204 查看
#include<stdio.h> int main() { int n; char s[1000][1000]; while (scanf("%d", &n) != EOF) { int i, j, index = 0, begin = 0; char r[1001]; for (i = 0; i < n; i++) scanf("%s", s[i]); for (j = 0; s[0][j] != '\0'; j++) for (i = 0; i < n; i++) r[index++] = s[i][j]; while (r[begin++] == '_') ; for (i = index - 1; i >= begin - 1; i--) if (r[i] == '_') putchar(' '); else if (r[i] == '\\') putchar('\n'); else putchar(r[i]); putchar('\n'); putchar('\n'); } return 0; }
相关文章推荐
- zoj 3121 Arne Saknussemm
- zoj 3121
- ZOJ 3121 Arne Saknussemm
- ZOJ 3121 Arne Saknussemm
- ZOJ 3121 Arne Saknussemm
- zoj 1720
- ZOJ 1986 Bridging Signals(LIS最长递增子序列)
- zoj 1136(同余+bfs)
- ZOJ - 3490 String Successor 递归模拟
- ZOJ Problem Set - 1314 Uniform Generator(GCD)
- ZOJ 3703,3700,3699
- ZOJ-3088 Easter Holidays
- zoj 3321 Circle【并查集】
- ZOJ题目分类(转)
- ZOJ 3676 排序+二分
- 大三分法ZOJ 3203 Light Bulb
- UVa1606 UVaLive3259 FZU1309 HDU1661 POJ2280 ZOJ2390 Amphiphilic Carbon Molecules
- zoj 1792 Gap Punishment Aligment Problem
- zoj 3642 Just Another Information Sharing Problem
- ZOJ 3210 A Stack or A Queue? (I)