id
int32
0
32.5k
code
stringlengths
95
8.4k
label
stringclasses
65 values
22,900
//#include<stdlib.h> //#include<math.h> int main() { int n,i,j; char c; int row1,row2,col1,col2; int a[101][101]; scanf("%d %d",&row2,&col2); for(i=0;i<row2;i++){ for(j=0;j<col2;j++){ scanf("%d",&(a[i][j])); } } i=0;j=-1; c='r'; n=row2*col2; row1=0; col1=0; row2=row2-1; col2=col2-1; while(n) { switch(c) { case 'l': j--; if(j==col1) { c='u'; row2--; } break; case 'r': j++; if(j==col2) { c='d'; row1++; } break; case 'u': i--; if(i==row1) { c='r'; col1++; } break; case 'd': i++; if(i==row2) { c='l'; col2--; } } printf("%d\n",a[i][j]); n--; } return 0; }
46
22,901
/* * hui.cpp * * Created on: 2013-11-5 * Author: ?? */ int main(){ int r,c; cin>>r>>c; int a[r][c],b[r+2][c+2],d[r*c]; for(int ii=0;ii<r+2;ii++){ for(int jj=0;jj<c+2;jj++){ b[ii][jj]=1; } } for(int i=0;i<r;i++){ for(int j=0;j<c;j++){ cin>>a[i][j]; b[i+1][j+1]=0; } } int ii=0,jj=0; b[1][1]=1; d[0]=a[0][0]; for(int m=1;m<r*c;m++){ if(jj+1<c&&b[ii+1][jj+1+1]==0&&b[ii-1+1][jj+1]==1&&b[ii+1][jj-1+1]==1) {jj++;d[m]=a[ii][jj];b[ii+1][jj+1]++;} else if(ii+1<r&&b[ii+1+1][jj+1]==0&&b[ii+1][jj+1+1]==1&&b[ii-1+1][jj+1]==1) {ii++;d[m]=a[ii][jj];b[ii+1][jj+1]++;} else if(jj-1>=0&&b[ii+1][jj-1+1]==0&&b[ii+1+1][jj+1]==1&&b[ii+1][jj+1+1]==1) {jj--;d[m]=a[ii][jj];b[ii+1][jj+1]++;} else if(ii-1>=1&&b[ii-1+1][jj+1]==0&&b[ii+1][jj-1+1]==1&&b[ii+1+1][jj+1]==1) {ii--;d[m]=a[ii][jj];b[ii+1][jj+1]++;} } for(int f=0;f<r*c;f++){ cout<<d[f]<<endl; } return 0; }
46
22,902
int main() { int m,n,a[101][101],f[101][101]; const int dx[4]={0,1,0,-1}; const int dy[4]={1,0,-1,0}; cin>>m>>n; for (int i=1; i<=m; i++) for (int j=1; j<=n; j++) cin>>a[i][j]; for (int i=0; i<=m+1; i++) for (int j=0; j<=n+1; j++) f[i][j]=1; for (int i=1; i<=m; i++) for (int j=1; j<=n; j++) f[i][j]=0; int x=1,y=1,p=0; for (int i=1; i<=m*n; i++) { cout<<a[x][y]<<endl; f[x][y]=1; if (f[x+dx[p]][y+dy[p]]==0) {x+=dx[p];y+=dy[p];} else {p++;if (p==4) p=0;x+=dx[p];y+=dy[p];} } return 0; }
46
22,903
void main() { int a[100][100]; int b,c,d,i,j,e; scanf("%d %d",&b,&c); for (i=0;i<b;i++) { for (j=0;j<c;j++) { scanf("%d",&a[i][j]); } } if (b<c) d=b; if(b>=c) d=c; if (d%2==0) { for (e=0;e<d/2;e++) { i=e; for(j=e;j<c-1-e;j++) printf("%d\n",a[i][j]); j=c-1-e; for (i=e;i<b-1-e;i++) printf("%d\n",a[i][j]); i=b-1-e; for(j=c-e-1;j>e;j--) printf("%d\n",a[i][j]); j=e; for(i=b-1-e;i>e;i--) printf("%d\n",a[i][j]); } } if (d%2!=0) { for (e=0;e<d/2;e++) { i=e; for(j=e;j<c-1-e;j++) printf("%d\n",a[i][j]); j=c-1-e; for (i=e;i<b-1-e;i++) printf("%d\n",a[i][j]); i=b-1-e; for(j=c-e-1;j>e;j--) printf("%d\n",a[i][j]); j=e; for(i=b-1-e;i>e;i--) printf("%d\n",a[i][j]); } if (d==b&&d!=c) { j=d/2; for (i=d/2;i<c-d/2;i++) printf("%d\n",a[j][i]); } if (d==c&&d!=b) { j=d/2; for(i=d/2;i<b-d/2;i++) printf("%d\n",a[i][j]); } if (d==c&&d==b) { i=j=d/2; printf("%d",a[i][j]); } } }
46
22,904
int main() { int row,col,i,j,a[100][100],xxrow,sxrow,xxcol,sxcol; scanf("%d%d",&row,&col); for(i=0;i<row;i++){ for(j=0;j<col;j++) scanf("%d",&a[i][j]); } xxrow=0; sxrow=row-1; xxcol=0; sxcol=col-1; for(;1;){ if(xxrow==sxrow&&xxcol<=sxcol){ for(i=xxcol;i<=sxcol;i++) printf("%d\n",a[xxrow][i]); break; } else if(xxcol==sxcol&&xxrow<sxrow){ for(i=xxrow;i<=sxrow;i++) printf("%d\n",a[i][xxcol]); break; } if(xxcol>sxcol||xxrow>sxrow) break; for(i=xxcol;i<=sxcol-1;i++) printf("%d\n",a[xxrow][i]); for(i=xxrow;i<=sxrow-1;i++) printf("%d\n",a[i][sxcol]); for(i=sxcol;i>=xxcol+1;i--) printf("%d\n",a[sxrow][i]); for(i=sxrow;i>=xxrow+1;i--) printf("%d\n",a[i][xxcol]); xxrow++; xxcol++; sxrow--; sxcol--; } return 0; }
46
22,905
int main(int argc, char* argv[]) { int row,col,i,h,num,total; int sz[100][100]; scanf("%d%d",&row,&col); for(i=0;i<row;i++){ for(h=0;h<col;h++){ scanf("%d",&sz[i][h]); } } num=0; h=0; total=row*col; while(1){ for(i=h;i<col-h;i++){ printf("%d\n",sz[h][i]); num++; if(num==total){ return 0; } } for(i=h+1;i<row-h;i++){ printf("%d\n",sz[i][col-1-h]); num++; if(num==total){ return 0; } } for(i=h+1;i<col-h;i++){ printf("%d\n",sz[row-1-h][col-1-i]); num++; if(num==total){ return 0; } } for(i=h+1;i<row-h-1;i++){ printf("%d\n",sz[row-1-i][h]); num++; if(num==total){ return 0; } } h++; } }
46
22,906
void spread(int A[100][100],int M,int N) { int i; int j=0; int t[400]={0}; if(M==1&&N==1) printf("%d\n",A[0][0]); else { if(M==1) for(i=0;i<N;i++) { t[j]=A[0][i]; j=j+1; } else if(N==1) for(i=0;i<M;i++) { t[j]=A[i][0]; j=j+1; } else { for(i=0;i<N-1;i++) { t[j]=A[0][i]; j=j+1; } for(i=0;i<M-1;i++) { t[j]=A[i][N-1]; j=j+1; } for(i=N-1;i>0;i--) { t[j]=A[M-1][i]; j=j+1; } for(i=M-1;i>0;i--) { t[j]=A[i][0]; j=j+1; } } for(i=0;i<j;i++) printf("%d\n",t[i]); } } void main() { int i,j,s; int r,c; int k; int a[100][100]; scanf("%d%d",&r,&c); k=r<c?r:c; for(i=0;i<r;i++) for(j=0;j<c;j++) scanf("%d",&a[i][j]); for(i=1;((r>0)&&(c>0));i++) { spread(a,r,c); r=r-2; c=c-2; for(s=0;s<r;s++) for(j=0;j<c;j++) a[s][j]=a[s+1][j+1]; } }
46
22,907
// homework : ???????? // name : ??? int main() { int array[100][100]; int row, col; cin >> row >> col; for( int i = 0; i < row; i++ ) { for( int j = 0; j < col; j++ ) { cin >> array[i][j]; } } for( int row1 = 0, row2 = row - 1,col1 = 0, col2 = col - 1; col1 <= col2 && row1 <= row2; row1++, row2--, col1++, col2-- ) { if( col1 == col2 && row1 == row2 ) { cout << array[row1][col1] << endl; break; } if( row1 == row2 ) { for( int i =col1; i <= col2; i++ ) cout << array[row1][i] << endl; break; } if( col1 == col2 ) { for( int i = row1; i <= row2; i++ ) cout << array[i][col1] << endl; break; } for( int i = col1; i < col2; i++ ) cout << array[row1][i] << endl; for( int i = row1; i < row2; i++ ) cout << array[i][col2] << endl; for( int i = col2; i > col1; i-- ) cout << array[row2][i] << endl; for( int i = row2; i > row1; i-- ) cout << array[i][col1] << endl; } return 0; }
46
22,908
int main() { int m1[100][100],i,j,k,a,b,c=0,d,e,x=-1; scanf("%d %d\n",&a,&b); e=a;d=b; for(i=0;i<a;i++) { for(j=0;j<b-1;j++){ scanf("%d",&m1[i][j]);} scanf("%d\n",&m1[i][b-1]); } for(k=1;k<100000;k++){ x=x+1; for(j=x;j<b-x;j++) { printf("%d\n",m1[x][j]); c+=1; } if(c==d*e)break; for(i=x+1;i<a-x;i++) { printf("%d\n",m1[i][b-x-1]); c+=1; } if(c==d*e)break; for(j=2+x;j<b+1-x;j++) { printf("%d\n",m1[a-1-x][b-j]); c+=1; } if(c==d*e)break; for(i=2+x;i<a-x;i++) { printf("%d\n",m1[a-i][x]); c+=1; } if(c==e*d)break; } return 0; }
46
22,909
int main() { int m,n,i,j,A,B,C,D; int a[100][100]; scanf("%d %d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } A=n-1; B=m-1; C=0; D=1; int sum,k=0; sum=m*n; i=0; j=0; if(m==1&&n==1) { printf("%d",a[0][0]); } else { if(m==1&&n!=1) { for(i=0;i<n-1;i++) { printf("%d\n",a[0][i]); } printf("%d",a[0][i]); } else { if(n==1&&m!=1) { for(i=0;i<m-1;i++) { printf("%d\n",a[i][0]); } printf("%d",a[i][0]); } else { while(k<sum) { for(j=C;j<=A;j++) { if(k!=sum-1) { printf("%d\n",a[i][j]); k++; } else { printf("%d",a[i][j]); goto end; } } j--; A--; for(i=D;i<=B;i++) { if(k!=sum-1) { printf("%d\n",a[i][j]); k++; } else { printf("%d",a[i][j]); goto end; } } i--; B--; for(j=A;j>=C;j--) { if(k!=sum-1) { printf("%d\n",a[i][j]); k++; } else { printf("%d",a[i][j]); goto end; } } j++; C++; for(i=B;i>=D;i--) { if(k!=sum-1) { printf("%d\n",a[i][j]); k++; } else { printf("%d",a[i][j]); goto end; } } i++; D++; } } } } end: return 0; }
46
22,910
void main() { int num=0,firh=0,lash,firl=0,lasl,i,j,row,col,a[105][105]; scanf("%d %d",&row,&col); for(i=0;i<row;i++) for(j=0;j<col;j++) scanf("%d",&a[i][j]); lash=row-1;lasl=col-1; while(num<=(row*col)) { for(i=firl;i<=lasl;i++) {printf("%d\n",a[firh][i]);num++;} if(num==row*col) break; firh++; for(i=firh;i<=lash;i++) {printf("%d\n",a[i][lasl]);num++;} if(num==row*col) break; lasl--; for(i=lasl;i>=firl;i--) {printf("%d\n",a[lash][i]);num++;} if(num==row*col) break; lash--; for(i=lash;i>=firh;i--) {printf("%d\n",a[i][firl]);num++;} if(num==row*col) break; firl++; } }
46
22,911
void main() { int a[100][100]; int row,col,i,j; scanf("%d %d",&row,&col); for(i=0;i<row;i++) for(j=0;j<col;j++) scanf("%d",&a[i][j]); int s_row=0,s_col=0,e_row=row-1,e_col=col-1; while(1) { if (s_row>e_row) break; for (i=s_col;i<=e_col;i++) printf("%d\n",a[s_row][i]); s_row++; if (s_col>e_col) break; for (i=s_row;i<=e_row;i++) printf("%d\n",a[i][e_col]); e_col--; if (s_row>e_row) break; for (i=e_col;i>=s_col;i--) printf("%d\n",a[e_row][i]); e_row--; if (s_col>e_col) break; for (i=e_row;i>=s_row;i--) printf("%d\n",a[i][s_col]); s_col++; } }
46
22,912
int main(int argc, char* argv[]) { int a[101][101],i,j,p,n=0,row,col; scanf("%d %d",&row,&col); for(i=1;i<=row;i++){ for(j=1;j<=col;j++){ scanf("%d",&a[i][j]); } } for(p=1;p<=50;p++){ for(i=p;i<=col+1-p;i++){ printf("%d\n",a[p][i]); n++; } if(n==row*col){ break; } for(i=p+1;i<=row+1-p;i++){ printf("%d\n",a[i][col+1-p]); n++; } if(n==row*col){ break; } for(i=col-p;i>=p;i--){ printf("%d\n",a[row+1-p][i]); n++; } if(n==row*col){ break; } for(i=row-p;i>=p+1;i--){ printf("%d\n",a[i][p]); n++; } if(n==row*col){ break; } } return 0; }
46
22,913
int main() { int a[101][101],b[101][101]={0}; int c[4]={-1,0,1,0},d[4]={0,1,0,-1}; int m,n,i,j,x,y,t; scanf("%d%d",&m,&n); for (i=1;i<=m;i++) for (j=1;j<=n;j++) { scanf("%d",&a[i][j]); b[i][j]=1; } x=y=t=1; for (i=1;i<=m*n;i++) { printf("%d\n",a[x][y]); b[x][y]=0; if (!b[x+c[t]][y+d[t]]) t=(t+1)%4; x+=c[t]; y+=d[t]; } return 0; }
46
22,914
int main() { int array[100][100], i, j, row, col, num, s, k; scanf("%d %d",&row,&col); if(row>0 && row<100 && col>0 && col<100) { for(i=0; i<row; i++) { for(j=0; j<col; j++) scanf("%d",&array[i][j]); } for(i=0, j=0, num=0; num<row*col; i++, j++) //????row*col??????? { for(s=j; s<=(col-j-1); s++) { printf("%d\n",array[i][s]);//???i???? num++; if(num>=row*col) break; } if(num>=row*col) break; for(k=i+1; k<(row-i-1); k++) { printf("%d\n",array[k][col-j-1]); num++; if(num>=row*col) break; } if(num>=row*col) break; for(s=col-j-1; s>j; s--) { printf("%d\n",array[row-i-1][s]); num++; if(num>=row*col) break; } if(num>=row*col) break; for(k=row-i-1; k>i; k--) { printf("%d\n",array[k][j]);//?????? num++; if(num>=row*col) break; } if(num>=row*col) break; } } return 0; }
46
22,915
int main(){ int row , col ; int a[100][100]; int i,j; int flag=1; cin >> row >> col ; int topBorder=0,bottomBorder=row-1; int leftBorder=0,rightBorder=col-1; int x=0,y=0; for(i=0;i<row;i++){ for(j=0;j<col;j++){ cin>>a[i][j]; } } for(i=0;i<row*col;i++){ cout<<a[y][x]<<endl; if(flag==1){ if(x+1>rightBorder){ flag=2; y++; topBorder++; } else{ x++; } } else if(flag==2){ if(y+1>bottomBorder){ flag=3; x--; rightBorder--; } else{ y++; } } else if(flag==3){ if(x-1<leftBorder) { flag=4; y--; bottomBorder--; } else{ x--; } } else{ if(y-1<topBorder){ flag=1; x++; leftBorder++; } else{ y--; } } } return 0; }
46
22,916
int main() { int a[100][100]; int row,col,i,j,h; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&(a[i][j])); } } i=0; j=-1; for(h=0;;h++) { for(j++;j<col-h;j++) { printf("%d\n",a[i][j]); } j--; if(i>=row-h-1) break; for(i++;i<row-h;i++) { printf("%d\n",a[i][j]); } i--; if(j<h+1) break; for(j--;j>=h;j--) { printf("%d\n",a[i][j]); } j++; if(i<h+2) break; for(i--;i>=h+1;i--) { printf("%d\n",a[i][j]); } i++; if(j>=col-h-1) break; } return 0; }
46
22,917
int main() { int sz[N][N]; int row,col; scanf("%d%d",&row,&col); int i,j; for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&sz[i][j]); } } int sx=0,xx=row-1,zx=0,yx=col-1; while((sx<xx)&&(zx<yx)) { for(j=zx;j<yx;j++) { printf("%d\n",sz[sx][j]); } for(j=sx;j<xx;j++) { printf("%d\n",sz[j][yx]); } for(j=yx;j>zx;j--) { printf("%d\n",sz[xx][j]); } for(j=xx;j>sx;j--) { printf("%d\n",sz[j][zx]); } sx++;;xx--;zx++;yx--; } if((sx==xx)&&(zx==yx)) { printf("%d\n",sz[sx][zx]); } if((sx==xx)&&(zx<yx)) { for(i=zx;i<=yx;i++) { printf("%d\n",sz[sx][i]); } } if((sx<xx)&&(zx==yx)) { for(i=sx;i<=xx;i++) { printf("%d\n",sz[i][zx]); } } return 0; }
46
22,918
const int dx[4] = {0, 1, 0, -1}; const int dy[4] = {1, 0, -1, 0}; int n, m, a[110][110], v[110][110]; int main() { cin >> n >> m; for (int i = 0; i < n; ++ i) for (int j = 0; j < m; ++ j) cin >> a[i][j]; int x = 0, y = 0, cnt = 0, now = 0; while (cnt < n * m) { ++ cnt; v[x][y] = 1; cout << a[x][y] << endl; if (x + dx[now] < 0 || x + dx[now] >= n || y + dy[now] < 0 || y + dy[now] >= m) now = (now + 1) % 4; else if (v[x+dx[now]][y+dy[now]] == 1) now = (now + 1) % 4; x += dx[now]; y += dy[now]; } return 0; }
46
22,919
int A[100][100]={0}; void shuchu1(int a,int b,int c,int d)//a<b&&c<d { for(int i=c;i<=d;i++) { cout<<A[a][i]<<endl; } for(int i=a+1;i<=b;i++) { cout<<A[i][d]<<endl; } for(int i=d-1;i>=c;i--) { cout<<A[b][i]<<endl; } for(int i=b-1;i>=a+1;i--) { cout<<A[i][c]<<endl; } } void shuchu2(int a,int b,int c,int d)//a==b&&c<d { for(int i=c;i<=d;i++) { cout<<A[a][i]<<endl; } } void shuchu3(int a,int b,int c,int d)//c==d&&a<b { for(int i=c;i<=d;i++) { cout<<A[a][i]<<endl; } for(int i=a+1;i<=b;i++) { cout<<A[i][d]<<endl; } } void shuchu4(int a,int b,int c,int d)//a==b&&c==d { cout<<A[a][c]<<endl; } int main() { int row,col; cin>>row>>col; for(int i=0;i<row;i++)//????????? { for(int j=0;j<col;j++) { cin>>A[i][j]; } } int a=0; int c=0; int b=row-1; int d=col-1; while(b>=a&&d>=c) { if(a<b&&c<d) { shuchu1(a,b,c,d); } if(a==b&&c<d) { shuchu2(a,b,c,d); } if(c==d&&a<b) { shuchu3(a,b,c,d); } if(a==b&&c==d) { shuchu4(a,b,c,d); } a++;b--;c++;d--; } return 0;//???? }
46
22,920
int main() { int an[100][100]; int i,j,m,n,k,s; scanf("%d%d",&n,&m); for(j=0;j<n;j++) { for(i=0;i<m;i++) scanf("%d",&an[i][j]); } s=0; for(k=0;k<m/2&&k<n/2;k++) { for(i=k;i<m-k-1;i++) printf("%d\n",an[i][k]); for(j=k;j<n-k-1;j++) printf("%d\n",an[m-k-1][j]); for(i=m-k-1;i>k;i--) printf("%d\n",an[i][n-k-1]); for(j=n-k-1;j>k;j--) printf("%d\n",an[k][j]); s=s+2*(m+n-4*k-2); } if(s!=m*n) { if(m<n) { for(j=k;j<n-k;j++) printf("%d\n",an[k][j]);} if(m>n) { for(i=k;i<m-k;i++) printf("%d\n",an[i][k]);} if(m==n) printf("%d\n",an[k][k]); } return 0; }
46
22,921
int main() { int a[100][100]={0}; int row=0,col=-1,i,j,m,n,t=1,p=0; cin>>m>>n; int k=m*n; for(i=0;i<m;i++) for(j=0;j<n;j++) cin>>a[i][j]; do { for(i=0;i<n;i++) { col+=t; cout << a[row][col] << endl; p++; } n--; m--; for(i=0;i<m;i++) { row+=t; cout << a[row][col]<<endl; p++; } t=-t; }while (p<k); return 0; }
46
22,922
int main(int argc, char *argv[]) { int x[100][100],i,j,k,n,col,row; scanf("%d""%d",&row,&col); for (i=0;i<row;i++) { for (j=0;j<col;j++) { scanf("%d",&x[i][j]); } } if (col>row) n=row; else if (col<row) n=col; else if (col==row) n=row; n=n/2-1; for (k=0;k<=n;k++) { //the 1st we will try to output the num in row=0 for (i=k,j=k;j<col-1-k;j++)//x[0][0]~x[0][col-2] { printf("%d\n",x[i][j]); } //the 2nd output the num in col=col-1 for (i=k,j=col-1-k;i<row-1-k;i++)//x[0][col-1]~x[row-2][col-1] { printf("%d\n",x[i][j]); } //the 3rd output the num in row=row-1 for (i=row-1-k,j=col-1-k;j>k;j--)//x[row-1][col-1]~x[row-1][1] { printf("%d\n",x[i][j]); } //the 4th outoput the num in col=0 for (i=row-1-k,j=k;i>k;i--)//x[row-1][0]~x[1][0] { printf("%d\n",x[i][j]); } } if (col>row&&row%2==1) { k=row/2; for (i=k,j=k;j<=col-1-k;j++) { printf("%d\n",x[i][j]); } } else if (col<row&&col%2==1) { k=col/2; for (i=k,j=k;i<=row-1-k;i++) { printf("%d\n",x[i][j]); } } else if (col==row&&col%2==1&&row%2==1) { k=col/2; printf("%d\n",x[k][k]); } else k=k; return 0; }
46
22,923
int main() { int a[100][100],i,k,t,m,n; scanf("%d%d",&m,&n); for(i=0;i<m;i++) { for(k=0;k<n;k++) { scanf("%d",&a[i][k]); } } for(t=0;t<(m+1)/2&&t<(n+1)/2;t++) { for(i=t,k=t;k<n-t;k++) { printf("%d\n",a[i][k]); } if(t!=m-t-1) { for(k=n-t-1,i=t+1;i<m-t;i++) { printf("%d\n",a[i][k]); } if(t!=n-t-1) { for(i=m-t-1,k=n-t-2;k>=t;k--) { printf("%d\n",a[i][k]); } for(k=t,i=m-t-2;i>t;i--) { printf("%d\n",a[i][k]); } } } } return 0; }
46
22,924
/* title:???????? * * author:???* * time:2011.10.28*/ int main() { int array[100][100]; int row, col, i, j, k, h, m = 0, r1, r2, n = 0; cin >> row >> col; r1 = row; r2 = col; for(i = 0; i < row; i++) for(j = 0; j < col; j++) { cin >> array[i][j]; } for(m = 0; m <= r2 / 2 && m <= r1 / 2; m++) { for(j = m; j < col; j++) { n++; if(n > r1 * r2) break; cout << array[m][j] << endl; } for(i = m + 1; i < row; i++) { n++; if(n > r1 * r2) break; cout << array[i][col - 1] << endl; } for(k = col - 2; k >= m; k--) { n++; if(n > r1 * r2) break; cout << array[row - 1][k] << endl; } for(h = row - 2; h > m; h--) { n++; if(n > r1 * r2) break; cout << array[h][m] << endl; } row = row - 1; col = col - 1; } return 0; }
46
22,925
int main(){ int row,col,i,j,g,k,p,num,time=0; int sz[110][110]; scanf("%d%d",&row,&col); num=row*col; for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&sz[i][j]); }} for(i=0;;i++){ for(j=i;j<col-i;j++){ printf("%d\n",sz[i][j]);time++;} if(time==num){break;} for(g=1+i;g<row-i;g++){ printf("%d\n",sz[g][col-1-i]);time++;} if(time==num){break;} for(k=col-2-i;k>=i;k--){ printf("%d\n",sz[row-1-i][k]);time++;} if(time==num){break;} for(p=row-2-i;p>i;p--){ printf("%d\n",sz[p][i]);time++;} if(time==num){break;} } }
46
22,926
int main() { int i,j,m,n,a[101][101],k=0; scanf("%d%d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf("%d",&a[i][j]); } for(i=0;k!=m*n;i++) { for(j=i;j<n-i;j++) { printf("%d\n",a[i][j]); k++; if(k==m*n) break; } if(k==m*n) break; for(j=i+1;j<m-i;j++) { printf("%d\n",a[j][n-1-i]); k++; if(k==m*n) break; } if(k==m*n) break; for(j=n-i-2;j>=i;j--) { printf("%d\n",a[m-1-i][j]); k++; if(k==m*n) break; } if(k==m*n) break; for(j=m-i-2;j>i;j--) { printf("%d\n",a[j][i]); k++; if(k==m*n) break; } if(k==m*n) break; } return 0; }
46
22,927
int main(){ int m,n,ab[100][100],i,s,k=0; scanf("%d %d",&m,&n); for(i=0;i<m;i++){ for(s=0;s<n;s++){ scanf("%d",&ab[i][s]); } } for(i=0;k<m*n;i++){ for(s=i;s<n-i&&k<m*n;s++){ printf("%d\n",ab[0+i][s]); k++; } for(s=1+i;s<m-i&&k<m*n;s++){ printf("%d\n",ab[s][n-1-i]); k++; } for(s=n-2-i;s>=0+i&&k<m*n;s=s-1){ printf("%d\n",ab[m-1-i][s]); k++; } for(s=m-2-i;s>=i+1&&k<m*n;s=s-1){ printf("%d\n",ab[s][i]); k++; } } return 0; }
46
22,928
int main() { int a[100][100],b[10000],i,j,r,c,k=0,row,col,p; scanf("%d%d",&row,&col); for(i=0;i<row;i++) for(j=0;j<col;j++) scanf("%d",&a[i][j]); r=row; c=col; if(r>=c){ for(c=col;c>col/2;c--) { p=0; for(j=col-c;j<c;j++) { b[k]=a[row-r][j]; k++; p++; } if(p==0) break; else p=0; for(j=row-r+1;j<r;j++) { b[k]=a[j][c-1]; k++; p++; } if(p==0) break; else p=0; for(j=c-2;j>=col-c;j--) { b[k]=a[r-1][j]; k++; p++; } if(p==0) break; else p=0; for(j=r-2;j>row-r;j--) { b[k]=a[j][col-c]; k++; p++; } if(p==0) break; else p=0; r--; } } if(r<c){ for(r=row;r>row/2;r--) { p=0; for(j=col-c;j<c;j++) { b[k]=a[row-r][j]; k++; p++; } if(p==0) break; else p=0; for(j=row-r+1;j<r;j++) { b[k]=a[j][c-1]; k++; p++; } if(p==0) break; else p=0; for(j=c-2;j>=col-c;j--) { b[k]=a[r-1][j]; k++; p++; } if(p==0) break; else p=0; for(j=r-2;j>row-r;j--) { b[k]=a[j][col-c]; k++; p++; } if(p==0) break; else p=0; c--; } } printf("%d",b[0]); for(i=1;i<k;i++) printf("\n%d",b[i]); return 0; }
46
22,929
void main() { int m,n,m1,m2,n1,n2; int i,j,a[100][100]; scanf("%d%d",&m,&n); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",&a[i][j]); m1=m-1; n1=n-1; m2=0; n2=0; while(m1>m2&&n1>n2) { for(i=m2,j=n2;j<n1;j++) printf("%d\n",a[i][j]); for(i=m2,j=n1;i<m1;i++) printf("%d\n",a[i][j]); for(i=m1,j=n1;j>n2;j--) printf("%d\n",a[i][j]); for(i=m1,j=n2;i>m2;i--) printf("%d\n",a[i][j]); m1--; n1--; m2++; n2++; } if(m1==m2&&n1==n2) printf("%d\n",a[m1][n1]); else if(m1==m2) for(j=n2;j<=n1;j++) printf("%d\n",a[m1][j]); else for(i=m2;i<=m1;i++) printf("%d\n",a[i][n1]); }
46
22,930
int main(){ int sz[100][100],m,n,i,j,k,time; time=0; scanf("%d%d",&m,&n); for(i=0;i<m;i++){ for(j=0;j<n;j++){ scanf("%d",&sz[i][j]); } } for(k=0;k<=1000000;k++){if(time==n*m){break;} for(i=k;i<n-k;i++){ if(time==n*m){break;} printf("%d\n",sz[k][i]);time++; } for(i=1+k;i<m-k;i++){ if(time==n*m){break;} printf("%d\n",sz[i][n-1-k]);time++; } for(i=n-2-k;i>=k;i--){ if(time==n*m){break;} printf("%d\n",sz[m-1-k][i]);time++; } for(i=m-2-k;i>=1+k;i--){ if(time==n*m){break;} printf("%d\n",sz[i][k]);time++; } } return 0;}
46
22,931
int main() { int row; int col; int i,j,k; int t=0; int a[200][200]; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&a[i][j]); } } for(i=0;i<row;i++) { for(j=i;j<col-i;j++) { t++; if(t==row*col){ printf("%d",a[i][j]); return 0;} else {printf("%d\n",a[i][j]);} } j=col-i-1; for(k=i+1;k<row-i;k++) { t++; if(t==row*col){ printf("%d",a[k][j]); return 0;} else {printf("%d\n",a[k][j]);} } k=row-i-1; for(j=col-i-2;j>=i;j--) { t++; if(t==row*col){ printf("%d",a[k][j]); return 0;} else {printf("%d\n",a[k][j]);} } j=i; for(k=row-i-2;k>i;k--) { t++; if(t==row*col){ printf("%d",a[k][j]); return 0;} else {printf("%d\n",a[k][j]);} } } return 0; }
46
22,932
int main() { int row, col, i, k, j, s = 0; int a[100][100] = { 0 }; cin >> row >> col; for (i = 0; i < row; i++) { for (j = 0; j < col; j++) cin >> a[i][j]; } for (i = 0; i < row / 2 + 1 && i < col / 2 + 1; i++) {//????-1 for (k = i; k < col - i; k++) {//???i????? cout << a[i][k] <<endl; s++; } if (s == row * col)//?????? break; for (k = i + 1; k < row - i; k++) {//???i????? cout << a[k][col - i - 1] << endl; s++; } if (s == row * col) break; for (k = col - i - 2; k >= i; k--) {//???i????? cout << a[row - i - 1][k] << endl; s++; } if (s == row * col) break; for (k = row - i - 2; k > i; k--) {//???i???? cout << a[k][i] << endl; s++; } if (s == row * col) break; } return 0; }
46
22,933
int times(int x,int y) { int z; z=(x<y)?x:y; if(z%2) return (z+1)/2; else return z/2; } void spinout(int b[100][100],int x,int y) { int i,j,k[100][100]={0}; for(i=0;i<times(x,y);i++) { for(j=0;j<y;j++) { if(k[i][j]==0) { printf("%d\n",b[i][j]); k[i][j]=1; } } for(j=0;j<x;j++) { if(k[j][y-1-i]==0) { printf("%d\n",b[j][y-1-i]); k[j][y-1-i]=1; } } for(j=y-1;j>=0;j--) { if(k[x-1-i][j]==0) { printf("%d\n",b[x-1-i][j]); k[x-1-i][j]=1; } } for(j=x-1;j>=0;j--) { if(k[j][i]==0) { printf("%d\n",b[j][i]); k[j][i]=1; } } } } void main() { int row,col,i,j,a[100][100]; scanf("%d %d",&row,&col); for(i=0;i<row;i++) for(j=0;j<col;j++) scanf("%d",*(a+i)+j); spinout(a,row,col); }
46
22,934
void print(int a[100][100],int row,int col,int b,int c) { int i; for(i=c;i<=col;i++) printf("%d\n",a[b][i]); for(i=b+1;i<=row;i++) printf("%d\n",a[i][col]); if(row>b) for(i=col-1;i>=c;i--) printf("%d\n",a[row][i]); if(col>c) for(i=row-1;i>=b+1;i--) printf("%d\n",a[i][c]); row--; col--; b++; c++; if(row-b>=0&&col-c>=0) print(a,row,col,b,c); } void main() { int col,row,i,j,a[100][100]; scanf("%d %d",&row,&col); for(i=0;i<row;i++) for(j=0;j<col;j++) scanf("%d",&a[i][j]); print(a,row-1,col-1,0,0); }
46
22,935
int main() { int ROW,COL,b[100][100],row,col; scanf("%d",&ROW); scanf("%d",&COL); for(row=0;row<ROW;row++) { for(col=0;col<COL;col++) { scanf("%d",&(b[row][col])); } } row=0; col=0; int i=0,k=0; while(i<ROW&&k<COL) { for(col=k;col<COL-k;col++) { if(b[row][col]!=0) { printf("%d\n",b[row][col]); b[row][col]=0; } else { return 0; } } col--; for(row=1+i;row<ROW-i;row++) { if(b[row][col]!=0) { printf("%d\n",b[row][col]); b[row][col]=0; } else { return 0; } } row--; for(col=col-1;col>=k;col--) { if(b[row][col]!=0) { printf("%d\n",b[row][col]); b[row][col]=0; } else { return 0; } } col++; i++; for(row=row-1;row>=i;row--) { if(b[row][col]!=0) { printf("%d\n",b[row][col]); b[row][col]=0; } else { return 0; } } row++; k++; } return 0; }
46
22,936
const int x[5]={0,0,1,0,-1}; const int y[5]={0,1,0,-1,0}; int f[1000][1000]; int main(){ int m,n,k=1; scanf("%d %d",&m,&n); for (int i=1; i<=m; i++){ for (int j=1; j<=n; j++){ scanf("%d",&f[i][j]); } } int dx=1,dy=1; int dm=m,dn=n,cm=1,cn=1; int count=0; while (count<(m*n)){ printf("%d\n",f[dx][dy]); count++; int tx=dx+x[k]; int ty=dy+y[k]; if ((tx>dm) || (tx<cm) || (ty>dn) || (ty<cn)){ if (k==1) cm++; else if (k==2) dn--; else if (k==3) dm--; else if (k==4) cn++; k=(k % 4)+1; tx=dx+x[k]; ty=dy+y[k]; } dx=tx; dy=ty; } //while(1); return 0; }
46
22,937
int main() { int row,col,array[100][100],sum=0; int i,j; scanf("%d%d",&row,&col); for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&array[i][j]); } } for(i=0;i<row;i++){ for(j=i;j<=col-i-1;j++){ printf("%d\n",array[i][j]); sum++; } if(sum==row*col) break; for(j=i+1;j<=row-i-1;j++){ printf("%d\n",array[j][col-i-1]); sum++; } if(sum==row*col) break; for(j=col-i-1-1;j>=i;j--){ printf("%d\n",array[row-i-1][j]); sum++; } if(sum==row*col) break; for(j=row-i-1-1;j>=i+1;j--){ printf("%d\n",array[j][i]); sum++; } if(sum==row*col) break; } return 0; }
46
22,938
/************************* ***??:??? 1200012776 ***????:???????? ***??:2012?10?30? *************************/ int main() { int row, col, sub_rowS, sub_rowE, sub_colS, sub_colE, times = 0, i, j, k, matrix[100][100]; cin >> row >> col; //?????? for (i = 0; i < row; i++) { for(j = 0; j < col; j++) { cin >> matrix[i][j]; } } for (sub_rowS = 0, sub_rowE = row - 1, sub_colS = 0, sub_colE = col -1; ; sub_rowS++, sub_rowE--, sub_colS++, sub_colE--) //??????????? { for (i = sub_colS; i <= sub_colE; i++) { cout << matrix[sub_rowS][i] << endl; //???????? times++; } for (i = sub_rowS + 1; i <= sub_rowE; i++) { cout << matrix[i][sub_colE] << endl; //??????sub_colE??sub_rowE-1? times++; } if (times == row * col) //????????,?? break; for (i = sub_colE - 1; i >= sub_colS; i--) { cout << matrix[sub_rowE][i] << endl; //??????sub_rowE??sub_colE-1? times++; } for (i = sub_rowE - 1; i > sub_rowS; i--) { cout << matrix[i][sub_colS] << endl; //??????????sub_rowE-2? times++; } if (times == row * col) //????????,?? break; } return 0; }
46
22,939
int main() { int ROW,COL; int array[100][100]; scanf("%d%d",&ROW,&COL); for(int row=0;row<ROW;row++) { for(int col=0;col<COL;col++) { scanf("%d",&array[row][col]); } } //???? int sx_row=0,xx_row=ROW-1,sx_col=0,xx_col=COL-1; while((xx_row>sx_row)&&(xx_col>sx_col)) { for(int i1=sx_row,j1=sx_col;j1<xx_col;j1++) { printf("%d\n",array[i1][j1]); } for(int j2=xx_col,i2=sx_row;i2<xx_row;i2++) { printf("%d\n",array[i2][j2]); } for(int i3=xx_row,j3=xx_col;j3>sx_col;j3--) { printf("%d\n",array[i3][j3]); } for(int i4=xx_row,j4=sx_col;i4>sx_row;i4--) { printf("%d\n",array[i4][j4]); } sx_row++; sx_col++; xx_row--; xx_col--; } if((sx_row==xx_row)&&(sx_col!=xx_col)) { for(int i=sx_col;i<=xx_col;i++) { printf("%d\n",array[sx_row][i]); } } else if(sx_col==xx_col) { for(int j=sx_row;j<=xx_row;j++) { printf("%d\n",array[j][sx_col]); } } return 0; }
46
22,940
int main(){ int row,col,i,k,j,m,n; scanf("%d%d",&row,&col); '\n'; int sz[100][100],a[10000]; for(i=0;i<row;i++){ for(k=0;k<col;k++){ scanf("%d",&sz[i][k]); } '\n'; } j=0; for(i=0;i<col-1;i=i+2){ m=i/2; for(k=m;k<col-m-1;k++){ a[j]=sz[m][k]; j++; } for(k=m;k<row-m-1;k++){ a[j]=sz[k][col-m-1]; j++; } for(k=col-m-1;k>m;k--){ a[j]=sz[row-m-1][k]; j++; } for(k=row-m-1;k>m;k--){ a[j]=sz[k][m]; j++; } } if(col%2==1){ m=i/2; for(k=m;k<row-m;k++){ a[j]=sz[k][(col-1)/2]; j++; } } for(i=0;i<row*col-1;i++){ printf("%d\n",a[i]); } printf("%d",a[row*col-1]); return 0; }
46
22,941
int main() { int array[100][100]; int x,y,i,k,n; i=0; k=0; scanf("%d%d",&x,&y); for(k=0;k<=x-1;k++){ for(i=0;i<=y-1;i++){ scanf("%d",&(array[k][i])); } } if(x>=y){ n=(y-1)/2; }else{ n=(x-1)/2; } for(i=0;i<=n;i++){ for(k=i;k<=y-i-1;k++){ printf("%d\n",array[i][k]); } for(k=i+1;k<=x-i-1;k++){ printf("%d\n",array[k][y-i-1]); } if(n>0&&i<=(x-2)/2){ for(k=y-i-2;k>=i;k--){ printf("%d\n",array[x-i-1][k]); } }else{ break; } if(n>0&&i<=(y-2)/2){ for(k=x-i-2;k>=i+1;k--){ printf("%d\n",array[k][i]); } }else{ break; } } return 0; }
46
22,942
int main() { int a[100][100] = {0}, row, col, i, j, b[100][100] = {0}, num = 0; cin >> row >> col; for (i = 0; i <= row - 1; i++) { for (j = 0; j <= col - 1; j++) cin >> a[i][j]; } i = 0; j = 0; while (1) { while (j != col && b[i][j] == 0) { cout << a[i][j] << endl; b[i][j] = 1; num++; j++; } j--; i++; while (i != row && b[i][j] == 0) { cout << a[i][j] << endl; b[i][j] = 1; num++; i++; } i--; j--; while (j != -1 && b[i][j] == 0) { cout << a[i][j] << endl; b[i][j] = 1; num++; j--; } j++; i--; while (i != -1 && b[i][j] == 0) { cout << a[i][j] << endl; b[i][j] = 1; num++; i--; } i++; j++; if (num == row * col) break; } return 0; }
46
22,943
int main( ) { int m,n,t; cin>>m>>n; int a[m][n]; for(int i=0;i<m;i++) for(int j=0;j<n;j++) cin>>a[i][j]; if(m<=n) t=m; else t=n; for(int i=0;i<t/2;i++) { for(int j=i;j<n-i;j++) { cout<<a[i][j]<<endl; } for(int j=i+1;j<m-i;j++) { cout<<a[j][n-i-1]<<endl; } for(int j=i+1;j<n-i;j++) { cout<<a[m-1-i][n-1-j]<<endl; } for(int j=i+1;j<m-i-1;j++) { cout<<a[m-1-j][i]<<endl; } } if(m<=n&&m%2==1) { for(int j=(m-1)/2;j<n-(m-1)/2;j++) cout<<a[(m-1)/2][j]<<endl; } if(m>n&&n%2==1) for(int j=(n-1)/2;j<m-(n-1)/2;j++) cout<<a[j][(n-1)/2]<<endl; return 0; }
46
22,944
int main() { int array[100][100],i,j,k,n,col,row; scanf("%d""%d",&row,&col); for (i=0;i<row;i++) { for (j=0;j<col;j++) { scanf("%d",&array[i][j]); } } if (col>row) n=row; else if (col<row) n=col; else if (col==row) n=row; n=n/2-1; for (k=0;k<=n;k++) { for (i=k,j=k;j<col-1-k;j++) { printf("%d\n",array[i][j]); } for (i=k,j=col-1-k;i<row-1-k;i++) { printf("%d\n",array[i][j]); } for (i=row-1-k,j=col-1-k;j>k;j--) { printf("%d\n",array[i][j]); } for (i=row-1-k,j=k;i>k;i--) { printf("%d\n",array[i][j]); } } if (col>row&&row%2==1) { k=row/2; for (i=k,j=k;j<=col-1-k;j++) { printf("%d\n",array[i][j]); } } else if (col<row&&col%2==1) { k=col/2; for (i=k,j=k;i<=row-1-k;i++) { printf("%d\n",array[i][j]); } } else if (col==row&&col%2==1&&row%2==1) { k=col/2; printf("%d\n",array[k][k]); } else k=k; return 0; }
46
22,945
int main(){ int a,b,n=0,q,i,k,m,o; int sz[100][100]; scanf("%d",&a); scanf("%d",&b); o=0; int x=0; m=a*b; for(i=0;i<a;i++) { for(k=0;k<b;k++) { scanf("%d",&sz[i][k]); } } if(a%2!=0) { q=a+1; } while(1) { if(b-2*n>0) { for(k=n;k<b-n;k++) { printf("%d\n",sz[n][k]); } } if(b-2*n<=0) { break; } n++; if(a-2*n>=0) { for(k=n;k<=a-n;k++) { printf("%d\n",sz[k][b-n]); } } if(a-2*n<0) { break; } if(b-2*n>=0) { for(k=b-n-1;k>=n-1;k--) { printf("%d\n",sz[a-n][k]); } } if(b-2*n<0) { break; } if(a-1-2*n>=0) { for(k=a-n-1;k>n-1;k--) { printf("%d\n",sz[k][n-1]); } } if(a-2*n-1<0) { break; } } return 0; }
46
22,946
struct node { int over; int data; }; void main() { int row,col,i,j,point=1,heng=0,zong=0; struct node x[102][102]; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&x[i][j].data); x[i][j].over=1; } } printf("%d\n",x[0][0].data); x[0][0].over=0; for(i=1;i<(row*col);) { if(point%4==1) { if(x[heng][zong+1].over==1&&(zong+1)<col) { zong++; printf("%d\n",x[heng][zong].data); x[heng][zong].over=0; i++; } else point++; } if(point%4==2) { if(x[heng+1][zong].over==1&&(heng+1)<row) { heng++; printf("%d\n",x[heng][zong].data); x[heng][zong].over=0; i++; } else point++; } if(point%4==3) { if(x[heng][zong-1].over==1&&(zong-1)>=0) { zong--; printf("%d\n",x[heng][zong].data); x[heng][zong].over=0; i++; } else point++; } if(point%4==0) { if(x[heng-1][zong].over==1&&(heng-1)>=0) { heng--; printf("%d\n",x[heng][zong].data); x[heng][zong].over=0; i++; } else point++; } } }
46
22,947
int a[100][100]; void shuchu(int e,int b,int row,int col,int c) { int i,j; if(e==0||b==0) ; else if(e==1&&b==1) { printf("%d\n",a[c][c]); } else if(e==1&&b!=1) { for(j=c;j<col-c;j++) printf("%d\n",a[c][j]); } else if(e!=1&&b==1) { for(j=c;j<row-c;j++) printf("%d\n",a[j][c]); } else { for(i=c;i<col-c;i++) printf("%d\n",a[c][i]); for(i=c+1;i<row-c;i++) printf("%d\n",a[i][col-c-1]); for(i=col-c-2;i>=c;i--) printf("%d\n",a[row-c-1][i]); for(i=row-c-2;i>c;i--) printf("%d\n",a[i][c]); shuchu(e-2,b-2,row,col,c+1); } } int main() { int row,col,i,j; scanf("%d %d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&a[i][j]); } } shuchu(row,col,row,col,0); return 0; }
46
22,948
int main() { int m,n,sxrow,xxrow,sxcol,xxcol,i,j,a[M][N],num,s=0; scanf("%d%d",&m,&n); for(i=0;i<m;i++){ for(j=0;j<n;j++){ scanf("%d",&a[i][j]); } } num=m*n; sxrow=m-1;xxrow=0; sxcol=n-1;xxcol=0; while(s!=num){ for(i=xxcol;i<=sxcol;i++){ printf("%d\n",a[xxrow][i]); s++; } if(s==num){break;} for(i=xxrow+1;i<=sxrow;i++){ printf("%d\n",a[i][sxcol]); s++; } if(s==num){break;} for(i=sxcol-1;i>=xxcol;i--){ printf("%d\n",a[sxrow][i]); s++; } if(s==num){break;} xxrow++;xxcol++; for(i=sxrow-1;i>=xxrow;i--){ printf("%d\n",a[i][xxcol-1]); s++; } if(s==num){break;} sxrow--;sxcol--; } return 0; }
46
22,949
int main() { int array[100][100],s[10000],row,col,i,j,k,l,h,a,b,c; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&array[i][j]); } } b=row; c=col; if(b>c) { a=b; b=c; c=a; } a=b; if(a%2==0) { l=a/2; } else { l=a/2+1; } k=0; for(h=0;h<l;h++) { for(j=h;j<col-h;j++) { s[k]=array[h][j]; k++; } for(i=h+1;i<row-h;i++) { s[k]=array[i][col-1-h]; k++; } for(j=col-2-h;j>=h;j--) { s[k]=array[row-1-h][j]; k++; } for(i=row-2-h;i>h;i--) { s[k]=array[i][h]; k++; } } for(k=0;k<row*col;k++) { printf("%d\n",s[k]); } return 0; }
46
22,950
int main() { int n,m,i,j,r,k; int a[100][100]; scanf("%d %d",&m,&n); for(i=0;i<m;i++) for(j=0;j<n;j++) scanf("%d",&a[i][j]); printf("\n"); for(r=0,k=0;;r++) { for(i=r,j=r;j<=n-r-1;j++) { k++; printf("%d\n",a[i][j]); } if(k==m*n)break; for(i=r+1,j=n-1-r;i<=m-1-r;i++) { k++; printf("%d\n",a[i][j]); } if(k==m*n)break; for(i=m-1-r,j=n-r-2;j>=r;j--) { k++; printf("%d\n",a[i][j]); } if(k==m*n)break; for(i=m-2-r,j=r;i>=r+1;i--) { k++; printf("%d\n",a[i][j]); } if(k==m*n)break; } return 0; }
46
22,951
void main() { int a[105][105],row,col,min,i,j; int n,x; scanf("%d %d",&row,&col); for(i=1;i<=row;i++) for(j=1;j<=col;j++) scanf("%d",&a[i][j]); if(row<=col) min=row; else min=col; if(min%2==0) n=min/2; else n=min/2+1; for(x=1;x<=n;x++) { i=x; for(j=x;j<=col-x+1;j++) printf("%d\n",a[i][j]); if(row==min&&row%2==1&&x==n) break; j=col-x+1; for(i=x+1;i<=row-x+1;i++) printf("%d\n",a[i][j]); if(col==min&&col%2==1&&x==n) break; i=row-x+1; for(j=col-x;j>=x;j--) printf("%d\n",a[i][j]); if(row==min&&row%2==0&&x==n) break; j=x; for(i=row-x;i>=x+1;i--) printf("%d\n",a[i][j]); } }
46
22,952
int main(){ int a,b=0,b1=0,c,d,e,f,g,i,k,t,raw,col,x,y; int array[100][100]; scanf("%d %d",&raw,&col); c=raw*col; for(i=0;i<raw;i++){ for(t=0;t<col;t++){ scanf("%d",&a); array[i][t]=a; } } for(i=0;b<c;i++){ for(t=i;t<col-i;t++){ if(b<c){ printf("%d\n",array[i][t]); } b=b+1; } for(e=i+1;e<raw-i;e++){ if(b<c){ printf("%d\n",array[e][col-i-1]); } b=b+1; } for(f=col-2-i;f>=i;f--){ if(b<c){ printf("%d\n",array[raw-1-i][f]); } b=b+1; } for(g=raw-2-i;g>i;g--){ if(b<c){ printf("%d\n",array[g][i]); } b=b+1; } } scanf("%d\n",&array[x][y]); return 0; }
46
22,953
int main(){ int i,j,n,all,row,col,sum; int sz[200][200]; sum=0; scanf("%d%d",&row,&col); all=row*col; for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&sz[i][j]); } } for(n=0;;n++){ for(i=n;i<(col-n);i++) { printf("%d\n",sz[n][i]); sum=sum+1; } if(sum==all) break; for(j=n+1;j<(row-n);j++) { printf("%d\n",sz[j][col-n-1]); sum=sum+1; } if(sum==all) break; for(i=col-2-n;i>=n;i--) { printf("%d\n",sz[row-n-1][i]); sum=sum+1; } if(sum==all) break; for(j=(row-2-n);j>n;j--) { printf("%d\n",sz[j][n]); sum=sum+1; } if(sum==all) break; } return 0; }
46
22,954
int main() { int row,col; int sz[100][100]; int i,j; scanf("%d%d",&row,&col); for(j=0;j<row;j++){ for(i=0;i<col;i++){ scanf("%d",&sz[j][i]); } } int n; int k,I,J,M,N; if(col%2==0&&row%2==0){ if(col<=row){ n=col/2; }else{ n=row/2; } for(k=0;k<n;k++){ for(I=k;I<col-k-1;I++){ printf("%d\n",sz[k][I]); } for(J=k;J<row-k-1;J++){ printf("%d\n",sz[J][col-k-1]); } for(M=col-k-1;M>k;M--){ printf("%d\n",sz[row-k-1][M]); } for(N=row-k-1;N>k;N--){ printf("%d\n",sz[N][k]); } } }else{ if(row<=col){ n=row/2+1; for(k=0;k<n;k++){ for(I=k;I<col-k-1;I++){ printf("%d\n",sz[k][I]); } if(2*k<row-1){ for(J=k;J<row-k-1;J++){ printf("%d\n",sz[J][col-k-1]); } }else{ for(J=k;J<=row-k-1;J++){ printf("%d\n",sz[J][col-k-1]); } break; } for(M=col-k-1;M>k;M--){ printf("%d\n",sz[row-k-1][M]); } for(N=row-k-1;N>k;N--){ printf("%d\n",sz[N][k]); } } }else{ n=col/2+1; for(k=0;k<n;k++){ for(I=k;I<col-k-1;I++){ printf("%d\n",sz[k][I]); } if(k!=n-1){ for(J=k;J<row-k-1;J++){ printf("%d\n",sz[J][col-k-1]); } }else{ for(J=k;J<=row-k-1;J++){ printf("%d\n",sz[J][col-k-1]); } break; } for(M=col-k-1;M>k;M--){ printf("%d\n",sz[row-k-1][M]); } for(N=row-k-1;N>k;N--){ printf("%d\n",sz[N][k]); } } } } return 0; }
46
22,955
int main() { int a[100][100], row, col; cin >> row >> col; for (int i = 0; i < row; i++) for (int j = 0; j < col; j++) cin >> a[i][j]; int r = 0, c = 0, num = 0, n = row * col, row0 = 0, col0 = 0; while (true) { for (; c < col; c++) { cout << a[r][c] <<endl; num++; } if (num == n) break; row0++; c--; r++; for (; r < row; r++) { cout << a[r][c] << endl; num++; } if (num == n) break; col--; r--; c--; for (; c >= col0; c--) { cout << a[r][c] << endl; num++; } if (num == n) break; row--; c++; r--; for (; r >= row0; r--) { cout << a[r][c] << endl; num++; } if (num == n) break; col0++; r++; c++; } cin >> row; return 0; }
46
22,956
int main() { int a[100][100],row ,col; cin>>row>>col; for(int i=0;i<row;i++) //???? for(int j=0;j<col;j++) cin>>a[i][j]; int flag=0; //?? for(int i=0;;i++) { for(int j=i;j<=col-i-1;j++) //?? { cout<<a[i][j]<<endl; flag+=1; } if(flag==row*col) break; for(int j=i+1;j<=row-i-1;j++) //?? { cout<<a[j][col-i-1]<<endl; flag+=1; } if(flag==row*col) break; for(int j=col-i-2;j>=i+1;j--) //?? { cout<<a[row-i-1][j]<<endl; flag+=1; } if(flag==row*col) break; for(int j=row-i-1;j>=i+1;j--) //?? { cout<<a[j][i]<<endl; flag+=1; } if(flag==row*col) break; } return 0; }
46
22,957
int main() { int a[100][100] = {0},r,c,i,j,k = 1; cin >> r >> c; for(i = 1;i <= r;i++) { for(j = 1;j <= c;j++) { cin >> a[i][j]; } } while((r >= 2)&&(c >= 2)) { for(i = k;i <= c+k-1;i++) { cout << a[k][i] << endl; } for(i = k + 1;i <= r+k-1;i++) { cout << a[i][c+k-1] << endl; } for(i = c+k-2;i >= k;i--) { cout << a[r+k-1][i] << endl; } for(i = r+k-2;i >= k+1;i--) { cout << a[i][k] << endl; } k++; r = r - 2; c = c - 2; } if((r == 1)&&(c != 1)) { for(i = k;i <= c+k-1;i++) { cout << a[k][i] << endl; } } if((c == 1)&&(r != 1)) { for(i = k;i <= r+k-1;i++) { cout << a[i][c+k-1] << endl; } } if((r == 1)&&(c == 1)) { cout << a[k][k] << endl; } return 0; }
46
22,958
int main() { int row,col; int array[100][100]; int i,j,count,n; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) { scanf("%d",&array[i][j]); } } count=0; for(n=0;;n++) { for(i=n;i<col-n;i++) { printf("%d\n",array[n][i]); count++; } for(j=n+1;j<row-n;j++) { printf("%d\n",array[j][col-n-1]); count++; } if (count==row*col) break; for(i=col-2-n;i>=n;i--) { printf("%d\n",array[row-n-1][i]); count++; } for(j=row-2-n;j>n;j--) { printf("%d\n",array[j][n]); count++; } } return 0; }
46
22,959
int main() { int a[100][100],row,col,i,j,k,n; scanf("%d%d",&row,&col); for(i=0;i<row;i++){ for(j=0;j<col;j++) scanf("%d",&a[i][j]); } if(row>col) n=2*col; else if(row<col) n=2*row; else n=2*row-1; for(k=0;k<n;k++){ if(k%4==0){ for(i=k/4;i<col-k/4;i++) printf("%d\n",a[k/4][i]); } if(k%4==1){ for(i=k/4+1;i<row-k/4;i++) printf("%d\n",a[i][col-1-k/4]); } if(k%4==2){ for(i=k/4+1;i<col-k/4;i++) printf("%d\n",a[row-1-k/4][col-1-i]); } if(k%4==3){ for(i=k/4+1;i<row-k/4-1;i++) printf("%d\n",a[row-i-1][k/4]); } } return 0; }
46
22,960
int num[100][100]; //float:?????????????? int row,col,i,j; void output(int,int,int,int); int main(){ cin>>row>>col; for(i = 0;i < row;i++) for(j = 0;j < col;j++) cin>>num[i][j]; output(0,0,row,col); return 0; } void output(int x,int y,int a,int b){ //???x?y?????a?b???? int i; if(a == 1){ for(i = x;i < x+b;i++) printf("%d\n",num[x][i]); } else if(a == 2){ for(i = x;i < x+b;i++) printf("%d\n",num[x][i]); for(i = x + b - 1;i >= x;i--) printf("%d\n",num[x+1][i]); } else if(b == 1){ for(i = y;i < y+a;i++) printf("%d\n",num[i][y]); } else if(b == 2){ printf("%d\n",num[x][y]); for(i = y;i < y+a;i++) printf("%d\n",num[i][y+1]); for(i = y + a - 1;i > y;i--) printf("%d\n",num[i][y]); } else{ for(i = x;i < x + b;i++)printf("%d\n",num[x][i]); for(i = y + 1;i < y + a;i++)printf("%d\n",num[i][x+b-1]); for(i = x + b - 2;i >= x;i--)printf("%d\n",num[y+a-1][i]); for(i = y + a - 2;i > y;i--)printf("%d\n",num[i][y]); output(x+1,y+1,a - 2,b - 2); } }
46
22,961
void main() { int a[100][100]; int i,j,row,col,n=0; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { scanf("%d",&a[i][0]); for(j=1;j<col;j++) { scanf(" %d",&a[i][j]); } } for(i=0;;i++) { for(j=i;j<col-i;j++,n++) printf("%d\n",a[i][j]); if(n==row*col) break; for(j=i+1;j<row-i;j++,n++) printf("%d\n",a[j][col-i-1]); if(n==row*col) break; for(j=col-i-2;j>i;j--,n++) printf("%d\n",a[row-i-1][j]); if(n==row*col) break; for(j=row-i-1;j>i;j--,n++) printf("%d\n",a[j][i]); if(n==row*col) break; } }
46
22,962
void main() { void f(int n,int m); int n,m; scanf("%d %d",&n,&m); f(n,m); } void f(int n,int m) { int a[100][100];int i=0,j=0,b=0,p,t=1,s=0; for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%d",&a[i][j]); } } p=m*n;i=0;j=0; while(1) { for(;j<m;j++) { printf("%d\n",a[i][j]);b++;if(b==p) break; } i++;j--; if(b==p) break; for(;i<n;i++) { printf("%d\n",a[i][j]);b++;if(b==p) break; } j--;i--; if(b==p) break; for(;j>=s;j--) { printf("%d\n",a[i][j]);b++;if(b==p) break; } if(b==p) break; j++;i--; for(;i>=t;i--) { printf("%d\n",a[i][j]);b++;if(b==p) break; } j++; if(b==p) break;i++;m--;n--;s++;t++; } }
46
22,963
int main(){ int array[100][100],i,j,a,b,b1,c,c1,d,e,f,f1,g,g1,h,row,col,sz[10000]={0},n=0,s=0,p,k=0; scanf("%d %d",&row,&col); for (i=0;i<row;i++){ for (j=0;j<col;j++){ scanf("%d",&array[i][j]); s++; } } while (n<=s){ for (k=0;k<col;k++){ a=k; b1=k; for(b=b1;b<col-k;b++){ sz[n]=array[a][b]; n++; } d=col-k-1; for (c=k+1;c<row-k;c++){ sz[n]=array[c][d]; n++; } e=row-k-1; f1=col-2-k; for (f=f1;f>=k;f--){ sz[n]=array[e][f]; n++; } h=k; g1=row-2-k; for (g=g1;g>=1+k;g--){ sz[n]=array[g][h]; n++; } } } for (p=0;p<s;p++){ printf("%d\n",sz[p]); } return 0; }
46
22,964
int main(){ int r,c; scanf("%d %d",&r,&c); int sz[100][100]; for(int i=0;i<r;i++){ for(int j=0;j<c;j++){ scanf("%d",&sz[i][j]); } } int i=0,j=0; int p=0,q=0; int n=0; while(i<=r/2&&j<=c/2){ while(q<c-j){ printf("%d\n",sz[p][q]); q++; n++; } if(n>=r*c){ break; } q=q-1; p=p+1; while(p<r-i){ printf("%d\n",sz[p][q]); p++; n++; } if(n>=r*c){ break; } p=p-1; q=q-1; while(q>=j){ printf("%d\n",sz[p][q]); q--; n++; } if(n>=r*c){ break; } q=q+1; p=p-1; i=i+1; while(p>=i){ printf("%d\n",sz[p][q]); p--; n++; } if(n>=r*c){ break; } p=p+1; q=q+1; j=j+1; } return 0; }
46
22,965
int main() { int arrey [100][100]; int i, j, k, times, all; int row, col; cin >> row >> col; for(i = 0; i < row; i ++) for(j = 0; j < col ; j ++) cin >> arrey[i][j]; k = 0; times = 0; all = row * col; do{ i = k; j = k; for( ; j <= col - 1; j ++) { cout << arrey[i][j] << endl; times ++; } --j; if( times == all) break; for(++i ; i <= row - 1;i ++) { cout << arrey[i][j] << endl; times ++;} --i; if( times == all) break; for( --j;j >= k; j --) { cout << arrey[i][j] << endl; times ++; } if( times == all) break; ++j; for(--i ;i > k; i --) { cout << arrey[i][j] << endl; times ++; } if( times == all) break; col --; row --; k ++; }while(1); return 0; }
46
22,966
int main(){ int x[100][100]; int row,col,i,j; scanf("%d%d",&row,&col); for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&x[i][j]); } } int s=0,a=row-1,b=0,c=col-1; while(s<=a&&b<=c){ if(s<a&&b<c){ for(i=b;i<c;i++){ printf("%d\n",x[s][i]); } for(i=s;i<a;i++){ printf("%d\n",x[i][c]); } for(i=c;i>b;i--){ printf("%d\n",x[a][i]); } for(i=a;i>s;i--){ printf("%d\n",x[i][b]); } }else if(s==a){ for(i=b;i<=c;i++){ printf("%d\n",x[s][i]); } }else{ for(i=s;i<=a;i++){ printf("%d\n",x[i][b]); } } s=s+1; a=a-1; b=b+1; c=c-1; } return 0; }
46
22,967
int main() { int col,row,n,t,j,m,i,k,l; int a[101][101]={0},b[101][101]={0}; scanf("%d %d",&row,&col); for (i=1;i<=row;i++) for (j=1;j<=col;j++) scanf("%d",&a[i][j]); for (i=1;i<=row;i++) { b[i][0]=1; b[i][col+1]=1; } for (j=1;j<=col;j++) { b[0][j]=1; b[row+1][j]=1; } m=0;i=1;j=1; while (m<col*row) { printf("%d\n",a[i][j]); m=m+1; b[i][j]=1; if (b[i-1][j]==1) { if (b[i][j-1]==1) { if (b[i][j+1]==0) j++; else i++; } else if (b[i+1][j]==0) i++; else j--; } else if (b[i][j-1]==0) j--; else i--; } return 0; }
46
22,968
int main() { int row,col; int i,j; int matrix[100][100]; /*????*/ cin>>row>>col; for (i=1;i<=row;i++) { for (j=1;j<=col;j++) { cin>>matrix[i][j]; } } /*?????*/ int k; cout<<matrix[1][1]; for (k=2;k<=col;k++) { cout<<endl<<matrix[1][k]; } /*??????*/ int xlength=col-1; int ylength=row-1; int t; char flag='d'; i=1;j=col; while ( ( (flag=='u'||flag=='d')&&(ylength!=0) ) || ( (flag=='l'||flag=='r')&&(xlength!=0) ) ) { switch (flag) { case 'd': for (t=1;t<=ylength;t++) { i++; cout<<endl<<matrix[i][j]; } flag='l'; ylength--; break; case 'l': for (t=1;t<=xlength;t++) { j--; cout<<endl<<matrix[i][j]; } flag='u'; xlength--; break; case 'u': for (t=1;t<=ylength;t++) { i--; cout<<endl<<matrix[i][j]; } flag='r'; ylength--; break; case 'r': for (t=1;t<=xlength;t++) { j++; cout<<endl<<matrix[i][j]; } flag='d'; xlength--; break; } } return 0; }
46
22,969
int main(){ int sz[100][100]; int m,n; scanf("%d %d",&m,&n); int i,j,p,m1,n1; for(i=0;i<m;i++){ for(j=0;j<n;j++){ scanf("%d",&sz[i][j]); } } int a = m > n ? n : m; for(p=0;p<a/2;p++){ for(m1=p,n1=p;n1<n-1-p;n1++){ printf("%d\n",sz[m1][n1]); } //printf("--> end\n"); for(n1=n-1-p,m1=p;m1<m-1-p;m1++){ printf("%d\n",sz[m1][n1]); } //printf("|v end\n"); if(m-1-p!=p) { for(m1=m-1-p,n1=n-1-p;n1>p;n1--){ printf("%d\n",sz[m1][n1]); } //printf("<--- end\n"); } if(n-1-p!=p) { for(n1=p,m1=m-1-p;m1>=p+1;m1--){ printf("%d\n",sz[m1][n1]); } //printf("^| end\n"); } } //printf("p=%d\n", p); if (m-1-p == p) { for (int i = p; i <= n-1-p; i++) printf("%d\n", sz[p][i]); } else if (n-1-p == p) { for (int i = p; i <= m-1-p; i++) printf("%d\n", sz[i][p]); } return 0; }
46
22,970
int sum; void print(int a[][100],int m1,int n1,int m2,int n2,int k) { int i; for(i=n1;i<n2&&k!=sum;i++) { printf("%d\n",a[m1][i]); k+=1; } for(i=m1+1;i<m2&&k!=sum;i++) { printf("%d\n",a[i][n2-1]); k+=1; } for(i=n2-2;i>n1&&k!=sum;i--) { printf("%d\n",a[m2-1][i]); k+=1; } for(i=m2-1;i>m1&&k!=sum;i--) { printf("%d\n",a[i][n1]); k+=1; } if(n2-n1>2&&m2-m1>2) print(a,m1+1,n1+1,m2-1,n2-1,k); } void main() { int i,j,m,n,a[100][100]; scanf("%d %d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } } sum=m*n; print(a,0,0,m,n,0); }
46
22,971
//??????????????? //?????11.4 //????wayne int main() { int row,col,n,m,a[101][101]; //n,m??????????? int i,j,row1,row2,col1,col2; //row1???i???????,row2????????col1,col2 cin>>row>>col; for (i=1;i<=row;i++) for (j=1;j<=col;j++) cin>>a[i][j]; //???? for (i=row,j=col;i>=1&&j>=1;i=i-2,j=j-2) //???????????????? { row1=(row-i)/2+1; row2=row-(row-i)/2; col1=(col-j)/2+1; col2=col-(col-j)/2; //????row1,row2,col1,col2 if ((i!=1&&j!=1)||(i==1&&j==1)) { for (m=col1;m<=col2;m++) cout<<a[row1][m]<<endl; //?????? for (n=row1+1;n<=row2;n++) cout<<a[n][col2]<<endl; //?????? for (m=col2-1;m>=col1;m--) cout<<a[row2][m]<<endl; //?????? for (n=row2-1;n>=row1+1;n--) cout<<a[n][col1]<<endl; //?????? } else //???????????????1??????? { if (i==1) { for (m=col1;m<=col2;m++) cout<<a[row1][m]<<endl; } else { for (n=row1;n<=row2;n++) cout<<a[n][col1]<<endl; } } } return 0; }
46
22,972
int main() { int row,col,i,j; cin>>row>>col; int a[row][col]; for(i=0;i<row;i++) for(j=0;j<col;j++) cin>>a[i][j]; int n=0;//n??????1 while((n<row/2)&&(n<col/2))//?????????? { for(j=n;j<=col-2-n;j++) cout<<a[n][j]<<endl; for(i=n;i<=row-2-n;i++) cout<<a[i][col-1-n]<<endl; for(j=col-1-n;j>=1+n;j--) cout<<a[row-1-n][j]<<endl; for(i=row-1-n;i>=1+n;i--) cout<<a[i][n]<<endl; n++; } //?????????? for(j=n;j<=col-1-n;j++) cout<<a[n][j]<<endl; if(row-1-2*n>0)//??????????? { for(i=n+1;i<=row-1-n;i++) cout<<a[i][col-1-n]<<endl; if(col-2-2*n>0)//?????????? { for(j=col-2-n;j>=n;j--) cout<<a[row-1-n][j]; } } }
46
22,973
/* * c.cpp * ???1100012870; * ??????? * Created on: 2011-11-3 * Author: Li Wenpeng */ int main() { int a[150][150],b[150][150]; int m,n,i,j,x,y; memset(b,0,sizeof(b)); //?b???? cin>>m>>n; for(i=1;i<=m;i++) //?? for(j=1;j<=n;j++){ cin>>a[i][j]; b[i][j]=1; } x=0;y=1;i=1;j=1; //??a?1??1? cout<<a[1][1]<<endl; b[1][1]=0; while(x+y!=0){ //??????????? if(b[i+x][j+y]>0) { cout<<a[i+x][j+y]<<endl; i=i+x; j=j+y; b[i][j]=0; continue; }; //???????? if (b[i+1][j]>0){x=1;y=0;continue;} if (b[i-1][j]>0){x=-1;y=0;continue;} if (b[i][j+1]>0){x=0;y=1;continue;} if (b[i][j-1]>0){x=0;y=-1;continue;} break; } return 0; }
46
22,974
int main() { int a[100][100],m,n,i,j,s=0; int (*p)[100]; p=a; scanf("%d%d",&m,&n); for(i=0;i<m;i++) { for(j=0;j<n;j++) scanf("%d",&a[i][j]);} for(i=0;(i<(m+1)/2)&&(i<(n+1)/2);i++) { for(j=i;j<n-i;j++) { if(s<n*m) printf("%d",*(*(p+i)+j)); if(s<n*m-1) printf("\n"); s++; } for(j=i+1;j<m-i;j++) { if(s<n*m) printf("%d",*(*(p+j)+n-1-i)); if(s<n*m-1) printf("\n"); s++; } for(j=n-i-2;j>=i;j--) { if(s<n*m) printf("%d",*(*(p+m-1-i)+j)); if(s<n*m-1) printf("\n"); s++; } for(j=m-i-2;j>i;j--) { if(s<n*m) printf("%d",*(*(p+j)+i)); if(s<n*m-1) printf("\n"); s++; } } return 0; }
46
22,975
int main() { int row,col; int b,c,d,e,k,i; int a[100][100]; scanf("%d%d",&row,&col); for(k=0;k<row;k++) { for(i=0;i<col;i++) { scanf("%d",&a[k][i]); } } b=0; d=0; c=col-1; e=row-1; for(;b<=c&&d<=e;b++,d++,c--,e--) { if(b!=c&&d!=e) { for(i=b;i<c;i++) printf("%d\n",a[d][i]); for(i=d;i<e;i++) printf("%d\n",a[i][c]); for(i=c;i>b;i--) printf("%d\n",a[e][i]); for(i=e;i>d;i--) printf("%d\n",a[i][b]); } else if(b==c) { for(i=d;i<=e;i++) printf("%d\n",a[i][b]); } else if(d==e) { for(i=b;i<=c;i++) printf("%d\n",a[d][i]); } } return 0; }
46
22,976
int main() { int array[110][110]; int row, col; int rowup = 0, rowdown = 0, colleft = 0, colright = 0; cin >> row >> col; for (int i = 1; i <= row; i++) { for (int j = 1; j <= col; j++) { cin >> array[i][j]; } } while (1) { for (int k = colleft + 1; k <= col - colright; k++) { cout << array[rowup + 1][k] << endl; } rowup++; if (rowup + rowdown >= row) break; for (int k = rowup + 1; k <= row - rowdown; k++) { cout << array[k][col - colright] << endl; } colright++; if (colright + colleft >= col) break; for (int k = col - colright; k >= colleft + 1; k--) { cout << array[row - rowdown][k] << endl; } rowdown++; if (rowup + rowdown >= row) break; for (int k = row - rowdown; k >= rowup + 1; k--) { cout << array[k][colleft + 1] << endl; } colleft++; if (colright + colleft >= col) break; } return 0; }
46
22,977
int main() { int row,col; int i,j,n,time=0; scanf("%d%d",&row,&col); int array[100][100]; for(i=0;i<row;i++) for(j=0;j<col;j++) scanf("%d",&array[ i ][ j ]); for (n=0;;n++) { for (i=n;i<col-n;i++) { printf("%d\n",array[ n ][ i ]); time++; } if(time==row*col)break; for (j=n+1;j<row-n;j++) { printf("%d\n",array[ j ][col-n-1]); time++; } if(time==row*col)break; for (i=col-2-n;i>=n;i--) { printf("%d\n",array[row-n-1][ i ]); time++; } if(time==row*col)break; for (j=row-2-n;j>n;j--) { printf("%d\n",array[ j ][ n ]); time++; } if(time==row*col)break; } scanf("%d%d",&row,&col); return 0; }
46
22,978
int main() { int i=0,j=0,row=0,col=0,count=0,k=0,l=0,m=0; int a[110][110]={0}; cin>>row>>col; for(i=0;i<row;i++) { for(j=0;j<col;j++) { cin>>a[i][j]; } }//???????? int total = row * col; for(i=0;count < total;i++)//???????????row?col?????? { for(j=i;j<col-i;j++) { cout<<a[i][j]<<'\n'; count++; } if(count >= total) break; for(k=i+1;k<row-i;k++) { cout<<a[k][col-i-1]<<'\n'; count++; } if(count >= total) break; for(l=col-i-2;l>=i;l--) { cout<<a[row-i-1][l]<<'\n'; count++; } if(count >= total) break; for(m=row-i-2;m>=i+1;m--) { cout<<a[m][i]<<'\n'; count++; }//??????????????,???????????????????? } return 0; }
46
22,979
int main() { int i,j,k,hang,lie,a[100][100],total,sum=0;//??????????total?????????total=hang*lie? scanf("%d %d\n",&hang,&lie); total=hang*lie; for(i=0;i<=hang-1;i++) { for(j=0;j<=lie-1;j++) scanf("%d",&a[i][j]);} for(k=1;k<=10000;k++) { for(j=k-1;j<=lie-k;j++) { printf("%d\n",a[k-1][j]);sum=sum+1; if(sum==total)goto end;} for(i=k;i<=hang-k;i++) { printf("%d\n",a[i][lie-k]); sum=sum+1; if(sum==total)goto end; } for(j=lie-k-1;j>=k-1;j--) { printf("%d\n",a[hang-k][j]); sum=sum+1; if(sum==total)goto end;} for(i=hang-k-1;i>=k;i--) { printf("%d\n",a[i][k-1]); sum=sum+1; if(sum==total)goto end; } } end:; return 0; }
46
22,980
//************************************************* //***???????????*** //***??????*** //***???2012.12.24*** //************************************************* int main () { int row,col,i,j,n,a[100][100],c; cin >> row >> col; c = row * col; for (i = 0; i < row; i++) { for (j = 0; j < col; j++) { cin >> a[i][j]; } } if (row >= col) n = (col + 1) / 2; else n = (row + 1) / 2; for (i = 0; i < n; i++) { for (j = i; j < col - i; j++) { cout << a[i][j] << endl; c --; } if (c == 0) break; for (j = i + 1; j < row - i; j++) { cout << a[j][col - i - 1] << endl; c--; } if (c == 0) break; for (j = col - i - 2; j >= i; j--) { cout << a[row - i - 1][j] << endl; c--; } if (c == 0) break; for (j = row - i - 2; j > i; j--) { cout << a[j][i] << endl; c--; } if (c == 0) break; } return 0; }
46
22,981
void main() { int n,m,i,j,x,y,pos; int p[200][200]={0}; int a[200][200]; int f[10][2]; f[0][0]=0; f[0][1]=1; f[1][0]=1; f[1][1]=0; f[2][0]=0; f[2][1]=-1; f[3][0]=-1; f[3][1]=0; scanf("%d%d",&n,&m); for (i=1;i<=n;i++) for (j=1;j<=m;j++) { p[i][j]=1; scanf("%d",&a[i][j]); } x=1; y=1; pos=0; for (i=1;i<=n*m;i++) { printf("%d\n",a[x][y]); p[x][y]=0; if (!p[x+f[pos][0]][y+f[pos][1]]) pos=(pos+1)%4; x=x+f[pos][0]; y=y+f[pos][1]; } }
46
22,982
int main (){ int r,c,i,k,j,p; scanf("%d %d",&r,&c); int a[1000][1000]; for(i=0;i<r;i++){ for(k=0;k<c;k++){ scanf("%d",&a[i][k]); } } int s=0; int h=0; i=0; j=0; p=r*c; while(j<p){ for(i=s,k=h;k<c;k++){ if(j<p){ printf("%d\n",a[i][k]); j++; } } s++; for(i=s,k=c-1;i<r;i++){ if(j<p){ printf("%d\n",a[i][k]); j++; } } c--; for(k=c-1,i=r-1;k>=h;k--){ if(j<p){ printf("%d\n",a[i][k]); j++; } } r--; for(i=r-1,k=h;i>=s;i--){ if(j<p){ printf("%d\n",a[i][k]); j++; } } h++; } return 0; }
46
22,983
int main() {int n,m,v[100][100],z,d; scanf("%d %d",&m,&n); for(int i=0;i<=m-1;i++) {for(int j=0;j<=n-1;j++) {scanf("%d",&(v[i][j]));} } int p=0,u=n; if(m>n){u=m;} for(int i=0;i<=u;i++) { for(int d=i;d<=n-i-1;d++) { printf("%d\n",v[i][d]); p++;if(p==m*n){break;} } for(int a=i+1;a<=m-i-1;a++) { printf("%d\n",v[a][n-1-i]); p++;if(p==m*n){break;} } if(p==m*n){break;} for(int b=n-i-2;b>=i;b--) { printf("%d\n",v[m-i-1][b]); p++;if(p==m*n){break;} } if(p==m*n){break;} for(int c=m-i-2;c>=i+1;c--) { printf("%d\n",v[c][i]); p++; if(p==m*n){break;} } if(p==m*n){break;} } return 0; }
46
22,984
int main(int argc, char* argv[]) { int ROW,COL,row,col,rowxia,rowup,colxia,colup; int array[99][99]; scanf("%d%d",&ROW,&COL); for(row=0;row<ROW;row++){ for(col=0;col<COL;col++){ scanf("%d",&array[row][col]);}} for(rowxia=0,rowup=ROW-1,colxia=0,colup=COL-1;rowxia<rowup&&colxia<colup;rowxia++,colxia++,rowup--,colup--){ for(row=rowxia,col=colxia;col<colup;col++){ printf("%d\n",array[row][col]);} for(col=colup,row=rowxia;row<rowup;row++){ printf("%d\n",array[row][col]);} for(row=rowup,col=colup;col>colxia;col--){ printf("%d\n",array[row][col]);} for(col=colxia,row=rowup;row>rowxia;row--){ printf("%d\n",array[row][col]);}} if(rowup==rowxia){ for(col=colxia,row=rowup;col<=colup;col++){ printf("%d\n",array[row][col]);}} else if(colup==colxia){ for(row=rowxia,col=colup;row<=rowup;row++){ printf("%d\n",array[row][col]);}} return 0; }
46
22,985
int main() { int n,m,a[100][100],i,j,t; scanf("%d%d",&n,&m); for (i=1;i<=n;i++) for (j=1;j<=m;j++) scanf("%d",&a[i][j]); int k=n,l=m; i=1; j=1; do { for (t=j;t<=l;t++) printf("%d\n",a[i][t]); i++; if (i>k) break; for (t=i;t<=k;t++) printf("%d\n",a[t][l]); l--; if (l<j) break; for (t=l;t>=j;t--) printf("%d\n",a[k][t]); k--; if (i>k) break; for (t=k;t>=i;t--) printf("%d\n",a[t][j]); j++; if (l<j) break; } while((i<=k)&&(j<=l)); return 0; }
46
22,986
int a[105][105]; int main() { int m,n; int dx[4]={0,1,0,-1}; int dy[4]={1,0,-1,0}; int inow=1,jnow=1; int f=0; cin>>m>>n; for(int i=1;i<=m;i++) for(int j=1;j<=n;j++) cin>>a[i][j]; while(1){ cout<<a[inow][jnow]<<endl; a[inow][jnow]=0; if(a[inow+dx[f]][jnow+dy[f]]>0){ inow=inow+dx[f]; jnow=jnow+dy[f]; } else{ f=(f+1)%4; if(a[inow+dx[f]][jnow+dy[f]]==0) break; else{ inow=inow+dx[f]; jnow=jnow+dy[f]; } } } return 0; }
46
22,987
int main() { int m,n,i,j,k,p,q,flag=0,t; int a[123][123]; scanf("%d%d",&m,&n); for(i=0;i<m;i++) for(j=0;j<n;j++) { scanf("%d",&a[i][j]); } for(t=0;t<123;t++) { for(i=t;i<n-t;i++) { if(a[t][i]==-123||flag==1) {flag=1;break;} printf("%d\n",a[t][i]); a[t][i]=-123; } for(j=t+1;j<m-t;j++) { if(a[j][i-1]==-123||flag==1) {flag=1;break;flag=1;} printf("%d\n",a[j][i-1]); a[j][i-1]=-123; } for(p=i-2;p>=t;p--) { if(a[j-1][p]==-123||flag==1) {flag=1;break;flag=1;} printf("%d\n",a[j-1][p]); a[j-1][p]=-123; } for(q=j-2;q>t;q--) { if(a[q][t]==-123||flag==1) {flag=1;break;flag=1;} printf("%d\n",a[q][t]); a[q][t]=-123; } if(flag==1) break; } return 0; }
46
22,988
int main() { int i,j,r,c,rs,cs; int Shuzu[row][col]; scanf("%d %d",&r,&c); for(i=0;i<r;i++){ for(j=0;j<c;j++){ scanf("%d",&Shuzu[i][j]); } } /*printf("%d\n",Shuzu[0][0]);*/ for(i=rs=0,j=cs=0;;){ if(Shuzu[i][j]==0) break; printf("%d\n",Shuzu[i][j]); Shuzu[i][j]=0; if(i==rs&&j<c-1&&j>cs-1){j++;} else if(i==rs&&j==c-1){i++;r--;} else if(i<r&&i>rs&&j==c-1){i++;} else if(i==r&&j==c-1){j--;cs++;} else if(i==r&&j>cs-1&&j<c-1){j--;} else if(i==r&&j==cs-1){i--;rs++;} else if(i>rs&&i<r&&j==cs-1){i--;} else if(i==rs&&j==cs-1){j++;c--;} } return 0; }
46
22,989
int main(){ int row,col; cin>>row>>col; int a[105][105]; memset(a,-1,sizeof(a));//??????? int x=0,y=0,st=1; for(int i=0;i<row;i++)//?? for(int j=0;j<col;j++) cin>>a[i][j]; while(true){ if(st==1){//? cout<<a[x][y]<<endl; a[x][y]=-1; y++; if(a[x][y]==-1){//?? st=2; y--; x++; if(a[x][y]==-1)//?? break; } } else if(st==2){//? cout<<a[x][y]<<endl; a[x][y]=-1; x++; if(a[x][y]==-1){ st=3; x--; y--; if(a[x][y]==-1) break; } } else if(st==3){//? cout<<a[x][y]<<endl; a[x][y]=-1; y--; if(y<0){//?? y=0; st=4; x--; } if(a[x][y]==-1){ st=4; y++; x--; if(a[x][y]==-1) break; } } else if(st==4){//? cout<<a[x][y]<<endl; a[x][y]=-1; x--; if(a[x][y]==-1){ st=1; x++; y++; if(a[x][y]==-1) break; } } } return 0; }
46
22,990
int main(){ int array[100][100]; int i,j,x,y,row,col; scanf("%d%d",&row,&col); for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&array[i][j]); } } x=0; y=0; while(1){ for(j=y;j<col;j++){ printf("%d\n",array[x][j]); } x++; if( x == row ){ break; } for(i=x;i<row;i++){ printf("%d\n",array[i][col-1]); } col=col-1; if( y == col ) break; for(j=col-1;j>=y;j--){ printf("%d\n",array[row-1][j]); } row=row-1; for(i=row-1;i>=x;i--){ printf("%d\n",array[i][y]); } y++; if( x == row ) break; } return 0; }
46
22,991
int main() { int array[100][100],col,row,cs=0,i,j,x=0; scanf("%d%d",&row,&col); for(i=0;i<row;i++) { for(j=0;j<col;j++) scanf("%d",&array[i][j]); } do{ for(i=cs;i<cs+col-1;i++) printf("%d\n",array[cs][i]); for(i=cs;i<cs+row-1;i++) printf("%d\n",array[i][cs+col-1]); if(i!=cs){ for(i=cs;i<cs+col-1;i++) printf("%d\n",array[cs+row-1][2*cs+col-i-1]); }else { printf("%d\n",array[cs+row-1][cs+col-1]); x=1; } if(i!=cs){ for(i=cs;i<cs+row-1;i++) printf("%d\n",array[2*cs+row-i-1][cs]); }else if(x==0) printf("%d\n",array[cs+row-1][cs]); cs++; col-=2; row-=2; } while(col>0&&row>0); return 0; }
46
22,992
int main() { int a[288][288]; int n,m,i,j,t,x,y; scanf("%d%d",&n,&m); for (i=1;i<=n;i++) for (j=1;j<=m;j++) scanf("%d",&a[i][j]); x=n,y=m; i=1; j=1; do { for (t=j;t<=y;t++) printf("%d\n",a[i][t]); i=i+1; if (i>x) break; for (t=i;t<=x;t++) printf("%d\n",a[t][y]); y=y-1; if (y<j) break; for (t=y;t>=j;t--) printf("%d\n",a[x][t]); x=x-1; if (i>x) break; for (t=x;t>=i;t--) printf("%d\n",a[t][j]); j=j+1; if (y<j) break; } while ((i<=x)&&(j<=y)); }
46
22,993
int main() { int row,col; int i,j,n,time=0; scanf("%d%d",&row,&col); int array[R][C]; for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&array[i][j]); } } for(n=0;;n++) { for(i=n;i<=col-n-1;i++) { printf("%d\n",array[n][i]); time++; } if(time==row*col) break; for(j=n+1;j<=row-n-1;j++) { printf("%d\n",array[j][col-n-1]); time++; } if(time==row*col) break; for(i=col-n-2;i>=n;i--) { printf("%d\n",array[row-n-1][i]); time++; } if(time==row*col) break; for(j=row-n-2;j>=n+1;j--) { printf("%d\n",array[j][n]); time++; } if(time==row*col) break; } return 0; }
46
22,994
int main() { int a[100][100],n,m,i,j,k,p,q,sum=0; scanf("%d %d",&n,&m); for(i=0;i<n;i++) { for(j=0;j<m;j++) { scanf("%d",&a[i][j]); } } p=(n-1)/2; q=(m-1)/2; for(k=0;k<=p&&k<=q;k++) { for(i=k,j=k;j<m-k;j++) { sum++; printf("%d\n",a[i][j]); if(sum==n*m) { goto end; } } for(j=m-1-k,i=k+1;i<n-k;i++) { sum++; printf("%d\n",a[i][j]); if(sum==n*m) { goto end; } } for(i=n-1-k,j=m-k-2;j>=k;j--) { sum++; printf("%d\n",a[i][j]); if(sum==n*m) { goto end; } } for(j=k,i=n-k-2;i>=k+1;i--) { sum++; printf("%d\n",a[i][j]); if(sum==n*m) { goto end; } } } end: return 0; }
46
22,995
int main() { int array[101][101],row,col; int i=0,j=0,sum=0; cin>>row>>col; for(i=0;i<row;i++){ for(j=0;j<col;j++){ cin>>array[i][j]; }}//???? int n=0; for(n=0;;n++){ for(j=n;j<=col-n-1;j++){ cout<<array[n][j]<<endl; sum++;//??? } if(sum==row*col)break; for(i=n+1;i<=row-1-n;i++){ cout<<array[i][col-n-1]<<endl; sum++; }//??? if(sum==row*col)break; for(j=col-n-2;j>=n;j--){ cout<<array[row-1-n][j]<<endl; sum++; }//??? if(sum==row*col)break; for(i=row-2-n;i>=n+1;i--){ cout<<array[i][n]<<endl; sum++; }//??? if(sum==row*col)break; } return 0; }
46
22,996
int main() { int a[100][100]; int row,col,i,j,t1,t2=0; scanf("%d %d",&row,&col); for(i=0;i<row;i++){ for(j=0;j<col;j++){ scanf("%d",&a[i][j]); } } for(t1=0;t1<row;t1++){ if(t2==row*col){ break; } for(j=t1;j<col-t1;j++){ printf("%d\n",a[t1][j]); t2++; } if(t2==row*col){ break; } for(i=t1+1;i<row-t1;i++){ printf("%d\n",a[i][col-t1-1]); t2++; } if(t2==row*col){ break; } for(j=col-t1-2;j>=t1;j--){ printf("%d\n",a[row-t1-1][j]); t2++; } if(t2==row*col){ break; } for(i=row-t1-2;i>=t1+1;i--){ printf("%d\n",a[i][t1]); t2++; } if(t2==row*col){ break; } } return 0; }
46
22,997
int dir[4][2]={0,1, 1,0, 0,-1, -1,0}; int k,row,col,a[200][200]; int main(){ scanf("%d%d",&row,&col); for (int i=0;i<row;++i) for (int j=0;j<col;++j) scanf("%d",&a[i][j]); int k=0,i=0,j=0,i1,j1; while (1>0){ printf("%d\n",a[i][j]); a[i][j]=-1; i1=i+dir[k][0]; j1=j+dir[k][1]; if (i1>=0 && i1<row && j1>=0 && j1<col && a[i1][j1]!=-1){ i=i1;j=j1; continue; } k=(k+1)%4; i1=i+dir[k][0]; j1=j+dir[k][1]; if (i1>=0 && i1<row && j1>=0 && j1<col && a[i1][j1]!=-1){ i=i1;j=j1; continue; } break; } }
46
22,998
//**************************************** //*??? //*????? 1100012996 * //*???2011.10.26** //**************************************** int main() { int row, col, i, j, l, k; cin >> row >> col; int a[100][100]; for (i = 0; i < row; i++) for (j = 0; j < col; j++) { cin >> a[i][j]; } l = 0; k = 1; if (row == 1 && col == 1) { cout << a[0][0]; } else { for (j = 0; j < row * col; ) { switch(k) { case 1: for (i = l; i < col - l; i++) { cout << a[l][i] << endl; j++; } k++; break; case 2: for (i = l + 1; i < row - 1 - l; i++) { cout << a[i][col - 1 - l] << endl; j++; } k++; break; case 3: for (i = col - l - 1; i >= l; i--) { cout << a[row - l - 1][i] << endl; j++; } k++; break; case 4: for (i = row - l - 2; i > l; i--) { cout << a[i][l] << endl; j++; } k++; break; default: k = 1; l++; break; } } } return 0; }
46
22,999
int main(){ int m,n,x,y,c,d,e,f,g; int a[100][100]; scanf("%d %d",&n,&m); g=m*n; c=0; d=0; e=0; f=0; for(y=0;y<n;y++){ for(x=0;x<m;x++){ scanf("%d",&a[x][y]); } } while(g!=0){ if(g!=0){ if(c+d!=m-1){ for(x=c;x<m-d;x++){ printf("%d\n",a[x][e]); g--; } e++; }else{ printf("%d\n",a[c][e]); g--; e++; } } if(g!=0){ if(e+f!=n-1){ for(y=e;y<n-f;y++){ printf("%d\n",a[m-d-1][y]); g--; } d++; }else{ printf("%d\n",a[m-d-1][e]); d++; g--; } } if(g!=0){ if(c+d!=m-1){ for(x=m-d-1;x>=c;x--){ printf("%d\n",a[x][n-f-1]); g--; } f++; }else{ printf("%d\n",a[c][n-f-1]); g--; f++; } } if(g!=0){ if(e+f!=n-1){ for(y=n-f-1;y>=e;y--){ printf("%d\n",a[c][y]); g--; } c++; }else{ printf("%d\n",a[c][e]); c++; g--; } } } return 0; }
46