/* User ID: turing_13 Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=431 */ #include <bits/stdc++.h> #define pii pair <int,int> #define sc scanf #define pf printf #define Pi 2*acos(0.0) #define ms(a,b) memset(a, b, sizeof(a)) #define pb(a) push_back(a) #define MP make_pair #define oo 1<<29 #define dd double #define ll long long #define EPS 10E-10 #define ff first #define ss second #define MAX 150 #define SZ(a) (int)a.size() #define getint(a) scanf("%d",&a) #define loop(i,n) for(int i=0;i<n;i++) #define all(a) a.begin(),a.end() #define intlim 2147483648 #define rtintlim 46340 #define llim 9223372036854775808 #define rtllim 3037000499 #define ull unsigned long long #define inf 100000 #define I int using namespace std; int main() { ///freopen("in.txt","r",stdin); ///freopen("out.txt","w",stdout); char ara[MAX][MAX]; loop(i,MAX) loop(j,MAX) ara[i][j]='\0'; char ch; I mx=-1,l,cnt=0; loop(i,MAX) { loop(j,MAX) { ch=getchar(); if(ch=='\n' || ch==-1) break; ara[i][j]=ch; } l=strlen(ara[i]); mx=max(mx,l); } for(cnt=0;cnt<MAX;cnt++) if(ara[cnt][0]==0) break; for(int j=0; j<mx;j++) { for(int i=cnt-1; i>-1; i--) { ch=ara[i][j]; if(ara[i][j] ==0) ch=' '; cout<<ch; } cout<<endl; } return 0; }
Subscribe
Login
0 Comments