label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
46 | 22600 | int main()
{
int row,col,i,j,k;
int array[100][100];
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j];
if(row%2==0)
for(k=0;k<row/2;k++)
{
if(col-k-1==k)
{
for(i=k;i<row-k;i++)
cout<<array[i][k]<<endl;
break;
}
else
{if(col-k-1!=k)
for(i=k;i<col-k-1;i++)
cout<<array[k][i]<<endl;
if(k!=row-k-1)
for(i=k;i<row-k-1;i++)
cout<<array[i][col-k-1]<<endl;
else
cout<<array[k][col-k-1]<<endl;
if(col-k-1!=k&&k!=row-k-1)
for(i=col-k-1;i>k;i--)
cout<<array[row-k-1][i]<<endl;
if(k!=row-k-1&&col-k-1!=k)
for(i=row-k-1;i>k;i--)
cout<<array[i][k]<<endl;}
}
else
for(k=0;k<row/2+1;k++)
{
if(col-k-1==k)
{
for(i=k;i<row-k;i++)
cout<<array[i][k]<<endl;
break;
}
else
{if(col-k-1!=k)
for(i=k;i<col-k-1;i++)
cout<<array[k][i]<<endl;
if(k!=row-k-1)
for(i=k;i<row-k-1;i++)
cout<<array[i][col-k-1]<<endl;
else
cout<<array[k][col-k-1]<<endl;
if(col-k-1!=k&&k!=row-k-1)
for(i=col-k-1;i>k;i--)
cout<<array[row-k-1][i]<<endl;
if(k!=row-k-1&&col-k-1!=k)
for(i=row-k-1;i>k;i--)
cout<<array[i][k]<<endl;}
}
return 0;
} |
46 | 22601 | int main()
{
int row,col,a[100][100],i,j,k,b[100][100];
cin>>row>>col;
for(i=0;i<=row-1;i++)
for(j=0;j<=col-1;j++)
{cin>>a[i][j];
b[i][j]=0;}
if(row==1)
{for(i=0;i<=col-1;i++) cout<<a[0][i]<<endl;}
else{
for(i=0;i<=(col-1)/2;i++)
{for(k=i;k<=col-i-1;k++)
{if(b[i][k]==0) {cout<<a[i][k]<<endl;b[i][k]=1;}}
for(k=i+1;k<=row-2-i;k++)
{if(b[k][col-1-i]==0) {cout<<a[k][col-1-i]<<endl;b[k][col-1-i]=1;}}
for(k=col-1-i;k>=i;k--)
{if(b[row-1-i][k]==0) {cout<<a[row-1-i][k]<<endl;b[row-1-i][k]=1;}}
for(k=row-2-i;k>=i+1;k--)
{if(b[k][i]==0) {cout<<a[k][i]<<endl;b[k][i]=1;}}
}}
return 0;} |
46 | 22602 | int main()
{
int row,col,array[100][100][2]={0}; //?????????????????????????????????????????????????????????
int i,j,time=0;
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j][0];
for(i=0;i<=row/2;i++) //??????????
{
if(time==row*col)
break;
for(j=0;j<col;j++) //??????????????????????????????
{
if(array[i][j][1]==0)
{
cout<<array[i][j][0]<<endl;
array[i][j][1]=1;
time++;
}
}
for(j=0;j<row;j++) //????????????????col-1-i(??????)
{
if(array[j][col-1-i][1]==0)
{
cout<<array[j][col-1-i][0]<<endl;
array[j][col-1-i][1]=1;
time++;
}
}
for(j=col-1;j>=0;j--) //????????????????row-1-i
{
if(array[row-1-i][j][1]==0)
{
cout<<array[row-1-i][j][0]<<endl;
array[row-1-i][j][1]=1;
time++;
}
}
for(j=row-1;j>=0;j--) //???????????
{
if(array[j][i][1]==0)
{
cout<<array[j][i][0]<<endl;
array[j][i][1]=1;
time++;
}
}
}
return 0;
} |
46 | 22603 | int main()
{
int a[100][100]={0},row,col,x1,x2,y1,y2,i,j;
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++)
{
if(i>=((row+1)/2)) break;
if(i>=((col+1)/2)) break;
x1=i;x2=row-i-1;y1=i;y2=col-i-1;
for(y1=y1;y1<=y2;y1++)
{
printf("%d\n",a[x1][y1]);
}
y1=i;
for(x1=x1+1;x1<=x2;x1++)
{
printf("%d\n",a[x1][y2]);
}
x1=i;
if(x1<x2)
for(y2=y2-1;y2>=y1;y2--)
{
printf("%d\n",a[x2][y2]);
}
y2=col-1-i;
if(y1<y2)
for(x2=x2-1;x2>x1;x2--)
{
printf("%d\n",a[x2][y1]);
}
}
return 0;
}
|
46 | 22604 | int main(){
int row,col,array[100][100],i,j,l,t,count1,count2; //??????????100?100???????
cin>>row>>col; //??row?col
for(i=0;i<row;i++) //????
for(j=0;j<col;j++)
cin>>array[i][j];
for(i=row-1,j=col-1,t=0,count1=row,count2=col;count1>0&&count2>0;count1=count1-2,count2=count2-2,t++) //???????t??????????count1?count2??????????????????????
{
/*cout<<"****"<<"count1="<<count1<<' '<<"count2="<<count2<<' '<<"t="<<t<<endl;
cout<<"l1="<<l<<endl;*/
for(l=t;l<j-t;l++) //???????????
{cout<<array[t][l]<<endl;
/*cout<<"***";*/
}
/*cout<<"l2="<<l<<endl;*/
for(l=t;l<i-t;l++) //??????
{cout<<array[l][j-t]<<endl;
/*cout<<"***2";*/}
if(count1!=1)
for(l=j-t;l>t;l--) //??????
{cout<<array[i-t][l]<<endl;
/*cout<<"***3";*/}
else if(count2!=1)cout<<array[i-t][j-t];
if(count2!=1)
for(l=i-t;l>t;l--) //??????
{ cout<<array[l][t]<<endl;
/*cout<<"***4";*/}
else if(count1!=1)cout<<array[i-t][t];
if(count1==1&&count2==1)
cout<<array[t][j-t];
/*cout<<'*'<<"count1="<<count1<<' '<<"count2="<<count2<<' '<<"t="<<t<<endl;*/
}
/*cout<<"**"<<"count1="<<count1<<' '<<"count2="<<count2<<' '<<"t="<<t<<endl;*/
return 0;
} |
46 | 22605 | int main()
{
int x[100][100];
int a,b;
scanf("%d %d",&a,&b);
int m,n;
for(m=0;m<a;m++)
{
for(n=0;n<b;n++)
{
scanf("%d",&x[m][n]);
}
}
int xx_row=0,sx_row=a-1;
int xx_col=0,sx_col=b-1;
int i,j;
while((xx_row<sx_row)&&(xx_col<sx_col))
{
for(j=xx_col;j<sx_col;j++)
{
printf("%d\n",x[xx_row][j]);
}
for(i=xx_row;i<sx_row;i++)
{
printf("%d\n",x[i][sx_col]);
}
for(j=sx_col;j>xx_col;j--)
{
printf("%d\n",x[sx_row][j]);
}
for(i=sx_row;i>xx_row;i--)
{
printf("%d\n",x[i][xx_col]);
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;
}
if((xx_row==sx_row)&&(xx_col==sx_col))
{
printf("%d\n",x[xx_row][xx_col]);
}
if((xx_row==sx_row)&&(xx_col!=sx_col))
{
for(i=xx_col;i<=sx_col;i++)
{ printf("%d\n",x[xx_row][i]);}
}
if((xx_col==sx_col)&&(xx_row!=sx_row))
{
for(i=xx_row;i<=sx_row;i++)
{ printf("%d\n",x[i][xx_col]);}
}
return 0;
}
|
46 | 22606 | int a[999][999];
int f1(int x,int y);
int f2(int x,int y);
int f3(int x,int y);
int f4(int x,int y);
int main()
{
int n,m,i,j;
for (i=0;i<=998;i++) for (j=0;j<=998;j++) a[i][j]=-9876;
cin>>n>>m;
for (i=1;i<=n;i++) for (j=1;j<=m;j++) cin >>a[i][j];
f1(1,1);
return 0;
}
int f1(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x][y+1]!=-9876)
{
y++;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x+1][y]!=-9876) return (f2(x+1,y));
else return 0;
}
}
int f2(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x+1][y]!=-9876)
{
x++;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x][y-1]!=-9876) return (f3(x,y-1));
else return 0;
}
}
int f3(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x][y-1]!=-9876)
{
y--;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x-1][y]!=-9876) return (f4(x-1,y));
else return 0;
}
}
int f4(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x-1][y]!=-9876)
{
x--;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x][y+1]!=-9876) return (f1(x,y+1));
else return 0;
}
}
|
46 | 22607 | void main()
{
int row,col,i,j,a[100][100],counter;
scanf("%d %d",&row,&col);
counter=row*col;
for(i=0;i<row;i++){
for(j=0;j<col;j++) scanf("%d",&a[i][j]);
}
row-=1;col-=1;
for(i=0;i<=row/2;i++)
{
for(j=i;j<=col-i;j++){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
j--;
for(i+=1;i<=row-(col-j);i++){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
i--;
for(j-=1;j>=row-i;j--){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
j++;
for(i-=1;i>j;i--){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
}
end:
;
} |
46 | 22608 | int main()
{
int row,col;
int i,j,m,span=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 (m=0;;m++)
{
for (i=m;i<col-m;i++)
{
printf("%d\n",array[m][i]);
span++;
}
printf("\n");
if(span==row*col)break;
for (j=m+1;j<row-m;j++)
{
printf("%d\n",array[j][col-m-1]);
span++;
}
printf("\n");
if(span==row*col)break;
for (i=col-2-m;i>=m;i--)
{
printf("%d\n",array[row-m-1][i]);
span++;
}
printf("\n");
if(span==row*col)break;
for (j=row-2-m;j>m;j--)
{
printf("%d\n",array[j][m]);
span++;
}
printf("\n");
if(span==row*col)break;
}
return 0;
}
|
46 | 22609 | int main(){
int i,j,k,n=0,row,col,sz[100][100],xz[10000];
scanf("%d %d\n",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d ",&sz[i][j]);
}
}
for(k=0;n<row*col;k++){
i=0+k;
for(j=0+k;j<col-k;j++){
xz[n]=sz[i][j];
n++;
}
for(j--,i=1+k;i<row-k;i++){
xz[n]=sz[i][j];
n++;
}
for(i--,j=col-2-k;j>=0+k;j--){
xz[n]=sz[i][j];
n++;
}
for(j++,i=row-2-k;i>=1+k;i--){
xz[n]=sz[i][j];
n++;
}
}
for(n=0;n<row*col;n++){
printf("%d\n",xz[n]);
}
return 0;
}
|
46 | 22610 | 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 | 22611 | int main(){
int a[100][100];
int row,col,i,j,rowsx,rowxx,colsx,colxx;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
rowsx=row-1;
rowxx=0;
colsx=col-1;
colxx=0;
while(rowsx>rowxx && colsx>colxx){
for (j=colxx; j <colsx;j++){
printf("%d\n",a[rowxx][j]);
}
for (i=rowxx; i <rowsx;i++){
printf("%d\n",a[i][colsx]);
}
for (j=colsx; j >colxx;j--){
printf("%d\n",a[rowsx][j]);
}
for (i=rowsx; i >rowxx;i--){
printf("%d\n",a[i][colxx]);
}
rowsx--;
rowxx++;
colsx--;
colxx++;
}
if(row%2==1||col%2==1){
if(rowxx==rowsx){
for (j=colxx; j <=colsx;j++){
printf("%d\n",a[rowxx][j]);
}
}
else{
for (i=rowxx; i <=rowsx;i++){
printf("%d\n",a[i][colsx]);
}
}
}
return 0;
}
|
46 | 22612 | int main(){
int col,row,i,k,a,e,x;
int sz[100][100];
scanf("%d%d",&row,&col);
for(k=0;k<row;k++){
for(i=0;i<col;i++){
scanf("%d",&sz[k][i]);
}
}
k=0;i=-1;e=0;
for(x=0;;x=x+2){a=0;
for(i=i+1;i<col;i++){
printf("%d\n",sz[k][i]);a++;e++;
if(a==col-x){break;}
}
if(e==row*col){break;}
a=0;
for(k=k+1;k<row;k++){
printf("%d\n",sz[k][i]);a++;e++;
if(a==row-1-x){break;}
}
if(e==row*col){break;}
a=0;
for(i=i-1;i>=0;i--){
printf("%d\n",sz[k][i]);a++;e++;
if(a==col-1-x){break;}
}
if(e==row*col){break;}
a=0;
for(k=k-1;k>=0;k--){
printf("%d\n",sz[k][i]);a++;e++;
if(a==row-2-x){break;}
}
if(e==row*col){break;}
}
return 0;
}
|
46 | 22613 | 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 | 22614 | int main()
{
int a[100][100];
int m,n,i,j,k;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
for(k=0;2*k<m&&2*k<n;k++)
{
for(i=k,j=k;j<n-k-1;j++)
{
printf("%d\n",a[i][j]);
}
for(;i<m-k-1;i++)
{
printf("%d\n",a[i][j]);
}
if(i==k||j==k)
{
printf("%d\n",a[i][j]);
break;
}
for(;j>k;j--)
{
printf("%d\n",a[i][j]);
}
for(;i>k;i--)
{
printf("%d\n",a[i][j]);
}
}
return 0;
} |
46 | 22615 | int main()
{
int row, col, h, l, left, up; //????a
int a[110][110];
cin >> row >> col; //?????
for ( int i = 0; i < row; i++ ) //????????
{
for ( int j = 0; j < col; j++ )
cin >> a[i][j];
}
l = 0; //???
h = 0;
left = 0;
up = 0;
while ( left < col && up < row ) //???????????????????
{
for ( l = left; l < col - 1; l++ ) //???????????
{
cout << a[h][l] << endl;
}
for ( h = up; h < row - 1; h++ )
{
cout << a[h][l] << endl;
}
if ( ( up + 1 ) >= row ) //???????????
{
cout << a[h][col - 1];
break;
}
if ( ( left + 1 ) >= col )
{
cout << a[row - 1][l];
break;
}
for ( ; l > left; l-- )
{
cout << a[h][l] << endl;
}
for ( ; h > up; h-- )
{
cout << a[h][l] << endl;
}
left++; //????????
up++;
col--;
row--;
h = up;
}
return 0;
}
|
46 | 22616 |
int main()
{
int shuzu[100][100];
int i,j,row,col;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&shuzu[i][j]);
}
}
int row_xx=0,row_sx=row-1,col_xx=0,col_sx=col-1;
while(row_sx>row_xx&&col_sx>col_xx){
for(j=col_xx;j<col_sx;j++)
printf("%d\n",shuzu[row_xx][j]);
for(i=row_xx;i<row_sx;i++)
printf("%d\n",shuzu[i][col_sx]);
for(j=col_sx;j>col_xx;j--)
printf("%d\n",shuzu[row_sx][j]);
for(i=row_sx;i>row_xx;i--)
printf("%d\n",shuzu[i][col_xx]);
col_xx++;
row_xx++;
col_sx--;
row_sx--;
}
if(row_xx==row_sx&&col_xx<col_sx){
for(j=col_xx;j<=col_sx;j++){
printf("%d\n",shuzu[row_xx][j]);
}
}
else if(col_xx==col_sx&&row_xx<row_sx){
for(i=row_xx;i<=row_sx;i++){
printf("%d\n",shuzu[i][col_xx]);
}
}
if(row%2!=0&&col%2!=0&&((row>1&&col>1)||(row==1&&col==1))){
printf("%d\n",shuzu[(row-1)/2][(col-1)/2]);
}
return 0;
}
|
46 | 22617 |
int main()
{
int row, col;
int i, j;
int Array[100][100];
int startRow = 0, startCol = 0, endRow, endCol;
int step = 1;
scanf("%d %d", &row, &col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d", &Array[i][j]);
endRow = row - 1;
endCol = col - 1;
while(startRow <= endRow && startCol <= endCol)
{
switch(step)
{
case 1:
for(j = startCol; j <= endCol; j++)
printf("%d\n", Array[startRow][j]);
step++;
startRow++;
break;
case 2:
for(i = startRow; i <= endRow; i++)
printf("%d\n", Array[i][endCol]);
step++;
endCol--;
break;
case 3:
for(j = endCol; j >= startCol; j--)
printf("%d\n", Array[endRow][j]);
step++;
endRow--;
break;
case 4:
for(i = endRow; i >= startRow; i--)
printf("%d\n", Array[i][startCol]);
step = 1;
startCol++;
break;
}
}
return 0;
} |
46 | 22618 | int main(){
int array[110][110],result[10000],ROW,COL,n=0,i=0,k=0,j=0,s=0;
scanf("%d %d",&ROW,&COL);
for(i=0;i<ROW;i++){
for(j=0;j<COL;j++){
scanf("%d",&array[i][j]);
s++;
}
}
for(k=0,n=0;n<s;k++){
if (k%4==0){
for(j=k/4;j<COL-k/4;j++,n++){
result[n]=array[k/4][j];
}
}else if(k%4==1){
for(j=k/4+1;j<ROW-k/4;j++,n++){
result[n]=array[j][COL-k/4-1];
}
}else if(k%4==2){
for(j=COL-k/4-2;j>=k/4;j--,n++){
result[n]=array[ROW-k/4-1][j];
}
}else if(k%4==3){
for(j=ROW-k/4-2;j>k/4;j--,n++){
result[n]=array[j][k/4];
}
}
}
for(n=0;n<s;n++){
printf("%d\n",result[n]);
}
return 0;
} |
46 | 22619 |
int main()
{
int row,col;
int i,j,k,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 (k=0;;k++)
{
for (i=k;i<col-k;i++)
{
printf("%d\n",array[k][i]);
time++;
if(time==row*col)break;}
if(time==row*col)break;
for (j=k+1;j<row-k;j++)
{
printf("%d\n",array[j][col-k-1]);
time++;
if(time==row*col)break;}if(time==row*col)break;
for (i=col-2-k;i>=k;i--)
{
printf("%d\n",array[row-k-1][i]);
time++;
if(time==row*col)break;}if(time==row*col)break;
for (j=row-2-k;j>k;j--)
{
printf("%d\n",array[j][k]);
time++;
if(time==row*col)break;
}if(time==row*col)break;
}
return 0;
} |
46 | 22620 | 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 | 22621 | void f(int a[100][100],int m,int p,int q)
{
int n=0,i,j,w,*pt;
w=(p+1)*(q+1);
for(j=1;;j++)
{
for(pt=&a[m][m];pt<=&a[m][p];pt++)
{ printf("%d\n",*pt); n++;}
if(n==w) break;
for(i=m+1;i<=q;i++)
{printf("%d\n",*(*(a+i)+p));n++;}
if(n==w) break;
for(pt=&a[q][p-1];pt>=&a[q][m];pt--)
{printf("%d\n",*pt);n++;}
if(n==w) break;
for(i=q-1;i>=m+1;i--)
{ printf("%d\n",*(*(a+i)+m));n++;}
if(n==w) break;
m++;
p--;
q--;
}
}
void main()
{
int row,col,i,j,a[100][100],m=0,p,q;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
p=col-1;
q=row-1;
f(a,m,p,q);
} |
46 | 22622 | int main()
{
int a,b,i,j,k,l,m,p;
int f[num][num];
p=0;
scanf("%d %d",&a,&b);
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
scanf("%d",&f[i][j]);
}
}
for(i=0;;i++)
{
if(p==a*b)
break;
for(j=i;j<b-i;j++)
{
p++;
if(p<a*b)
{
printf("%d\n",f[i][j]);
}
else
{
printf("%d",f[i][j]);
break;
}
}
if(p==a*b)
break;
for(k=i+1;k<a-i;k++)
{
p++;
if(p<a*b)
{
printf("%d\n",f[k][b-1-i]);
}
else
{
printf("%d",f[k][b-1-i]);
break;
}
}
if(p==a*b)
break;
for(l=b-2-i;l>i-1;l--)
{
p++;
if(p<a*b)
{
printf("%d\n",f[a-1-i][l]);
}
else
{
printf("%d",f[a-1-i][l]);
break;
}
}
if(p==a*b)
break;
for(m=a-2-i;m>i;m--)
{
p++;
if(p<a*b)
{
printf("%d\n",f[m][i]);
}
else
{
printf("%d",f[m][i]);
break;
}
}
if(p==a*b)
break;
}
return 0;
} |
46 | 22623 | int main()
{
int row, col, i, j, k, l, circle = 0, num = 0;
cin >> row >> col;
int a[100][100];
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
while (true)
{
for (i = circle; i < col - circle; i++)
{
cout << a[circle][i] << endl;
num++;
}
if (num == row * col) break;
for (i--, j = circle + 1; j < row - circle; j++)
{
cout << a[j][i] << endl;
num++;
}
if (num == row * col) break;
for (j--, k = i - 1; k >= circle; k--)
{
cout << a[j][k] << endl;
num++;
}
if (num == row * col) break;
for (k++, l = j - 1; l > circle; l--)
{
cout << a[l][k] << endl;
num++;
}
if (num == row * col) break;
circle++;
}
return 0;
}
|
46 | 22624 | int main()
{
int sz[100][100],m,n,row,col,e,p,k,q;
scanf("%d%d\n",&row,&col);
for (p=0;p<row;p++)
{
for (q=0;q<col;q++)
{
scanf ("%d",&sz[p][q]);
}
}
if (col<row) e=col/2+1;
else e=row/2+1;
for (k=0;k<e;k++)
{
if (k==(col-k)) break;
for (m=k,n=k;n<col-k;n++)
{
printf("%d\n",sz[m][n]);
}
if ((1+k)==(row-k)) break;
for (n=col-1-k,m=1+k;m<row-k;m++)
{
printf("%d\n",sz[m][n]);
}
if ((col-2-k)==(k-1)) break;
for (m=row-1-k,n=col-2-k;n>=k;n--)
{
printf("%d\n",sz[m][n]);
}
if ((row-2-k)==k) break;
for (n=k,m=row-2-k;m>=1+k;m--)
{
if (m<0) break;
printf("%d\n",sz[m][n]);
}
}
return 0;
} |
46 | 22625 | int main ()
{
int r,c,i,j,t,n;
t=0;
int a[100][100]={0};
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&(a[i][j]));
}
}
int c0=c,r0=r;
int i0=0,j0=0;
while(1)
{
printf("%d",a[i0][j0]);
t++;
if(t==r*c)
{
break;
}
i=i0;
for(j=j0+1;j<j0+c0;j++)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
r0--;
j--;
for(i=i+1;i<i0+r0+1;i++)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
c0--;
i--;
for(j=j-1;j>=j0;j--)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
r0--;
j++;
for(i=i-1;i>i0;i--)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
else
{
printf("\n");
}
c0--;
i0=i+1;
j0++;
}
return 0;
}
|
46 | 22626 |
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 | 22627 | int main()
{
int col,row,ROW,COL,n[100][100],i,b=0,N;
scanf("%d %d",&ROW,&COL);
N=ROW*COL;
for(row=0;row<ROW;row++){
for(col=0;col<COL;col++){
scanf("%d",&n[row][col]);
}
}
for(i=0;;i++){
if(b<N){
for(col=i,row=i;col<(COL-i);col++){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
for(col=COL-1-i,row=i+1;row<ROW-i;row++){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
for(row=ROW-1-i,col=COL-2-i;col>=i;col--){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
for(col=i,row=ROW-2-i;row>=i+1;row--){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
}else break;
}
return 0;
}
|
46 | 22628 | 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 | 22629 | int a[100][100];
int main()
{
int row,c,i,j,d,x,l,r,s,t,y;
scanf("%d%d",&row,&c);
for(i=0;i<row;i++)
{
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
}
d=1;
r=c-1;
x=0;
l=row-1;
s=1;
y=0;
t=0;
printf("%d\n",a[0][0]);
for(i=1;i<row*c;i++)
{
if(d==1)
{
if(t==r)
{
r=r-1;
d=-1;
}
}
else if(d==-1)
{
if(y==l)
{
l=l-1;
d=2;
}
}
else if(d==2)
{
if(t==x)
{
x=x+1;
d=-2;
}
}
else if(d==-2)
{
if(y==s)
{
s=s+1;
d=1;
}
}
if(d==1)
t=t+1;
else if(d==-1)
y=y+1;
else if(d==2)
t=t-1;
else if(d==-2)
y=y-1;
printf("%d\n",a[y][t]);
}
}
|
46 | 22630 | int main(int argc, char* argv[])
{
int row,col,i=0,j=0,array[100][100],n=0,t=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
i=0;
j=0;
while(1)
{
for(j=n;j<=col-1-n;j++)
{
printf("%d\n",array[i][j]);
t++;
}
j=j-1;
if(t==row*col)
{
break;
}
for(i=1+n;i<=row-1-n;i++)
{
printf("%d\n",array[i][j]);
t++;
}
i=i-1;
if(t==row*col)
{
break;
}
for(j=col-2-n;j>=n;j--)
{
printf("%d\n",array[i][j]);
t++;
}
j=j+1;
if(t==row*col)
{
break;
}
for(i=row-2-n;i>=1+n;i--)
{
printf("%d\n",array[i][j]);
t++;
}
i=i+1;
if(t==row*col)
{
break;
}
n++;
}
return 0;
} |
46 | 22631 | void main()
{
int row,col,a[100][100],i,k;
void shun(int a[][100],int x,int y);
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(k=0;k<col;k++)
{
scanf("%d",&a[i][k]);
}
}
shun(a,row,col);
}
void shun(int a[][100],int x,int y)
{
int b=0,c,d=0,e=0,sum,n=0;
sum=x*y;
while(n<=sum)
{
for(c=b;c<y;c++)
{
printf("%d\n",a[b][c]);
n=n+1;
if(n==sum)
break;
}
b=b+1;
if(n==sum)
break;
for(c=b;c<x;c++)
{
printf("%d\n",a[c][y-1]);
n=n+1;
if(n==sum)
break;
}
y=y-1;
if(n==sum)
break;
for(c=y-1;c>=d;c--)
{
printf("%d\n",a[x-1][c]);
n=n+1;
if(n==sum)
break;
}
x=x-1;
d=d+1;
if(n==sum)
break;
for(c=x-1;c>=b;c--)
{
printf("%d\n",a[c][e]);
n=n+1;
if(n==sum)
break;
}
e=e+1;
if(n==sum)
break;
}
} |
46 | 22632 | int main()
{
int array[100][100];
int row,col,i,j,k,n;
scanf("%d%d",&row,&col);
if(row>col){
n=(col+1)/2;
}
else{
n=(row+1)/2;
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&(array[i][j]));
}
}
for(k=1;k<=n;k++){
for(i=k-1,j=k-1;j<=col-k;j++){
printf("%d\n",array[i][j]);
}
for(j=col-k,i=k;i<=row-k;i++){
printf("%d\n",array[i][j]);
}
if(row-k>k-1){
for(i=row-k,j=col-k-1;j>=k-1;j--){
printf("%d\n",array[i][j]);
}
}
if(k-1<col-k){
for(j=k-1,i=row-k-1;i>=k;i--){
printf("%d\n",array[i][j]);
}
}
}
return 0;
} |
46 | 22633 | //#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 | 22634 | int main()
{
int row, col;
cin >> row >> col;
int a[row][col];
int i, j;
int t = 0; //?????t?
for ( i = 0; i < row; i++ )
for ( j = 0; j < col; j++ )
cin >> a[i][j];
while ( (row > 2 * t) && (col > 2 * t) )
{
for ( i = t; i <= col - t - 1; i++ )
cout << a[t][i] << endl; //????
for ( i = t + 1; i <= row - t - 1; i++ )
cout << a[i][col - t - 1] << endl; //????
if ( col == 2 * t + 1 || row == 2 * t + 1) break;
for ( i = col - t - 2; i >= t + 1; i-- )
cout << a[row - t - 1][i] << endl; //????
for ( i = row - t - 1; i >= t + 1; i-- )
cout << a[i][t] << endl; //????
t++;
}
return 0;
} |
46 | 22635 |
int main ()
{
int mat[100][100];
int i,j,row,col;
int m=0,n=0;
int count=0;
scanf("%d%d",&row,&col);
for(i=0;i<100;i++)
for(j=0;j<100;j++)
mat[i][j]=-1;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&mat[i][j]);
for(;;)
{
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
n++;
if(mat[m][n]==-1)
{
n--;
m++;
break;
}
}
if(count>=row*col)break;
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
m++;
if(mat[m][n]==-1)
{
m--;
n--;
break;
}
}
if(count>=row*col)break;
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
n--;
if(mat[m][n]==-1)
{
n++;
m--;
break;
}
}
if(count>=row*col)break;
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
m--;
if(mat[m][n]==-1)
{
m++;
n++;
break;
}
}
if(count>=row*col)break;
}
return 0;
} |
46 | 22636 |
int main() {
int row ,col,a[100][100];
int i,j,k;
int n=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i=i+1){
for(j=0;j<col;j=j+1){
scanf("%d",&a[i][j]);
}
}
for(k=0;k<=100;k=k+1){
for(i=k;i<col-k;i=i+1){
if(n!=row*col){
printf("%d\n",a[k][i]);
n=n+1;
}
}
for(i=k+1;i<row-k;i=i+1){ if(n!=row*col){
printf("%d\n",a[i][col-1-k]);
n=n+1;}
}
for(i=col-2-k;i>=k;i=i-1){ if(n!=row*col){
printf("%d\n",a[row-1-k][i]);
n=n+1;}
}
for(i=row-2-k;i>=1+k;i=i-1){ if(n!=row*col){
printf("%d\n",a[i][k]);
n=n+1;}
}
}
return 0;
} |
46 | 22637 | int main(){
int row,col,array[100][100],i,j,t[100][100],n,a;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
t[i][j]=1;
}
}
i=0;
j=-1;
a=0;
for(n=0;a<row*col;n++){
if(n%4==0){
for(j=j+1;j<col&&t[i][j]==1;j++){
printf("%d\n",array[i][j]);
a++;
t[i][j]=0;
}
j--;
}else if(n%4==1){
for(i=i+1;i<row&&t[i][j]==1;i++){
printf("%d\n",array[i][j]);
a++;
t[i][j]=0;
}
i--;
}else if(n%4==2){
for(j=j-1;j>=0&&t[i][j]==1;j--){
printf("%d\n",array[i][j]);
a++;
t[i][j]=0;
}
j++;
}else if(n%4==3){
for(i=i-1;i>=0&&t[i][j]==1;i--){
printf("%d\n",array[i][j]);
a++;
t[i][j]=0;
}
i++;
}
}
return 0;
}
|
46 | 22638 | int main(int argc, char* argv[])
{
int array[100][100];
int n,row,col,i,j,k=0,r,t,x=0;
float m;
scanf("%d",&row);
scanf("%d",&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
if(row>col)
{
n=col;
}
else n=row;
m=(float)n;
while(k<m/2)
{
for(j=k;j<col-k;j++)
{
if(x!=row*col)
{
printf("%d\n",array[k][j]);
x++;
}
}
for(i=k+1;i<row-1-k;i++)
{
if(x!=row*col)
{
printf("%d\n",array[i][col-k-1]);
x++;
}
}
for(t=col-k-1;t>k;t--)
{
if(x!=row*col)
{
printf("%d\n",array[row-k-1][t]);
x++;
}
}
for(r=row-1-k;r>k;r--)
{
if(x!=row*col)
{
printf("%d\n",array[r][k]);
x++;
}
}
k++;
}
return 0;
}
|
46 | 22639 | int arr[100][100] = {0};
int pos[120][120] = {0};
int rr, cc;
void bianli(int, int, int, int);
int main()
{
int i, j;
cin >> rr;
cin >> cc;
for(i = 0; i < rr; i ++)
{
for (j = 0; j < cc; j ++)
{
cin >> arr[i][j];
pos[i][j] = 1;
}
}
bianli(0, 0, 0, 1);
return 0;
}
//0 ??? 1 ???
void bianli(int k, int ii, int jj, int s)
{
if(pos[ii][jj] == 0)
{
return;
}
int i, j;
//??
if(k == 0)
{
//??
if(s == 0)
{
for (j = jj; j >= 0; j --)
{
if(pos[ii][j] == 1)
{
cout << arr[ii][j] << endl;
pos[ii][j] = 0;
}
else
{
bianli(1, ii - 1, j + 1, 0);
return;
}
}
bianli(1, ii - 1, 0, 0);
return;
}
//??
else
{
for (j = jj; j < cc; j ++)
{
if(pos[ii][j] == 1)
{
cout << arr[ii][j] << endl;
pos[ii][j] = 0;
}
else
{
bianli(1, ii + 1, j - 1, 1);
return;
}
}
bianli(1, ii + 1, cc - 1, 1);
return;
}
}
//??
else
{
//??
if(s == 0)
{
for (i = ii; i >= 0; i --)
{
if(pos[i][jj] == 1)
{
cout << arr[i][jj] << endl;
pos[i][jj] = 0;
}
else
{
bianli(0, i + 1, jj + 1, 1);
return;
}
}
bianli(0, 0, jj + 1, 1);
return;
}
//??
else
{
for (i = ii; i < rr; i ++)
{
if(pos[i][jj] == 1)
{
cout << arr[i][jj] << endl;
pos[i][jj] = 0;
}
else
{
bianli(0, i - 1, jj - 1, 0);
return;
}
}
bianli(0, rr - 1, jj - 1, 0);
return;
}
}
return;
} |
46 | 22640 | int main(){
int a[100][100];
int row,col,i,j,x=0,y;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
int sum=0;
i=0;
while(sum<(row*col)){
for(j=x;j<col;j++){
printf("%d\n",a[i][j]);
sum++;
a[i][j]=-1;
y=j;
if(a[i][j+1]==-1){
break;
}
}
if(sum==row*col){
break;
}
for(i=i+1;i<row;i++){
printf("%d\n",a[i][y]);
sum++;
a[i][y]=-1;
x=i;
if(a[i+1][y]==-1){
break;
}
}
if(sum==row*col){
break;
}
for(j=y-1;j>=0;j--){
printf("%d\n",a[x][j]);
sum++;
a[x][j]=-1;
y=j;
if(a[x][j-1]==-1){
break;
}
}
if(sum==row*col){
break;
}
for(i=x-1;i>0;i--){
printf("%d\n",a[i][y]);
sum++;
a[i][y]=-1;
x=i;
if(a[i-1][y]==-1){
break;
}
}
if(sum==row*col){
break;
}
}
return 0;
}
|
46 | 22641 | int main(){
int visit[105][105];
int num[105][105];
int i,j,row,col;
scanf("%d %d",&row,&col);
for(i = 0; i < row; i++){
for(j = 0; j < col; j++){
visit[i][j] = 0;
scanf("%d",&num[i][j]);
}
}
int direct = right;
int x = 0,y = 0;
while(1){
if(x < 0||x >= row||y < 0||y >= col||visit[x][y] == 1){break;}
visit[x][y] = 1;
printf("%d\n",num[x][y]);
switch(direct){ //???????????????
case up: //???????????????
if(x - 1 < 0||visit[x - 1][y] == 1){
direct = (direct + 1) % 4;
}
break;
case down:
if(x + 1 >= row||visit[x + 1][y] == 1){
direct = (direct + 1) % 4;
}
break;
case left:
if(y - 1 < 0||visit[x][y - 1] == 1){
direct = (direct + 1) % 4;
}
break;
case right:
if(y + 1 >= col||visit[x][y + 1] == 1){
direct = (direct + 1) % 4;
}
break;
default:break;
}
switch(direct){
case up:x--;break;
case down:x++;break;
case left:y--;break;
case right:y++;break;
default:break;
}
}
return 0;
} |
46 | 22642 | int main(){
int sz[100][100],sc[10000];
int m,n,i,j,a,t,k;
scanf("%d%d",&m,&n);
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
scanf("%d",&sz[i][j]);
}
}
j=1;
for(k=1;k<=n-n/2;k++){
for(i=k;i<=n-k+1;i++){
sc[j]=sz[k][i];
j++;
}
for(i=k;i<=m-k;i++){
sc[j]=sz[i+1][n-k+1];
j++;
}
for(i=n-k;i>=k;i--){
sc[j]=sz[m-k+1][i];
j++;
}
for(i=m-k;i>=k+1;i--){
sc[j]=sz[i][k];
j++;
}
}
for(i=1;i<=m*n;i++){
printf("%d\n",sc[i]);
}
return 0;
} |
46 | 22643 | int main(){
int i,j,k,sz[h][h],max,row,col,e,t;
int m,l;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++)
scanf("%d",&sz[i][j]);
}
if(row==1||col==1){
for(i=1;i<=row;i++){
for(j=1;j<=col;j++)
printf("%d\n",sz[i][j]);
} }else{
if(row%2!=0&&col%2!=0){
if(col>row){
t=(row+1)/2;
}else if(row>=col){
t=(col+1)/2;
}
max=t;
}else{
if(col>row){
e=row/2;
}
else if(row>=col){
e=col/2;
}
max=e;
}
for(k=1;k<=max;k++){
for(j=k;j<=col-k;j++)
printf("%d\n",sz[k][j]);
for(i=k;i<=row-k;i++)
printf("%d\n",sz[i][col-k+1]);
for(j=col-k+1;j>=k+1;j--)
printf("%d\n",sz[row+1-k][j]);
for(i=row-k+1;i>=k+1;i--)
printf("%d\n",sz[i][k]);
m=k;
}
if(row%2!=0&&col%2==0){
for(l=m+1;l<=(col-m);l++){
printf("%d\n",sz[(row+1)/2][l]);
}
}
else if(row%2==0&&col%2!=0){
for(l=m+1;l<=(row-m);l++){
printf("%d\n",sz[l][(col+1)/2]);
}
}
else if(row%2!=0&&col%2!=0){
printf("%d\n",sz[(row+1)/2][(col+1)/2]);
}
}
return 0;
} |
46 | 22644 | /*
* 1104-1.cpp
*
* Created on: 2011-11-5
* Author: Administrator
*/
int main(){
int row,col;
cin>>row>>col;
int a[row][col];
int i,j,k,m,s=0;
m=row*col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>a[i][j];
for(i=0;i<row/2;i++){
for(j=i;j<col-i-1;j++){
if(s>=m)
break;
else{
cout<<a[i][j]<<endl;
s++;}
}
for(k=i;k<row-i-1;k++){
if(s>=m)
break;
else{
cout<<a[k][col-i-1]<<endl;
s++;}
}
for(j=col-i-1;j>i;j--){
if(s>=m)
break;
else{
cout<<a[row-1-i][j]<<endl;
s++;}
}
for(k=row-i-1;k>i;k--){
if(s>=m)
break;
else{
cout<<a[k][i]<<endl;
s++;}
}
}
if(row%2){
for(j=row/2;j<col-row/2;j++)
cout<<a[row/2][j]<<endl;
}
return 0;
}
|
46 | 22645 | int main()
{
int m,n,time=0;
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];
}
for(int i=0;;i++)
{
for(int j=i;j<=n-1-i;j++)
{
cout<<a[i][j]<<endl;
time++;
}
if(time==m*n)break;
for(int j=i+1;j<=m-1-i;j++)
{
cout<<a[j][n-i-1]<<endl;
time++;
}
if(time==m*n)break;
for(int j=n-i-2;j>=i;j--)
{
cout<<a[m-i-1][j]<<endl;
time++;
}
if(time==m*n)break;
for(int j=m-i-2;j>=i+1;j--)
{
cout<<a[j][i]<<endl;
time++;
}
if(time==m*n)break;
}
return 0;
}
|
46 | 22646 | void main()
{
int i,j,t,a[100][100],m,n;
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,j=0;i<(m/2+m%2)&&j<(n/2+n%2);i++,j++)
{
for(t=j;t<n-j;t++)printf("%d\n",a[i][t]);
for(t=i+1;t<m-i;t++)printf("%d\n",a[t][n-j-1]);
if(i<m/2)for(t=n-j-2;t>=j;t--)printf("%d\n",a[m-i-1][t]);
if(j<n/2)for(t=m-i-2;t>=i+1;t--)printf("%d\n",a[t][j]);
}
}
//??????????rp??
|
46 | 22647 | 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 | 22648 | void main()
{
int r,c,i,j,a[100][100],n,t=0;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
for(n=0;;n++)
{
for(j=n;j<c-n;j++,t++)
printf("%d\n",a[n][j]);
if(t>=r*c)break;
for(i=n+1;i<r-n;i++,t++)
printf("%d\n",a[i][c-1-n]);
if(t>=r*c)break;
for(j=c-2-n;j>=n;j--,t++)
printf("%d\n",a[r-n-1][j]);
if(t>=r*c)break;
for(i=r-2-n;i>n;i--,t++)
printf("%d\n",a[i][n]);
if(t>=r*c)break;
}
} |
46 | 22649 | //**********************************
//* ????homework_10.cpp *
//* ??????1200012884 *
//* ?????2012?10?31? *
//* ????????????? *
//**********************************
int main()
{
int a[101][101];
int row, col, i, j, count = 0, time;
cin >> row >> col;
for (i = 0;i < row;i++)
for (j = 0;j < col;j++)
cin >> a[i][j];
i = -1;
j = -1;
time = row * col;
for (;;)
{
i++;
for (j += 1;j < col;j++)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
j--;
for (i += 1;i < row;i++)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
i--;
for (j -= 1;j >= count;j--)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
j++;
count++;
for (i -= 1;i >= count;i--)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
row--;
col--;
}
return 0;
}
|
46 | 22650 | int main()
{
int a[100][100]={0},i,j,row,col,p,sum=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
for(p=0;;p++){
for(j=p;j<=col-p-1;j++){
printf("%d\n",a[p][j]);
sum=sum+1;
}
if(sum==row*col)
break;
for(i=p+1;i<=row-p-1;i++){
printf("%d\n",a[i][col-p-1]);
sum=sum+1;
}
if(sum==row*col)
break;
for(j=col-p-2;j>=p;j--){
printf("%d\n",a[row-p-1][j]);
sum=sum+1;
}
if(sum==row*col)
break;
for(i=row-p-2;i>=p+1;i--){
printf("%d\n",a[i][p]);
sum=sum+1;
}
if(sum==row*col)
break;
}
return 0;
} |
46 | 22651 | int mat[102][102];
int unvis[102][102];
int main()
{
int n,r,c,i,j,d;
int dir[4][2] ={{0,1},{1,0},{0,-1},{-1,0}};
scanf("%d%d",&r,&c);
for(i = 0;i < r ;i ++)
for(j = 0; j < c; j++)
{
scanf("%d",&mat[i][j]);
unvis[i][j] = 1;
}
n = r * c;
r = 0;
c = 0;
d = 0;
while(n)
{
unvis[r][c] = 0;
printf("%d\n",mat[r][c]);
i = r + dir[d][0];
j = c + dir[d][1];
if(i >=0 && j>=0 && unvis[i][j])
{
r = i;
c = j;
}
else
{
d = (d + 1) % 4;
r = r + dir[d][0];
c = c + dir[d][1];
}
n--;
}
return 0;
} |
46 | 22652 | //****************************************
//*???
//*????? 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 | 22653 | int main()
{
int i,j,n,m,k,q,p;
int a[100][100];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
}
for(i=0;i<((n+1)/2);i++)
{
for(j=i;j<m-i;j++)
printf("%d\n",a[i][j]);
for(k=i+1;k<(n-i)&&i<(m-i);k++)
printf("%d\n",a[k][m-1-i]);
for(p=(m-i-2);p>=i&&(i+1)<(n-i);p--)
printf("%d\n",a[n-i-1][p]);
for(q=n-i-2;q>i&&(m-i-2)>=i;q--)
printf("%d\n",a[q][i]);
}
return 0;
}
|
46 | 22654 | void main()
{
int a[100][100],i,j,k;
int x,y,row,col;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}
}
x=0; y=row*col;
for(k=0;;k++){
for(j=1+k;j<=(col-k);j++)
{
printf("%d\n",a[1+k][j]);
x++;
if(x==y) break;
}
if(x==y) break;
for(i=2+k;i<=(row-k);i++)
{
printf("%d\n",a[i][col-k]);//??
x++;
if(x==y) break;
}
if(x==y) break;
for(j=(col-1-k);j>k;)
{
printf("%d\n",a[row-k][j]);//??
j=j-1;
x++;
if(x==y) break;
}
if(x==y) break;
for(i=(row-1-k);i>(1+k);)
{
printf("%d\n",a[i][1+k]);//??
i=i-1;
x++;
if(x==y) break;
}
if(x==y) break;
}
}
|
46 | 22655 | 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 | 22656 | int main(){
int a[100][100]={0},row,col,num=0;
cin>>row>>col;
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
cin>>a[i][j];
}
}
for(int i=0;;i++){
if(num>=row*col)break;
int b,x,y,z;
for(b=i;b<col-i;b++){
cout<<a[i][b]<<endl;
num++;
}
if(num>=row*col)break;
for(x=i+1;x<row-i;x++){
cout<<a[x][b-1]<<endl;
num++;
}
if(num>=row*col)break;
for(y=col-i-2;y>=i;y--){
cout<<a[row-i-1][y]<<endl;
num++;
}
if(num>=row*col)break;
for(z=row-i-2;z>i;z--){
cout<<a[z][i]<<endl;
num++;
}
}
return 0;
} |
46 | 22657 | //***********************************
//* ???????? *
//* ?????? *
//* ?????2011?11?5? *
//***********************************
int main()
{
int array[100][100];
int row, col, i, j, p, count;
cin >> row >> col;//???????
for(i = 0; i < row; i ++)
{
for(j = 0; j < col; j ++)
{
cin >> array[i][j];//??????
}
}
p = 0;//p???????????
count = 0;//count?????????
i = 0;
j = 0;
while(1)
{
for(j = count; j < col - count; j ++)
{
cout << array[i][j] << endl;
p = p + 1;
}//??????
if(p == row * col)
break;
for(i = count + 1; i < row - count; i ++)
{
cout << array[i][j - 1] << endl;
p = p + 1;
}//??????
if(p == row * col)
break;
for(j = col - count - 2; j >= count; j --)
{
cout << array[i - 1][j] << endl;
p = p + 1;
}//??????
if(p == row * col)
break;
for(i = row - count - 2; i > count; i --)
{
cout << array[i][j + 1] << endl;
p = p + 1;
}//??????
i = i + 1;
if(p == row * col)
break;//??????????????,??
count = count + 1;
}
return 0;
} |
46 | 22658 | int main ()
{
int s[100][100];
int row,col;
int n=0,m=0,k;
int a=0,b=1;
int i,j;
scanf ("%d %d", &row, &col);
for (i=0;i<=row-1;i++)
{
for (j=0;j<=col-1;j++)
{
scanf ("%d", &s[i][j]);
}
}
k=row*col;
for (i=1;i<=k;i++)
{
printf ("%d\n", s[n][m]);
if (n==b-1 && m<col-1)
{
m=m+1;
}
else if (n<row-1 && m==col-1)
{
n=n+1;
}
else if (n==row-1 && m==col-1)
{
m=m-1;
}
else if (n==row-1 && m<col-1 && m>a)
{
m=m-1;
}
else if (n==row-1 && m==a)
{
n=n-1;
}
else if (n<row-1 && m==a && b<n)
{
n=n-1;
}
else if (n==b && m==a)
{
m=m+1;
a=a+1;
b=b+1;
row=row-1;
col=col-1;
}
}
return 0;
}
|
46 | 22659 | 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;}
}
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 | 22660 | int main (){
int n,m,a=0,b=0,c,d=0,e=0;
int sz[100][100],i,j;
scanf("%d %d",&n,&m);
c=n*m;
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&sz[i][j]);
}
}
while(d<c){
for(b=b;b<m-e;b++){
printf("%d\n",sz[a][b]);
d++;
}
if(d>=c){
break;
}
b=b-1;
for(a=a+1;a<n-e;a++){
printf("%d\n",sz[a][b]);
d++;
}
if(d>=c){
break;
}
a=a-1;
for(b=b-1;b>=e;b--){
printf("%d\n",sz[a][b]);
d++;
}
if(d>=c){
break;
}
b=b+1;
for(a=a-1;a>=e+1;a--){
printf("%d\n",sz[a][b]);
d++;
}
if(d>=c){
break;
}
a=a+1;
b=b+1;
e++;
}
return 0;
}
|
46 | 22661 | // ????????
int main()
{
int m,n;
cin>>m>>n;
int a[m+1][n+1];
for (int i=1;i<=m;i++)
{
for (int j=1;j<=n;j++)
cin>>a[i][j];
}
int min;
if (m>=n) min=n;
else min=m;
for (int i=1;i<=(1+min)/2;i++)
{
for (int j=i;j<=n+1-i;j++)
{
if (a[i][j]!=-1)
{
cout<<a[i][j]<<endl;
a[i][j]=-1;
}
}
for (int j=i+1;j<=m+1-i;j++)
{
if (a[j][n+1-i]!=-1)
{
cout<<a[j][n+1-i]<<endl;
a[j][n+1-i]=-1;
}
}
for (int j=n-i;j>i;j--)
{
if (a[m+1-i][j]!=-1)
{
cout<<a[m+1-i][j]<<endl;
a[m+1-i][j]=-1;
}
}
for (int j=m+1-i;j>i;j--)
{
if (a[j][i]!=-1)
{
cout<<a[j][i]<<endl;
a[j][i]=-1;
}
}
}
return 0;
} |
46 | 22662 | int main()
{
int row=0,col=0;
cin>>row>>col;
int array[101][101];
int i=0,j=0,k=0;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j];
for(k=0;(row-2*k>2)&&(col-2*k>2);k++){
for(j=k;j<col-k;j++)
cout<<array[k][j ]<<endl;
for(i=k+1;i<row-k;i++)
cout<<array[i][col-1-k]<<endl;
for(j=col-2-k;j>=k;j--)
cout<<array[row-1-k][j]<<endl;
for(i=row-2-k;i>=k+1;i--)
cout<<array[i][k]<<endl;
}
if(row==col){
for(j=k;j<col-k;j++)
cout<<array[k][j ]<<endl;
for(i=k+1;i<row-k;i++)
cout<<array[i][col-1-k]<<endl;
for(j=col-2-k;j>=k;j--)
cout<<array[row-1-k][j]<<endl;
for(i=row-2-k;i>=k+1;i--)
cout<<array[i][k]<<endl;
}
else{
for(j=k;j<col-k;j++)
cout<<array[k][j ]<<endl;
for(i=k+1;i<row-k;i++)
cout<<array[i][col-1-k]<<endl;
}
return 0;
}
|
46 | 22663 | /*
* 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 | 22664 | int main()
{int sz[100][100];
int hang,lie;
scanf("%d %d",&hang,&lie);
for(int a=0;a<hang;a++){
for(int b=0;b<lie;b++){
scanf("%d",&sz[a][b]);
}
}
int c,d,e,f;
int hs=0,ls=0;
int hz=hang-1,lz=lie-1;
while(hs<=hz&&ls<=lz)
{if(hs!=hz&&lz!=ls)
{for(c=ls;c<=lz-1;c++){
printf("%d\n",sz[hs][c]);
}
for(d=hs;d<=hz-1;d++){
printf("%d\n",sz[d][lz]);
}
for(e=lz;e>=ls+1;e--){
printf("%d\n",sz[hz][e]);
}
for(f=hz;f>=hs+1;f--){
printf("%d\n",sz[f][ls]);
}}
else{for(int m=hs;m<=hz;m++){
for(int n=ls;n<=lz;n++){
printf("%d\n",sz[m][n]);
}
}}
hs++;
ls++;
hz--;
lz--;
}
return 0;
} |
46 | 22665 | void main()
{
int row,col,a[100][100],b[100][100],time=0;
int i,j,way;
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<100;i++)
for(j=0;j<100;j++)
b[i][j]=1;
i=-1;
j=-1;
way=0;
while(time<row*col)
{
if(way==0)
{
for(i=i+1,j=j+1;j<col&&b[i][j]!=0;j++)
{printf("%d\n",a[i][j]);
b[i][j]=0;
time++;
}
way=1;
}
if(way==1)
{
for(j=j-1,i=i+1;(b[i][j]!=0)&&(i<row);i++)
{
printf("%d\n",a[i][j]);
b[i][j]=0;
time++;
}
way=2;
}
if(way==2)
{
for(i=i-1,j=j-1;b[i][j]!=0&&j>=0;j--)
{
printf("%d\n",a[i][j]);
b[i][j]=0;
time++;
}
way=3;
}
if(way==3)
{
for(i=i-1,j=j+1;b[i][j]!=0&&i>=0;i--)
{
printf("%d\n",a[i][j]);
b[i][j]=0;
time++;
}
way=0;
}
}
}
|
46 | 22666 | 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 | 22667 | 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 | 22668 | 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 | 22669 | void main()
{
int array[200][200]={0};
int r,c;
int i,j;
int k=0,l=0;
scanf("%d %d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
{
scanf("%d",&array[i][j]);
}
if (r%2==0&&c%2==0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
printf("%d\n",array[i][k]);
}
}
else if (r%2!=0&&c%2==0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
printf("%d\n",array[i][k]);
}
for(j=k;j<=c-1-k;j++)
printf("%d\n",array[r/2][j]);
}
else if (r%2==0&&c%2!=0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
{
printf("%d\n",array[i][k]);
l=k+1;
}
}
for(i=c-1-l;i<=r-1-l;i++)
printf("%d\n",array[i][c/2]);
}
else //if (r%2!=0&&c%2!=0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
{
printf("%d\n",array[i][k]);
l=k+1;
}
}
if(r>=c)
{
for(i=l;i<=r-1-l;i++)
printf("%d\n",array[i][c/2]);
}
else
{
for(j=k;j<=c-1-k;j++)
printf("%d\n",array[r/2][j]);
}
}
}
|
46 | 22670 |
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++)
{
cout << array[ n ][ i ] << endl;
time++;//??????????time?????
}
printf("\n");
if(time==row*col)break;
for (j=n+1;j<row-n;j++)
{
cout << array[ j ][col-n-1] << endl;
time++;
}
printf("\n");
if(time==row*col)break;
for (i=col-2-n;i>=n;i--)
{
cout << array[row-n-1][ i ] << endl;
time++;
}
printf("\n");
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
cout << array[ j ][ n ] << endl;
time++;
}
printf("\n");
if(time==row*col)break;
}
return 0;
} |
46 | 22671 | int main() {
int row,col;
int sz[100][100];
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int xx_row=0;
int sx_row=row-1;
int xx_col=0;
int sx_col=col-1;
while((xx_row<sx_row)&&(xx_col<sx_col)){
for(int i=xx_col;i<sx_col;i++){
printf("%d\n",sz[xx_row][i]);
}
for(int j=xx_row;j<sx_row;j++){
printf("%d\n",sz[j][sx_col]);
}
for(int k=sx_col;k>xx_col;k--){
printf("%d\n",sz[sx_row][k]);
}
for(int p=sx_row;p>xx_row;p--){
printf("%d\n",sz[p][xx_col]);
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;}
if((xx_row==sx_row)&&(xx_col!=sx_col)){
for(int i=xx_row;i<=sx_col;i++){printf("%d\n",sz[xx_row][i]);}}
if((xx_col==sx_col)&&(xx_row!=sx_row)){
for(int i=xx_col;i<=sx_row;i++){printf("%d\n",sz[i][xx_col]);}}
if((xx_row==sx_row)&&(xx_col==sx_col)){
printf("%d\n",sz[xx_row][sx_col]);}
return 0;
}
|
46 | 22672 | 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 ++;
}
for( ; i < row - 1;i ++)
{
cout << arrey[i][j] << endl;
times ++;}
if( k < col - 1 && k < row - 1 )
{
for( ;j > k; j --)
{
cout << arrey[i][j] << endl;
times ++;
}
for( ;i > k; i --)
{
cout << arrey[i][j] << endl;
times ++;
}
}
else if( k == col - 1 && col == row )
{
cout << arrey[k][k];
times++;
}
else
{
cout << arrey[i][j];
times ++;
}
if( times == all)
break;
col --;
row --;
k ++;
}while(1);
return 0;
} |
46 | 22673 | typedef struct
{
int file;
int flag;
}map;
void main()
{
map a[200][200];
int count=0,i,j,col,row;
char direction='d';
for(i=1;i<=200;i++)
{
for(j=1;j<=200;j++)
{
a[i-1][j-1].flag=0;
}
}
scanf("%d %d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j].file);
a[i][j].flag=1;
}
}
i=1;
j=1;
do
{
count++;
switch(direction)
{
case'd':
a[i][j].flag=0;
if(a[i][j+1].flag==1)
{
printf("%d\n",a[i][j].file);
j++;
}
else
{
printf("%d\n",a[i][j].file);
direction='s';
i++;
}
break;
case's':
a[i][j].flag=0;
if(a[i+1][j].flag==1)
{
printf("%d\n",a[i][j].file);
i++;
}
else
{
printf("%d\n",a[i][j].file);
direction='a';
j--;
}
break;
case'a':
a[i][j].flag=0;
if(a[i][j-1].flag==1)
{
printf("%d\n",a[i][j].file);
j--;
}
else
{
printf("%d\n",a[i][j].file);
direction='w';
i--;
}
break;
case'w':
a[i][j].flag=0;
if(a[i-1][j].flag==1)
{
printf("%d\n",a[i][j].file);
i--;
}
else
{
printf("%d\n",a[i][j].file);
direction='d';
j++;
}
break;
default:
break;
}
}while(count!=row*col);
} |
46 | 22674 | int main ()
{
int array[100][100]; //??????array
int row, col; //?????
cin >> row >> col; //?????
for ( int i = 0; i < row; i ++ ) //????
for ( int j = 0; j < col; j ++ )
cin >> array[i][j];
int startrow = 0, startcol = 0; //??????????
int sum = 0; //???????????
while (true) //?????????????
{
for ( int i = startcol; i < col-startcol; i ++ )
{cout << array[startrow][i]<<endl;sum ++;}
if ( sum == row * col ) break;
for ( int i = startrow + 1; i < row-startrow; i ++ )
{cout << array[i][col-startcol-1]<<endl;sum ++;}
if ( sum == row * col ) break;
for ( int i = col-startcol-2; i > startcol; i -- )
{cout << array[row-startrow-1][i]<<endl;sum ++;}
if ( sum == row * col ) break;
for ( int i = row-startrow-1; i > startrow; i -- )
{cout << array[i][startcol]<<endl;sum ++;}
if ( sum == row * col ) break;
startrow ++; //????????????????
startcol ++;
}
return 0;
} |
46 | 22675 | void main()
{
int a[100][100],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 k;
for(k=0;k<=row/2-1&&k<=col/2-1;k++)
{
for(j=0+k;j<col-k;j++)
{
printf("%d\n",a[k][j]);
}
for(i=1+k;i<row-k;i++)
{
printf("%d\n",a[i][col-1-k]);
}
for(j=col-2-k;j>=k;j--)
{
printf("%d\n",a[row-1-k][j]);
}
for(i=row-2-k;i>=k+1;i--)
{
printf("%d\n",a[i][k]);
}
}
if(row>col&&col%2!=0)
{
for(i=k;i<row-k;i++)
{
printf("%d\n",a[i][col/2]);
}
}
if(row<col&&row%2!=0)
{
for(j=k;j<col-k;j++)
{
printf("%d\n",a[row/2][j]);
}
}
if(row==col&&row%2!=0)
{
printf("%d",a[row/2][col/2]);
}
} |
46 | 22676 | int main(){
int m,n,sz[100][100],x,y,z,a,b,w=0,i;
scanf("%d %d",&m,&n);
for(int p=0;p<m;p++)
{
for(int q=0;q<n;q++)
{
scanf("%d",&sz[p][q]);
}
}
if(m>n)
i=n;
else
i=m;
for(x=0;x<i/2;x++)
{
for(y=0+x;y<n-1-x;y++)
{
printf("%d\n",sz[x][y]);
}
for(z=0+x;z<m-1-x;z++)
{
printf("%d\n",sz[z][y]);
}
for(a=n-1-x;a>0+x;a--){
printf("%d\n",sz[z][a]);
}
for(b=m-1-x;b>0+x;b--)
{
printf("%d\n",sz[b][a]);
}
}
if(m%2==1&&n>=m)
{
w=m/2;
for(y=w;y<=n-1-w;y++)
printf("%d\n",sz[w][y]);
}
else if(n%2==1&&m>=n)
{
w=n/2;
for(x=w;x<=m-1-w;x++)
printf("%d\n",sz[x][w]);
}
return 0;
}
|
46 | 22677 | int main(){
int a[100][100]={0},h,l,k,j;
scanf("%d%d",&h,&l);
for(k=0;k<h;k++){
for(j=0;j<l;j++)
scanf("%d",&a[k][j]);
}
int ph=0,pl=0;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;int cs=h*l;
for(int z=1;z<cs;z++){
if((ph==0||a[ph-1][pl]==0)&&a[ph][pl+1]!=0){
pl=pl+1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else if((pl==l-1||a[ph][pl+1]==0)&&a[ph+1][pl]!=0){
ph=ph+1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else if(a[ph+1][pl]==0&&pl!=0&&a[ph][pl-1]!=0){
pl=pl-1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else if((a[ph][pl-1]==0||ph==0)&&a[ph-1][pl]!=0){
ph=ph-1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else break;
}
return 0;
} |
46 | 22678 | int main()
{
int n,m;
int i,j,a,c,b;
int sz[100][100];
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
scanf("%d",&sz[i][j]);
}
}
if(m>n)
{
b=n;
}
else
{
b=m;
}
if(b%2==1)
{
c=(b+1)/2;
}
else
{
c=b/2;
}
for(a=0;a<c;a++)
{
if(a<m-a)
{
for(j=a;j<m-a;j++)
{
printf("%d\n",sz[a][j]);
}
if(1+a<n-a)
{
for(i=1+a;i<n-a;i++)
{
printf("%d\n",sz[i][m-a-1]);
}
if(m-a-2>=a)
{
for(j=m-a-2;j>=a;j--)
{
printf("%d\n",sz[n-a-1][j]);
}
if(n-a-2>a)
{
for(i=n-a-2;i>a;i--)
{
printf("%d\n",sz[i][a]);
}
}
}
}
}
}
return 0;
}
|
46 | 22679 | void main()
{
int i,j,m,n,t,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]);
for(i=0,j=0;j<n-j&&i<m-i;i++,j++)
{
for(t=j;t<n-j;t++)printf("%d\n",a[i][t]);
for(t=i+1;t<m-i;t++)printf("%d\n",a[t][n-1-j]);
if(i+1<m-i)for(t=n-j-2;t>=j;t--)printf("%d\n",a[m-i-1][t]);
if(j+1<n-j)for(t=m-i-2;t>=i+1;t--)printf("%d\n",a[t][j]);
}
}
//??????????1ms?????
|
46 | 22680 | 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 | 22681 | int main(){
int col,row,i,j,a[100][100];
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>a[i][j];
for(i=0;(row-2*i>0)&&(col-2*i>0);i++)
{for(j=i;j<col-i;j++)
cout<<a[i][j]<<endl;
for(j=i+1;j<row-i;j++)
cout<<a[j][col-i-1]<<endl;
for(j=col-i-2;j>=i&&row-2*i>1;j--)
cout<<a[row-i-1][j]<<endl;
for(j=row-i-2;j>i&&col-2*i>1;j--)
cout<<a[j][i]<<endl;
}
return 0;
} |
46 | 22682 | void main()
{
void shuru(int,int);
int row,col;
scanf("%d%d",&row,&col);
shuru(row-1,col-1);
}
void shuru(int x,int y)
{
void huixing(int (*p)[100],int,int,int);
int i,j,k,t;
int a[100][100];
int (*p)[100];
p=a;
for(i=0;i<=x;i++)
{
for(j=0;j<=y;j++)
{
scanf("%d",&a[i][j]);
}
}
if(x<y) t=x;
else t=y;
for(k=0;k<=t/2;k++)
{
huixing(p,k,x,y);
}
}
void huixing(int (*p)[100],int g,int h,int l)
{
int i,sum=0;
for(i=0;i<=l-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+g)+g+i));
sum=sum+1;
}
}
for(i=1;i<=h-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+g+i)+l-g));
sum=sum+1;
}
}
for(i=1;i<=l-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+h-g)+l-g-i));
sum=sum+1;
}
}
for(i=1;i<h-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+h-g-i)+g));
sum=sum+1;
}
}
} |
46 | 22683 | int main()
{
int i,j,row,col,state;
int sz[100][100],zt[100][100]={0};
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
state=0;
i=0;
j=0;
if(row>=2&&col>=2)
{
while(1)
{
if(zt[i][j]==1)
break;
else
{
if(state==0&&j+1<col&&zt[i][j+1]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j++;
}
else if(state==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i++;
state=1;
}
else if(state==1&&i+1<row&&zt[i+1][j]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i++;
}
else if(state==1)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j--;
state=2;
}
else if(state==2&&j-1>=0&&zt[i][j-1]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j--;
}
else if(state==2)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i--;
state=3;
}
else if(state==3&&i-1>=0&&zt[i-1][j]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i--;
}
else if(state==3)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j++;
state=0;
}
}
}
}
else if(row==1&&col==1)
{
printf("%d\n",sz[0][0]);
}
else if(row==1&&col>=2)
{
for (i=0; i<col;i++)
{
printf("%d\n",sz[0][i]);
}
}
else if(row>=2&&col==1)
{
for(i=0;i<row;i++)
{
printf("%d\n",sz[i][0]);
}
}
return 0;
} |
46 | 22684 | int main() {
int row = 0, col = 0, sumtimes = 0, i = 0, j = 0,sum=0;
cin >> row >> col;
int max = row > col ? row : col;
int a[row][col];
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
cin >> a[i][j];
while (sum<row*col) {
for (j = sumtimes / 4; j <= col - 1 - sumtimes / 4; j++) {
cout << a[i][j] << endl;
sum++;
}
if (sum==row*col)break;
sumtimes++;
for (i = sumtimes / 4 + 1; i <= row - 1 - sumtimes / 4 - 1; i++) {
cout << a[i][j - 1] << endl;
sum++;
}
if (sum==row*col)break;
sumtimes++;
for (j--; j >= sumtimes / 4; j--) {
cout << a[i][j] << endl;
sum++;
}
if (sum==row*col)break;
sumtimes++;
for (i--; i >= sumtimes / 4 + 1; i--) {
cout << a[i][j + 1] << endl;
sum++;
}
if (sum==row*col)break;
i++;
sumtimes++;
}
return 0;
}
|
46 | 22685 | 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 | 22686 |
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 | 22687 |
int main()
{
int row,col,i,j,array[100][100];
scanf("%d %d\n",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
}
}
int x_row=0,s_row=row-1,x_col=0,s_col=col-1;
while(x_row<s_row&&x_col<s_col){
for(j=x_col;j<s_col;j++){
if(x_row==0&&j==0){
printf("%d",array[x_row][j]);
}else{
printf("\n%d",array[x_row][j]);
}
}
for(i=x_row;i<s_row;i++){
printf("\n%d",array[i][s_col]);
}
for(j=s_col;j>x_col;j--){
printf("\n%d",array[s_row][j]);
}
for(i=s_row;i>x_row;i--){
printf("\n%d",array[i][x_col]);
}
x_row+=1;
s_row-=1;
x_col+=1;
s_col-=1;
}
if(row<=col&&row%2==1){
for(j=(row-1)/2;j<=col-1-(row-1)/2;j++){
if(row==1&&j==0){
printf("%d",array[(row-1)/2][j]);
}else{
printf("\n%d",array[(row-1)/2][j]);
}
}
}
if(col<row&&col%2==1){
for(i=(col-1)/2;i<=row-1-(col-1)/2;i++){
printf("\n%d",array[i][(col-1)/2]);
}
}
return 0;
} |
46 | 22688 | 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 | 22689 | 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 | 22690 | int main()
{
int array[100][100], row, col, i, j, l, k, m, t, f[100][100]={0};
cin >> row >> col;
for ( i = 0; i < row; i ++)
{
for ( j = 0; j < col; j ++)
{
cin >> array[i][j];
}
}
i = 0;
m = -1;
k = row * col;
while ( k > 0 )
{
for ( j = m + 1; j < col; j ++)
{
if ( f[i][j] == 0 )
{
cout << array[i][j] <<'\n';
k --;
f[i][j] = 1;
}
else
break;
}
for ( t = i + 1; t < row; t ++)
{
if ( f[t][j - 1] == 0 )
{
cout << array[t][j - 1] <<'\n';
k --;
f[t][j - 1] = 1;
}
else
break;
}
for ( l = j - 2; l >= 0; l --)
{
if ( f[t - 1][l] == 0 )
{
cout << array[t - 1][l] <<'\n';
k --;
f[t - 1][l] = 1;
}
else
break;
}
for ( m = t - 2; m >= 0; m --)
{
if ( f[m][l + 1] == 0 )
{
cout << array[m][l + 1] <<'\n';
k --;
f[m][l + 1] = 1;
}
else
break;
}
i ++;
}
return 0;
}
|
46 | 22691 | //*************************************************
//***???????????***
//***??????***
//***???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 | 22692 | int main()
{
int a[200][200],b[200][200];
int i,j,k,l,s;
int m,n;
for(i=0;i<200;i++)
{
for(j=0;j<200;j++)
{
b[i][j]=0;
}
}
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;
}
}
i=1;
j=1;
s=1;
for(l=0;l<m*n;l++)
{
b[i][j]=0;
printf("%d\n",a[i][j]);
if(s==1)
{
if(b[i][j+1]==1)
{
j=j+1;
}
else if(b[i][j+1]==0)
{
i=i+1;
s=2;
}
}
else if(s==2)
{
if(b[i+1][j]==1)
{
i=i+1;
}
else
{
j=j-1;
s=3;
}
}
else if(s==3)
{
if(b[i][j-1]==1)
{
j=j-1;
}
else
{
i=i-1;
s=4;
}
}
else if(s==4)
{
if(b[i-1][j]==1)
{
i=i-1;
}
else
{
j=j+1;
s=1;
}
}
}
return 0;
}
|
46 | 22693 | int main(){
int i,j,m,n,k,b,c;
scanf("%d%d",&m,&n);
int a[m][n];
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
if(m>n){
b=n;
}
else{
b=m;
}
if(b%2==0){
c=b/2;
}
else{
c=b/2+1;
}
for(k=0;k<c;k++){
for(j=k;j<n-k-1;j++){
printf("%d\n",a[k][j]);
}
for(i=k;i<m-k-1;i++){
printf("%d\n",a[i][n-k-1]);
}
if((b%2==0)||(b%2!=0&&k!=c-1)){
for(j=n-k-1;j>k;j--){
printf("%d\n",a[m-k-1][j]);
}
}
if((b%2==0)||(b%2!=0&&k!=c-1)){
for(i=m-k-1;i>k;i--){
printf("%d\n",a[i][k]);
}
}
}
if(m==n&&m%2==1){
printf("%d\n",a[c-1][c-1]);
}
if(m<n&&m%2==1){
printf("%d",a[c-1][n-c]);
}
if(m>n&&n%2==1){
printf("%d",a[m-c][c-1]);
}
scanf("%d",&n);
return 0;
}
|
46 | 22694 | int main(){
int row,col,k,i,j;
int sz[100][100];
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=0; row-k>k && col-k>k; k++) {
for (i=k,j=k; j<col-k-1; j++) {
printf("%d\n", sz[i][j]);
}
for (; i<row-k-1; i++) {
printf("%d\n", sz[i][j]);
}
if (i==k || j==k) {
printf("%d\n", sz[i][j]);
break;
}
for (; j>k; j--) {
printf("%d\n", sz[i][j]);
}
for (; i>k; i--) {
printf("%d\n", sz[i][j]);
}
}
return 0;
}
|
46 | 22695 | int main()
{
int i,h,l,j,hb=0,lb=0,lans=0,hs,ls,n=0,ans[10000],a[100][100],z=0;
scanf("%d%d",&h,&l);
for(i=0;i<h;i++)
for(j=0;j<l;j++)
scanf("%d",&a[i][j]);
hs=h-1;
ls=l-1;
while(1)
{
for(i=lb;i<=ls;i++){
ans[lans++]=a[hb][i];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
for(i=hb+1;i<=hs;i++){
ans[lans++]=a[i][ls];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
for(i=ls-1;i>=lb;i--){
ans[lans++]=a[hs][i];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
for(i=hs-1;i>=hb+1;i--){
ans[lans++]=a[i][lb];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
hb++;
hs--;
lb++;
ls--;
}
for(i=0;i<lans;i++)
printf("%d\n",ans[i]);
return 0;
}
|
46 | 22696 |
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 | 22697 | int main()
{
int hui[100][100];
int row,col;
int n,m,i;
int rowa,cola;
int T;
scanf("%d %d\n",&rowa,&cola);
if(rowa<cola){T=rowa;}else{T=cola;}
row=rowa-1;col=cola-1;
for(n=0;n<rowa;n++){
for(m=0;m<cola;m++){
scanf("%d",&hui[n][m]);
}
}
for(i=0;i<floor(T*0.5+0.5);){
for(n=i,m=i;n<row-i+1;){
if(m<col-i){
printf("%d\n",hui[n][m]);
m++;
}else{
printf("%d\n",hui[n][m]);
n++;
}
}
i++;
if(m>col/2&&n>row/2){
for(n=row-i+1,m=col-i;n>i-1;){
if(m>i-1){
printf("%d\n",hui[n][m]);
m--;
}else{
printf("%d\n",hui[n][m]);
n--;
}
}
}
}
return 0;
}
|
46 | 22698 | /*
* 1.cpp
*
* Created on: 2011-11-4
* Author: 11294
*/
int main() {
int row, col;
cin >> row >> col;
int array[row][col];
int i, j;
for (i = 0; i < row; i++) {
for (j = 0; j < col; j++) {
cin >> array[i][j];
}
}
int p = 0;
for (; !(2 * p >= col - 2 || 2 * p >= row - 2);) {
for (i = p; i <= col - 2 - p; i++) {
cout << array[p][i] << endl;
}
for (j = p; j <= row - 2 - p; j++) {
cout << array[j][col - 1 - p] << endl;
}
for (i = p; i <= col - 2 - p; i++) {
cout << array[row - 1 - p][col - i - 1] << endl;
}
for (j = p; j <= row - 2 - p; j++) {
cout << array[row - 1 - j][p] << endl;
}
p++;
}
if (col == row) {
for (i = p; i <= col - 1 - p; i++) {
cout << array[p][i] << endl;
}
if(col%2==0){
for (i = col - 1 - p; i >= p; i--) {
cout << array[p + 1][i] << endl;
}
}}
if (col > row) {
for (i = p; i <= col - 1 - p; i++) {
cout << array[p][i] << endl;
}
if(row%2==0){
for (i = col - 1 - p; i >= p; i--) {
cout << array[p + 1][i] << endl;
}
}}
if (col < row) {
for (i = p; i <= row - 1 - p; i++) {
cout << array[i][p] << endl;
}
if(col%2==0){
for ( i = row - 1 - p;i >= p; i--) {
cout << array[i][p+1] << endl;
}
}}
return 0;
}
|
46 | 22699 | /*
* 1204.cpp
*
* Created on: 2012-12-4
* Author: wangyinzhi
*/
int a[100][100],b[10000],x,y,k=0;
int cube(int c,int x,int y)
{
if(x<=0||y<=0) return 0;
for(int i=c;i<y;i++){
b[k]=a[c][i];
k++;
}
for(int j=c+1;j<x;j++){
b[k]=a[j][y-1];
k++;
}
for(int r=y-2;r>=c;r--){
b[k]=a[x-1][r];
k++;
}
for(int s=x-2;s>=c+1;s--){
b[k]=a[s][c];
k++;
}
cube(c+1,x-1,y-1);
}
int main(){
int row,col,i,j,n;
cin>>row>>col;
n=row*col;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
cin>>a[i][j];
}
}
cube(0,row,col);
for(i=0;i<n;i++){
cout<<b[i]<<endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.