forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathG.cpp
More file actions
37 lines (31 loc) · 1.06 KB
/
G.cpp
File metadata and controls
37 lines (31 loc) · 1.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
int m, n;
char a[511][511];
int main() {
while (cin >> n && n) {
int t = 0;
string s; cin >> s;
int i = 0;
while (t < s.length()) {
++i;
FOR(j,1,n) {
char c = (t < s.length()) ? s[t] : ' ';
++t;
if (i % 2 == 1) a[i][j] = c;
else a[i][n - j + 1] = c;
}
}
int m = i;
FOR(j,1,n) FOR(i,1,m) cout << a[i][j]; cout << "\n";
}
return 0;
}