POJ 2039 TO and Fro(模拟)

#include<iostream> using namespace std; char str[10000]; char map[1000][21]; int main() { int n; while(cin >> n) { if(n == 0) break; cin >> str; int r = strlen(str)/n; int p = 0; for(int i = 1;i <= r;++i) { if(i%2 != 0) { for(int j = 1;j <= n;++j) map[i][j] = str[p++]; } else { for(int j = n;j >= 1;--j) map[i][j] = str[p++]; } } for(int i = 1;i <= n;++i) for(int j = 1;j <= r;++j) cout << map[j][i]; cout << endl; } return 0; }