label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
46 | 22700 | int main()
{
int row,col,i,j;
int ss[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&(ss[i][j]));
}
}
for(int k=0;k<(col+1)/2&&k<(row+1)/2;k++)
{
for(j=k;j<col-k;j++)
{
printf("%d\n",ss[k][j]);
}
if(k+1 >= row-k)
break;
for(i=k+1;i<row-k;i++)
{
printf("%d\n",ss[i][col-k-1]);
}
if(col-k-2 < k)
break;
for(j=col-k-2;j>=k;j--)
{
printf("%d\n",ss[row-k-1][j]);
}
if(row-k-2 < k+1)
break;
for(i=row-k-2;i>=k+1;i--)
{
printf("%d\n",ss[i][k]);
}
}
return 0;
}
|
46 | 22701 | int main()
{
int sz[100][100],i=0,j=0,row,col;
int hxx,hsx,lxx,lsx,m1,m2,m3,m4,n1,n2;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
hxx=0;hsx=row-1;lxx=0;lsx=col-1;
for(hxx=0,hsx=row-1,lxx=0,lsx=col-1;hxx<hsx&&lxx<lsx;hxx++,hsx--,lxx++,lsx--)
{
for(m1=lxx;m1<lsx;m1++)
{
printf("%d\n",sz[hxx][m1]);
}
for(m2=hxx;m2<hsx;m2++)
{
printf("%d\n",sz[m2][lsx]);
}
for(m3=lsx;m3>lxx;m3--)
{
printf("%d\n",sz[hsx][m3]);
}
for(m4=hsx;m4>hxx;m4--)
{
printf("%d\n",sz[m4][lxx]);
}
}
if(hxx==hsx)
{
for(n1=lxx;n1<=lsx;n1++)
{
printf("%d\n",sz[hxx][n1]);
}
}
else if(lxx==lsx)
{
for(n2=hxx;n2<=hsx;n2++)
{
printf("%d\n",sz[n2][lxx]);
}
}
return 0;
} |
46 | 22702 | int b[10000];
void bianli(int a[100][100],int m,int n)
{
int i,j,k=0;
int *p;
p=b;
for(i=0;k<(m+1)*(n+1);i++)
{
for(j=i;j<=n-i;j++)
{
*p=a[i][j];
p++;
k++;
}
for(j=i+1;j<=m-i;j++)
{
*p=a[j][n-i];
p++;
k++;
}
for(j=n-i-1;j>=i;j--)
{
*p=a[m-i][j];
p++;
k++;
}
for(j=m-i-1;j>i;j--)
{
*p=a[j][i];
p++;
k++;
}
}
}
void main()
{
int a[100][100];
int i,j;
int *p;
int row,col;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
bianli(a,row-1,col-1);
for(i=0;i<row*col;i++)
printf("%d\n",b[i]);
}
|
46 | 22703 | //???????????????
//?????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 | 22704 | int main() {
int row,col,xxrow,sxrow,xxcol,sxcol,i,j,sz[100][100];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
i=0;
j=0;
xxrow=0;
sxrow=row-1;
xxcol=0;
sxcol=col-1;
while(xxrow<sxrow&&xxcol<sxcol){
for(j=xxcol;j<sxcol;j++)
printf("%d\n",sz[xxrow][j]);
for(i=xxrow;i<sxrow;i++)
printf("%d\n",sz[i][sxcol]);
for(j=sxcol;j>xxrow;j--)
printf("%d\n",sz[sxrow][j]);
for(i=sxrow;i>xxrow;i--)
printf("%d\n",sz[i][xxcol]);
xxrow++;
sxrow--;
xxcol++;
sxcol--;
}
if(xxrow==sxrow||xxcol==sxcol){
if(xxrow==sxrow&&xxcol!=sxcol){
for(j=xxcol;j<=sxcol;j++)
printf("%d\n",sz[xxrow][j]);
}
if(xxrow!=sxrow&&xxcol==sxcol){
for(i=xxrow;i<=sxrow;i++)
printf("%d\n",sz[i][xxcol]);
}
if(xxrow==sxrow&&xxcol==sxcol)
printf("%d\n",sz[xxrow][xxcol]);
}
return 0;
}
|
46 | 22705 | int main()
{
int row, col, count = 0, count0;
int a[99][99];
cin >> row >> col;
for (int i =0; i < row; i++)
{
for (int j = 0; j < col; j++)
{
cin >> a[i][j];
}
}
count0 = row * col;
for (int k = 0; ;k++, col--, row--)
{
for (int i = k; i < col; i++)
{
cout << a[k][i] << endl;
count++;
if (count == count0)
break;
}
if (count == count0)
break;
for (int i = k + 1; i < row; i++)
{
cout << a[i][col - 1] << endl;
count++;
if (count == count0)
break;
}
if (count == count0)
break;
for (int i = col - 2; i >= k; i--)
{
cout << a[row - 1][i] << endl;
count++;
if (count == count0)
break;
}
if (count == count0)
break;
for (int i = row - 2; i >= k + 1; i--)
{
cout << a[i][k] << endl;
count++;
if (count == count0)
break;
}
if (count == count0)
break;
}
return 0;
} |
46 | 22706 | void main()
{
int m,n,a[100][100],i,j;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
for(j=1;j<=n/2+1||j<=m/2+1;j++)
{
for(i=j-1;i<n+1-j;i++)
printf("%d\n",a[j-1][i]);
for(i=j;i<m+1-j;i++)
printf("%d\n",a[i][n-j]);
if(j>=m+1-j)
break;
for(i=n-j-1;i>=j-1;i--)
printf("%d\n",a[m-j][i]);
if(n-j-1<j-1)
break;
for(i=m-j-1;i>=j;i--)
printf("%d\n",a[i][j-1]);
}
} |
46 | 22707 | int main(){
int row,col,xx_row,sx_row,xx_col,sx_col,a[100][100],i,j;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
xx_row=0;
sx_row=row;
xx_col=0;
sx_col=col;
while((xx_row<=sx_row)&&(xx_col<=sx_col)){
for(j=xx_col;j<sx_col;j++){
printf("%d\n",a[xx_row][j]);
}
for(i=xx_row+1;i<sx_row;i++){
printf("%d\n",a[i][sx_col-1]);
}
if(xx_row>=sx_row-1){
break;
}
if(xx_col>=sx_col-1){
break;
}
for(j=sx_col-2;j>xx_col;j--){
printf("%d\n",a[sx_row-1][j]);
}
for(i=sx_row-1;i>xx_row;i--){
printf("%d\n",a[i][xx_col]);
}
xx_row++;
xx_col++;
sx_row--;
sx_col--;
}
return 0;
} |
46 | 22708 | int main()
{
int n[ROW][COL],row,col,i,j,begin;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++) scanf("%d",&n[i][j]);
}
for(begin=0;;begin++)
{
if(begin>=(col-begin)) break;
for(i=begin,j=begin;j<(col-begin);j++) printf("%d\n",n[i][j]);
if((begin+1)>=(row-begin)) break;
else for(i=(begin+1),j=(col-begin-1);i<(row-begin);i++) printf("%d\n",n[i][j]);
if((col-begin-2)<begin) break;
else for(i=(row-begin-1),j=(col-begin-2);j>(begin-1);j--) printf("%d\n",n[i][j]);
if((row-begin-2)<(begin+1)) break;
else for(i=(row-begin-2),j=begin;i>begin;i--) printf("%d\n",n[i][j]);
}
} |
46 | 22709 | void main()
{
int row,col,i,j;
int 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]);}
for(;row>1&&col>1;)
{for(j=0;j<col;j++)
printf("%d\n",a[0][j]);
for(i=1;i<row;i++)
printf("%d\n",a[i][col-1]);
for(j=col-2;j>=0;j--)
printf("%d\n",a[row-1][j]);
for(i=row-2;i>=1;i--)
printf("%d\n",a[i][0]);
for(i=0;i<row-2;i++)
{for(j=0;j<col-2;j++)
a[i][j]=a[i+1][j+1];}
row=row-2;
col=col-2;
}
if(row==1)
{for(i=0;i<col;i++)
printf("%d\n",a[0][i]);
}
else
{for(i=0;i<row;i++)
printf("%d\n",a[i][0]);
}
} |
46 | 22710 |
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 | 22711 | void main()
{
int row=0,col=0;
int i=0,j=0,n=0,t=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 ]);
t++;
}
if(t==row*col)
break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[ j ][col-n-1]);
t++;
}
if(t==row*col)
break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][ i ]);
t++;
}
if(t==row*col)
break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[ j ][ n ]);
t++;
}
if(t==row*col)
break;
}
} |
46 | 22712 | int main()
{
int a,b,i,j,matrix[100][100];
scanf("%d%d",&a,&b);
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
scanf("%d",&matrix[i][j]);
getchar();
}
}
while(a>0&&b>0)
{
for(i=0;i<b;i++)
printf("%d\n",matrix[0][i]);
for(i=1;i<a;i++)
printf("%d\n",matrix[i][b-1]);
if(b>1&&a>1)
{
for(i=b-2;i>=0;i--)
printf("%d\n",matrix[a-1][i]);
for(i=a-2;i>=1;i--)
printf("%d\n",matrix[i][0]);
}
for(i=0;i<a-2;i++)
{
for(j=0;j<b-2;j++)
matrix[i][j]=matrix[i+1][j+1];
}
a=a-2;
b=b-2;
}
return 0;
} |
46 | 22713 | int main()
{
int n,m;
scanf("%d %d",&n,&m);
int sz[100][100];
int x=0,y;
while(x<n){
for(y=0;y<m;y++){
scanf("%d",&(sz[x][y]));
}
x++;
}
int xx_row,xx_col,sx_row,sx_col;
int i,j;
xx_row=xx_col=0;
sx_row=n-1;
sx_col=m-1;
while(xx_row<sx_row && xx_col<sx_col){
for(j=xx_col;j<sx_col;j++){
printf("%d\n",sz[xx_row][j]);
}
for(i=xx_row;i<sx_row;i++){
printf("%d\n",sz[i][sx_col]);
}
for(j=sx_col;j>xx_col;j--){
printf("%d\n",sz[sx_row][j]);
}
for(i=sx_row;i>xx_row;i--){
printf("%d\n",sz[i][xx_col]);
}
xx_row++;
xx_col++;
sx_row--;
sx_col--;
}
if(xx_row==sx_row){
for(j=xx_col;j<=sx_col;j++){
printf("%d\n",sz[sx_row][j]);
}
}else{
if(xx_col==sx_col){
for(i=xx_row;i<=sx_row;i++){
printf("%d\n",sz[i][sx_col]);
}
}
}
return 0;
}
|
46 | 22714 | int main()
{
int row,col,i,j;
cin>>row>>col;
int a[row+2][col+2];
for(i=0;i<row+2;i++) { for(j=0;j<col+2;j++) { a[i][j]=0; } }
//memset(a,0,sizeof(a));
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
}
i=1;j=1;
while(1)
{
if(a[i][j+1]!=0&&a[i][j-1]==0&&a[i-1][j]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;
j++;
continue;
}
if(a[i+1][j]!=0&&a[i-1][j]==0&&a[i][j+1]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;i++;continue;
}
if(a[i][j-1]!=0&&a[i][j+1]==0&&a[i+1][j]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;j--;continue;
}
if(a[i-1][j]!=0&&a[i+1][j]==0&&a[i][j-1]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;i--;continue;
}
else
{cout<<a[i][j]<<endl;
break;}
}
return 0;
}
|
46 | 22715 |
int main()
{
int m, n, a[100][100], visit[100][100] = {0};
int i, j;
int count = 0;
int type; //1??????????2??????????3????4???
cin >> m >> n;
for (i = 1; i <= m; i++)
for (j = 1; j <= n; j++)
cin >> a[i][j];
i = 1, j = 1, type = 1; //?(1,1)???,??????
while (count < m * n) //????????
{
cout << a[i][j] << endl;
visit[i][j] = 1;
count++;
if (type == 1) //???????????????(i,j)?
{
if (j < n && visit[i][j + 1] == 0) //???????
j++;
else //??????
{
type = 2;
i++;
}
continue;
}
if (type == 2)
{
if (i < m && visit[i + 1][j] == 0)
i++;
else
{
type = 3;
j--;
}
continue;
}
if (type == 3)
{
if (j > 1 && visit[i][j - 1] == 0)
j--;
else
{
type = 4;
i--;
}
continue;
}
if (type == 4)
{
if (i > 1 && visit[i - 1][j] == 0)
i--;
else
{
type = 1;
j++;
}
continue;
}
}
return 0;
} |
46 | 22716 | int main()
{
int row, col;
cin >> row >> col;
int matrix[100][100];
int i, j, u, v, n, s;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
cin >> matrix[i][j];
}
}
if (row > col)
{
if (col % 2 == 0)
n = col / 2;
else
n = col / 2 + 1;
}
else
{
if (row % 2 == 0)
n = row / 2;
else
n = row / 2 + 1;
}
u = 1;
v = 1;
for (s = 1; s <= n; s++)
{
cout << matrix[u][v] << endl;
for (i = 1; i <= col - 1; i++)
{
v++;
cout << matrix[u][v] << endl;
}
for (i = 1; i <= row - 1; i++)
{
u++;
cout << matrix[u][v] << endl;
}
if (row != 1)
{
for (i = 1; i <= col - 1; i++)
{
v--;
cout << matrix[u][v] << endl;
}
}
if (col != 1)
{
for (i = 1; i <= row - 2; i++)
{
u--;
cout << matrix[u][v] << endl;
}
}
v = v + 1;
col = col - 2;
row = row - 2;
}
return 0;
} |
46 | 22717 | 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 | 22718 | 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 | 22719 | int sz[100][100];
int main(){
int k,ROW,COL,row,col,time=0,m=0;
scanf("%d %d",&ROW,&COL);
for(row=0;row<ROW;row++){
for(col=0;col<COL;col++){
scanf("%d",&sz[row][col]);
}
}
for(k=0;k<100;k++){
for(col=k;col<COL-k-1;col++){
printf("%d\n",sz[k][col]);
time++;
if(time==COL*ROW){
m=1;
break;
}
}
for(row=k;row<ROW-k-1;row++){
if(m==1) break;
printf("%d\n",sz[row][COL-k-1]);
time++;
if(time==COL*ROW){
m=1;
break;
}
}
for(col=COL-k-1;col>k;col--){
if(m==1) break;
printf("%d\n",sz[ROW-k-1][col]);
time++;
if(time==COL*ROW){
m=1;
break;
}
}
for(row=ROW-k-1;row>k;row--){
if(m==1) break;
printf("%d\n",sz[row][k]);
time++;
// printf("time=%d\n",time);
if(time==COL*ROW){
m=1;
break;
}
}
if(time==COL*ROW-1){
printf("%d",sz[(ROW-1)/2][(COL-1)/2]);
break;
}
if(m==1) break;
}
return 0;
}
|
46 | 22720 | int main ()
{
int row , col ;
cin >> row >> col ;
int N = row * col ;
//???????
int array[100][100] ;
for ( int r = 0 ; r < row ; r++ )
for ( int c = 0 ; c < col ; c++ )
cin >> array[r][c] ;
//????????????
int r = 0 , c = 0 ;
int K = 0 ;
while ( 1 )//????????????
{
//????
for ( int j = c ; j <= col - 1 ; j++ )
{
cout << array[r][j] << endl ;
K++ ;
}
if ( r < row - 1 )
r++ ;//????????
if ( K == N ) break ; //??????????
//????
for ( int i = r ; i <= row - 1 ; i++ )
{
cout << array[i][col-1] << endl ;
K++ ;
}
if ( c < col - 1 )
col-- ;//?????????
if ( K == N ) break ; //??????????
//????
for ( int j = col - 1 ; j >= c ; j-- )
{
cout << array[row-1][j] << endl ;
K++ ;
}
if ( r < row - 1 )
row-- ;//?????????
if ( K == N ) break ; //??????????
//????
for ( int i = row - 1 ; i >= r ; i-- )
{
cout << array[i][c] << endl ;
K++ ;
}
if ( c < col - 1 )
c++ ;
if ( K == N ) break ; //??????????
}
return 0 ;
}
// ( > w < ) finished~ |
46 | 22721 | int main()
{
int row,col;
int i,j,n,time=0,x;
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;
}
return 0;
} |
46 | 22722 | int main(){
int row,col,t;
int jz[100][100];
t=1;
scanf("%d %d",&row,&col);
for(int f=0;f<row;f++){
for(int g=0;g<col;g++){
scanf("%d",&jz[f][g]);}
}
for(int i=0;1;i++){
if(t==row*col+1){
break;}
for(int n=i;n<col-i;n++){
if(t==row*col+1){
break;}
printf("%d\n",jz[i][n]);
t++;
}
for(int m=i+1;m<row-i;m++){
if(t==row*col+1){
break;}
printf("%d\n",jz[m][col-(i+1)]);
t++;}
for (int k=col-(i+2);k>=i;k--){
if(t==row*col+1){
break;}
printf("%d\n",jz[row-(i+1)][k]);
t++;}
for(int e=row-(i+2);e>=i+1;e--){
if(t==row*col+1){
break;}
printf("%d\n",jz[e][i]);
t++;}
}
return 0;
}
|
46 | 22723 | int u[1000][1000];
int main()
{
int row,col,i,j,sum,k,m;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&u[i][j]);
}
}
if(row>col)
{
m=col;
}
else
{
m=row;
}
for(k=0;k<m;k++)
{
for(j=k;j<col-k;j++)
{
printf("%d\n",u[k][j]);
}
if(k+1>=row-k)
{
break;
}
for(i=k+1;i<row-k;i++)
{
printf("%d\n",u[i][col-k-1]);
}
if(col-2-k<k)
{
break;
}
for(j=col-2-k;j>=k;j--)
{
printf("%d\n",u[row-k-1][j]);
}
if(row-2-k<=k)
{
break;
}
for(i=row-2-k;i>k;i--)
{
printf("%d\n",u[i][k]);
}
}
return 0;
} |
46 | 22724 | int main()
{
int row, col;
int i, j, n, time = 0;
cin >> row >> col;
int a[100][100];
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
for (n = 0; ; n++)
{
for (i = n; i < col - n; i++)
{
cout << a[n][i] << endl;
time++;
}
if (time == row * col)
break;
for (j = n + 1; j < row - n; j++)
{
cout << a[j][(col - n - 1)] << endl;
time++;
}
if (time == row * col)
break;
for (i = col - 2 - n; i >= n; i--)
{
cout << a[row - n - 1][i] << endl;
time++;
}
if (time == row * col)
break;
for (j = row - 2 - n; j > n; j--)
{
cout << a[j][n] << endl;
time++;
}
if (time == row * col)
break;
}
return 0;
} |
46 | 22725 | 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 | 22726 | 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 | 22727 |
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 | 22728 | //********************************
//*??????? **
//*????? 1300012839 **
//*???2013.11.2**
//********************************
int main()
{
int row,col,n,m,count=0; //?n????m????count??????????
int array[100][100];
cin >> n >> m;
for(row = 0;row < n;row++) //????????
{
for(col = 0;col < m;col++)
cin >> array[row][col];
}
int k;
for(k = 1;k <= n / 2 + 1;k++) //k????k?
{
for(col = k-1;col <= m - k;col++) //????????????????????????????count????????????
{
if(count == m * n)break;
cout << array[k-1][col] << endl;
count++;
}
for(row = k;row <= n - k;row++)
{
if(count == n * m)break;
cout << array[row][m-k] << endl;
count++;
}
for(col = m - k - 1;col >= k - 1;col--)
{
if(count == n * m)break;
cout << array[n-k][col] << endl;
count++;
}
for(row = n - k - 1;row >= k;row--)
{
if(count == m * n)break;
cout << array[row][k-1] << endl;
count++;
}
if(count == n * m)break;
}
return 0;
} |
46 | 22729 |
int matrix[101][101];
void transform(int , int);
int main()
{
int m, n;
int i, j;
scanf("%d%d", &m, &n);
for (i = 1; i <= m ; i++)
for (j = 1; j <= n; j++) {
scanf("%d", &matrix[i][j]);
}
transform(m, n);
return 0;
}
void transform(int m, int n)
{
int total = m * n;
int index = 0;
int dir = 0;
int x = 0, y = 0;
int times[4] = {0};
while (index < total) {
switch(dir) {
case 0:
x++;y++;
while ( y < n - times[1] ) {
printf("%d\n", matrix[x][y]);
y++;
index++;
}
break;
case 1:
while ( x < m - times[2]) {
printf("%d\n", matrix[x][y]);
x++;
index++;
}
break;
case 2:
while ( y > times[3] + 1 ) {
printf("%d\n", matrix[x][y]);
y--;
index++;
}
break;
case 3:
while ( x > times[0] ) {
printf("%d\n", matrix[x][y]);
x--;
index++;
}
break;
default:
break;
}
if (total - index == 1) {
if (dir == 3) x++, y++;
printf("%d\n", matrix[x][y]);
index++;
}
times[dir]++;
dir = (dir+1)%4;
}
}
|
46 | 22730 | int main()
{
int col,row,sz[100][100],i,j,m=0,k;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
if(col<=row)
{
for(k=1;2*k<col+1;k++)
{
for(j=k-1;j<col-k;j++)
{
printf("%d\n",sz[k-1][j]);
m++;
}
for(i=k-1;i<row-k;i++)
{
printf("%d\n",sz[i][col-k]);
m++;
}
for(j=col-k;j>k-1;j--)
{
printf("%d\n",sz[row-k][j]);
m++;
}
for(i=row-k;i>k-1;i--)
{
printf("%d\n",sz[i][k-1]);
m++;
}
}
for(i=k-1;i<row,m<row*col;i++,m++)
{
printf("%d\n",sz[i][k-1]);
}
}
else
{
for(k=1;2*k<row+1;k++)
{
for(j=k-1;j<col-k;j++)
{
printf("%d\n",sz[k-1][j]);
m++;
}
for(i=k-1;i<row-k;i++)
{
printf("%d\n",sz[i][col-k]);
m++;
}
for(j=col-k;j>k-1;j--)
{
printf("%d\n",sz[row-k][j]);
m++;
}
for(i=row-k;i>k-1;i--)
{
printf("%d\n",sz[i][k-1]);
m++;
}
}
for(j=k-1;j<col-k,m<row*col;j++,m++)
{
printf("%d\n",sz[k-1][j]);
}
}
return 0;
} |
46 | 22731 | 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 | 22732 | int main()
{
int i,j,row,col,k;
int 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]));
}
}
for(k=0;k<((col+col%2)/2);k++)
{
if(k>row-k-1)continue;
for(i=k;i<col-k;i++)
{
printf("%d\n",a[k][i]);
}
if(k+1>row-k-1)continue;
for(j=k+1;j<=row-k-1;j++)
{
printf("%d\n",a[j][col-k-1]);
}
if(col-k-2<k)continue;
for(i=col-k-2;i>=k;i--)
{
printf("%d\n",a[row-k-1][i]);
}
for(j=row-2-k;j>=k+1;j--)
{
printf("%d\n",a[j][k]);
}
}
return 0;
}
|
46 | 22733 |
int main()
{
int array[100][100], n, m, i1, i2, j1, j2, s1, s2, t, h, num = 0, k;
cin >> n >> m;
k = n * m;
if(n % 2 == 0) h = n / 2;
else h = n / 2 + 1;
for(i1 = 0; i1 < n; i1++)
for(j1 = 0; j1 < m; j1++)
cin >> array[i1][j1];
for(i1 = 0; i1 < h; i1++)
{
for(j1 = i1; j1 < m - i1; j1++)
{
if(num >= k) break;
cout << array[i1][j1] << endl;
s1 = j1;
num++;
}
for(i2 = i1 + 1; i2 < n - i1; i2++)
{
if(num >= k ) break;
cout << array[i2][s1] << endl;
t = i2;
num++;
}
for(j2 = s1 - 1; j2 >= i1; j2--)
{
if(num >= k) break;
cout << array[t][j2] << endl;
s2 = j2;
num++;
}
for(i2 = t - 1; i2 >= i1 + 1; i2--)
{
if(num >= k) break;
cout << array[i2][s2] << endl;
num++;
}
}
return 0;
}
|
46 | 22734 | 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 | 22735 | int main()
{
int n,a[100][100]={0},j,m,i,k,p;
scanf("%d %d",&n,&m);
for(j=0;j<n;j++)
{
for(i=0;i<m;i++)
{
scanf("%d",&a[j][i]);
}
}
if(m>n)
{
k=n;
}
else
{
k=m;
}
for(i=0;i<(k-1)/2;i++)
{
for(j=i;j<m-i;j++)
{
printf("%d\n",a[i][j]);
}
for(j=i+1;j<n-i;j++)
{
printf("%d\n",a[j][m-i-1]);
}
for(j=m-i-2;j>=i;j--)
{
printf("%d\n",a[n-1-i][j]);
}
for(j=n-i-2;j>i;j--)
{
printf("%d\n",a[j][i]);
}
}
if(k%2==0)
{
i=(k-1)/2;
for(j=i;j<m-i;j++)
{
printf("%d\n",a[i][j]);
}
for(j=i+1;j<n-i;j++)
{
printf("%d\n",a[j][m-i-1]);
}
for(j=m-i-2;j>=i;j--)
{
printf("%d\n",a[n-1-i][j]);
}
for(j=n-i-2;j>i;j--)
{
printf("%d\n",a[j][i]);
}
}
else
{
if(m>n)
{
i=(n-1)/2;
for(j=i;j<m-i;j++)
{
printf("%d\n",a[i][j]);
}
}
else
{
i=(m-1)/2;
for(j=i;j<n-i;j++)
{
printf("%d\n",a[j][m-i-1]);
}
}
}
return 0;
}
|
46 | 22736 |
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 | 22737 | int main(){
int a[100][100],r,c,m,n;
scanf("%d%d",&r,&c);
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
scanf("%d",&a[i][j]);
}
}
for(int k=0;r-k>k&&c-k>k;k++){
for(m=k,n=k;n<c-k-1;n++){
printf("%d\n",a[m][n]);
}
for(m=k;m<r-k-1;m++){
printf("%d\n",a[m][n]);
}
if (m==k||n==k){
printf("%d\n",a[m][n]);
break;
}
for(n=c-k-1;n>k;n--){
printf("%d\n",a[m][n]);
}
for(m=r-k-1;m>k;m--){
printf("%d\n",a[m][n]);
}
}
return 0;
} |
46 | 22738 | int main(){
int array[100][100],row,col,min,i,j,k;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
}
}
if(row<col){
min=row;
}else min=col;
for(k=0;k<min/2;k++){
for(j=k;j<col-k-1;j++){
printf("%d\n",array[k][j]);
}
for(j=k;j<row-1-k;j++){
printf("%d\n",array[j][col-1-k]);
}
for(j=col-1-k;j>k;j--){
printf("%d\n",array[row-1-k][j]);
}
for(j=row-1-k;j>k;j--){
printf("%d\n",array[j][k]);
}
}
if(min%2==1){
if(row<col){
for(i=min/2;i<(col-min/2);i++){
printf("%d\n",array[row/2][i]);
}
}
else if(row>col){
for(i=min/2;i<(row-min/2);i++){
printf("%d\n",array[i][col/2]);
}
}
else if(row==col){
printf("%d\n",array[col/2][col/2]);
}
}
return 0;
}
|
46 | 22739 | int main()
{
int a[110][110],row,col,i,j,k,l=0,s=0;;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++)scanf("%d",&a[i][j]);}
for(i=1;l<row*col;i++){
k=i%4;
if(k==1){
if(s<col-s-1)
for(j=s;j<col-s-1;j++){printf("%d\n",a[s][j]);l++; if(l==row*col)break;}
if(s==col-s-1)continue;
}
if(k==2){
if(s<row-s-1)
for(j=s;j<row-s-1;j++){printf("%d\n",a[j][col-s-1]);l++;if(l==row*col)break;}
if(s==row-s-1)continue;
}
if(k==3){
if(s<col-s-1)
for(j=col-s-1;j>s;j--){printf("%d\n",a[row-s-1][j]);l++;if(l==row*col)break;}
if(s==col-s-1)continue;
}
if(k==0){
if(s<row-s-1)
for(j=row-s-1;j>s;j--){printf("%d\n",a[j][s]);l++;if(l==row*col)break;}
if(s==row-s-1&&l==row*col-1){printf("%d\n",a[s][s]);l++;}
if(s==row-s-1&&l!=row*col-1)continue;
}
if(k==0)s++;
}
return 0;
} |
46 | 22740 | 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 | 22741 | int main()
{
int number[100][100];
int row,col,i,j,a=0,zongshu=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&number[i][j]);
}
}
for(a=0;a>=0;a++)
{
for(j=a;j<col-a;j++)
{
printf("%d\n",number[a][j]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
for(i=a+1;i<row-a;i++)
{
printf("%d\n",number[i][col-a-1]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
for(j=col-2-a;j>=a;j--)
{
printf("%d\n",number[row-a-1][j]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
for(i=row-2-a;i>a;i--)
{
printf("%d\n",number[i][a]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
}
return 0;
}
|
46 | 22742 |
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 | 22743 | int main()
{
int m,n,i,j,k,a[100][100],x1,x2,y1,y2,s=0,t=0;
scanf("%d",&m);
scanf("%d",&n);
x1=0;x2=n-1;
y1=0;y2=m-1;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
i=0;j=0;
for(k=0;k<m*n;k++)
{
printf("%d\n",a[i][j]);
if((i==y1)&&(j<x2))
{
j++;
}
else if((j==x2)&&(i<y2))
{
i++;
}
else if((i==y2)&&(j>x1))
{
j--;
}
else if((j==x1)&&(i==y1+1))
{
j++;
x1++;
x2--;
y1++;
y2--;
}
else
{
i--;
}
}
return 0;
}
|
46 | 22744 | int main()
{
int row,col,i,j,k,p,a[101][101],l,h,n;
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>a[i][j];
l=col,h=row,p=0,n=0;
while(1){
for(j=p;j<l-p;j++){
cout<<a[p][j]<<endl;
n++;
}
if(n==row*col)break;
for(i=p+1;i<h-p;i++){
cout<<a[i][l-p-1]<<endl;
n++;
}
if(n==row*col)break;
for(j=l-2-p;j>=p;j--){
cout<<a[h-p-1][j]<<endl;
n++;
}
if(n==row*col)break;
for(i=h-2-p;i>p;i--){
cout<<a[i][p]<<endl;
n++;
}
if(n==row*col)break;
p++;
}
return 0;
}
|
46 | 22745 | 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 | 22746 |
int min(int x,int y)
{
int z;
if(x<y) z=x;
else z=y;
return (z);
}
void main ()
{
int h,i,j,k,l,a,b,temp,flag1,flag2;
int f[100][100];
scanf("%d%d",&a,&b);
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
scanf("%d",&f[i][j]);
}
}
temp=min(a,b);
for(i=0;((a-2*i)>0&&(b-2*i)>0);i++)
{
flag1=0;
flag2=0;
if((a-2*i)==1) flag1=1;
if((b-2*i)==1) flag2=1;
/*first heng*/
for(j=i;j<b-i;j++)
{
printf("%d\n",f[i][j]);
}
/*first shu*/
for(j=i+1;j<a-i-1;j++)
{
printf("%d\n",f[j][b-1-i]);
}
/*second heng*/
for(j=b-1-i;j>i-1;j--)
{
if(flag1==1)break;
printf("%d\n",f[a-1-i][j]);
}
/*second shu*/
for(j=a-2-i;j>i;j--)
{
if(flag2==1)break;
printf("%d\n",f[j][i]);
}
}
}
|
46 | 22747 | int a[1000][1000];
int x=0,y=0,z=0,i=0,m=0,k=0,t=0,n=0,j=0;
int main()
{
scanf("%d %d",&x,&y);
for(i=0;i<x;i++){
for(m=0;m<y;m++){
scanf("%d",&a[i][m]);
}
}
for (n=0;;n++)
{
for (i=n;i<y-n;i++)
{
printf("%d\n",a[n][i]);
t++;
}
printf("\n");
if(t==x*y)break;
for (j=n+1;j<x-n;j++)
{
printf("%d\n",a[j][y-n-1]);
t++;
}
printf("\n");
if(t==x*y)break;
for (i=y-2-n;i>=n;i--)
{
printf("%d\n",a[x-n-1][i]);
t++;
}
printf("\n");
if(t==x*y)break;
for (j=x-2-n;j>n;j--)
{
printf("%d\n",a[j][n]);
t++;
}
printf("\n");
if(t==x*y)break;
}
return 0;
} |
46 | 22748 | int main(){
int m,n,a[100][100],i,j,s=0;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
for(int k=0;k<(m+1)/2&&k<(n+1)/2;k++){
for(j=k;j<n-k;j++){
s++;
if(s==m*n)
printf("%d",a[k][j]);
else if(s<m*n)
printf("%d\n",a[k][j]);
}
for(i=k+1;i<m-k;i++){
s++;
if(s==m*n)
printf("%d",a[i][n-k-1]);
else if(s<m*n)
printf("%d\n",a[i][n-k-1]);
}
for(j=n-k-2;j>k-1;j--){
s++;
if(s==m*n)
printf("%d",a[m-k-1][j]);
else if(s<m*n)
printf("%d\n",a[m-k-1][j]);
}
for(i=m-k-2;i>k;i--){
s++;
if(s==m*n)
printf("%d",a[i][k]);
else if(s<m*n)
printf("%d\n",a[i][k]);
}
}
return 0;
} |
46 | 22749 | int main()
{
int flag = 0;
int time = 0;
int i, j, k = 0;
int row, col;
int a[100][100];
cin >> row >> col;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
cin >> a[i][j];
}
}
for (k = 0; k <= row * col; )
{
for (j = time; j < col - time ;j++)
{
cout << a[time][j] << endl;
k ++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
for (i = 1 + time; i < row - time; i++)
{
cout << a[i][col - 1 - time] << endl;
k++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
for (j = col - 2 - time ; j > time; j--)
{
cout << a[row - 1 - time][j] << endl;
k ++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
for (i = row - 1 - time; i > time;i--)
{
cout << a[i][time] << endl;
k ++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
time ++;
}
return 0;
} |
46 | 22750 | int b[100][100];
void circle ( int array[100][100], int row, int col )
{
int i;
for ( i = 0; i < col; i ++ )
cout << array[0][i] << endl;
for ( i = 1; i < row; i ++ )
cout << array[i][col-1] << endl;
for ( i = col - 2; i >= 0; i -- )
{
if ( row > 1 )
cout << array[row-1][i] << endl;
}
for ( i = row - 2; i > 0; i -- )
{
if ( col > 1 )
cout << array[i][0] << endl;
}
}
void change ( int array[100][100], int row, int col )
{
int i, j;
for ( i = 0; i < row - 2; i ++ )
{
for ( j = 0; j < col - 2; j ++ )
{
b[i][j] = array[i+1][j+1];
}
}
}
int main ()
{
int i, j, row, col, array[100][100], k = 0;
cin >> row >> col;
for ( i = 0; i < row; i ++ )
{
for ( j = 0; j < col; j ++ )
{
cin >> array[i][j];
b[i][j] = array[i][j];
}
}
if ( row > col )
{
for ( k = 0; k < col; k = k + 2 )
{
circle( b, row - k, col - k );
change( b, row - k, col - k );
}
}
else
{
for ( k = 0; k < row; k = k + 2 )
{
circle( b, row - k, col - k );
change( b, row - k, col - k );
}
}
return 0;
}
|
46 | 22751 | 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 | 22752 | int main()
{
int n, sz[number][number], j, k, i, l, mc, a, b, go;
scanf("%d%d", &a, &b);
for(go=0;go<a;go++)
{
for(i=0;i<b;i++)
{
scanf("%d", &(sz[go][i]));
}
}
for(i=0;i<a;i++)
{
if(a<b&&a%2==0&&i*2+2>=a)
{
for(l=i;l<=b-i-1;l++)
printf("%d\n", sz[i][l]);
for(l=i+1;l<=a-i-1;l++)
printf("%d\n", sz[l][b-1-i]);
for(l=b-i-2;l>=i;l--)
printf("%d\n", sz[a-1-i][l]);
break;
}
if(a<b&&a%2!=0&&i*2+2>=a)
{
for(l=i;l<=b-i-1;l++)
printf("%d\n", sz[i][l]);
break;
}
if(a>b&&b%2!=0&&i*2+2>=b)
{
for(l=i;l<=b-i-1;l++)
printf("%d\n", sz[i][l]);
for(l=i+1;l<=a-i-1;l++)
printf("%d\n", sz[l][b-1-i]);
break;
}
for(l=i;l<=b-i-1;l++)
printf("%d\n", sz[i][l]);
for(l=i+1;l<=a-i-1;l++)
printf("%d\n", sz[l][b-1-i]);
for(l=b-i-2;l>=i;l--)
printf("%d\n", sz[a-1-i][l]);
for(l=a-i-2;l>i;l--)
printf("%d\n", sz[l][i]);
}
return 0;
} |
46 | 22753 | int shuzu[100][100];
int main (){
int line,row;
cin >> line>>row ;
for(int i=0;i<line;i++)
for(int j=0;j<row;j++)
cin >> shuzu[i][j];
/* if(shuzu[x][y-1]==-1&&shuzu[x][y+1]==-1&&shuzu[x-1][y]==-1&&shuzu[x+1][y]==-1)
return ;
*/
int a,b,sum=0,allg;
int x=0,y=row-1,i=0,j=line-1;
while(sum<(allg=row*line))
{
for(a=x;a<=y;a++)
{
cout <<shuzu[i][a]<<endl;
sum++;
if(sum==allg)
return 0;
}
i++;
for(b=i;b<=j;b++)
{
cout <<shuzu[b][y]<<endl;
sum++;
if(sum==allg)
return 0;
}
y--;
for(a=y;a>=x;a--)
{
cout <<shuzu[j][a]<<endl;
sum++;
if(sum==allg)
return 0;
}
j--;
for(b=j;b>=i;b--)
{
cout << shuzu[b][x]<<endl;
sum++;
if(sum==allg)
return 0;
}
x++;
}
return 0;
} |
46 | 22754 | int main()
{
int row,col; //row????col???
int i,j;//????
int a[100][100];// ????????
cin>>row>>col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
cin>>a[i][j];
}
int m,n,t;//m???????n??????,t?????
m=row;
n=col;
t=0;
for(t=0;(t<n-t)&&(t<m-t);t++)
{
for(i=t,j=t;j<n-t;j++)
{
cout<<a[i][j]<<endl;
}
if(j==t) break;
for(i=1+t,j=n-t-1;i<m-t;i++)
{
cout<<a[i][j]<<endl;
}
if(i==1+t) break;
for(i=m-t-1,j=n-2-t;j>=t;j--)
{
cout<<a[i][j]<<endl;
}
if(j==n-2-t) break;
for(i=m-2-t,j=t;i>=1+t;i--)
{
cout<<a[i][j]<<endl;
}
}
return 0;
}
|
46 | 22755 | int main(){
int sz[100][100];
int m,n,b=0;
int i,j,c=0;
scanf("%d%d",&m,&n);
b=m*n;
for(i=0;i<m;i++){
for(int j=0;j<n;j++)
scanf("%d",&sz[i][j]);
}
for(int h=0;;h++)
{
for(j=0+h;j<n-h;j++){
printf("%d\n",sz[h][j]);c++;}
if (b==c) break;
for(i=1+h;i<m-h;i++){
printf("%d\n",sz[i][n-1-h]);c++;}
if (b==c) break;
for(j=n-2-h;j>=0+h;j--){
printf("%d\n",sz[m-1-h][j]);c++;}
if (b==c) break;
for(i=m-2-h;i>h;i--){
printf("%d\n",sz[i][h]);c++;}
if (b==c) break;
}
return 0;
} |
46 | 22756 | void main()
{
int array[100][100],row,col,n,count=0,i,j,k,*p;
scanf("%d%d",&row,&col);
n=row*col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
for(k=0;;k++)
{
for(p=array[k]+k;p<array[k]+col-k-1;p++)
{
printf("%d\n",*p);
count++;
}
if(count==n)
break;
for(i=k;i<row-k;i++)
{
printf("%d\n",*(*(array+i)+col-k-1));
count++;
}
if(count==n)
break;
for(i=col-k-2;i>=k;i--)
{
printf("%d\n",*(*(array+row-k-1)+i));
count++;
}
if(count==n)
break;
for(i=row-k-2;i>k;i--)
{
printf("%d\n",*(*(array+i)+k));
count++;
}
if(count==n)
break;
}
}
|
46 | 22757 | int main ()
{
int row, col, a[105][105],i, j, k, min;
cin >> row >> col;
for (i = 0; i < row; i ++ )
{
for (j = 0; j < col; j ++)
{
cin >> a[i][j];
}
}
if (row < col)
min = row;
else
min = col;
if (min % 2 == 0)
min = min / 2;
else
min = min / 2 + 1;
for (k = 0; k < min; k ++)
{
for (j = k; j < col - k; j ++)
{
cout << a[k][j] << endl;
}
for (i = k + 1; i < row - k ; i ++)
{
cout << a [i][col - k -1] << endl;
}
for (j = col - 2 - k; j >= k && (row - k - 1 > k); j --)
{
cout << a [row - k - 1][j] << endl;
}
for (i = row - 2 - k; i >= 1 + k && (col - k - 1 > k); i -- )
{
cout << a [i][k] << endl;
}
}
return 0;
} |
46 | 22758 |
int main(int argc, char *argv[])
{
int i,j,x,y,z;
int a[100][100],b[100][100]={0};
scanf("%d%d",&x,&y);
for(i=0;i<x;i++)
{
for(j=0;j<y;j++)
scanf("%d",&a[i][j]);
}
while(x>0)
{
for(j=0;j<y;j++)
printf("%d\n",a[0][j]);
for(i=0;i<y;i++)
{
for(j=0;j<x;j++)
b[i][j]=a[j+1][y-1-i];
}
for(i=0;i<y;i++)
{
for(j=0;j<x;j++)
a[i][j]=b[i][j];
}
z=x;
x=y;
y=z-1;
}
return 0;
}
|
46 | 22759 | int main()
{
int a[101][101],i,j;
int b[101][101]={1};
int col,row;
int x=0,y=0;
scanf("%d %d",&row,&col);
for(i=0;i<row;++i)
for(j=0;j<col;++j)
scanf("%d",a[i]+j);
printf("%d\n",a[0][0]);
while(1)
{
if(b[x][++y]!=0)
break;
while((b[x][y]==0) && (y<col))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
++y;
}
--y;
if(b[++x][y]!=0)
break;
while((b[x][y]==0) && (x<row))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
++x;
}
--x;
if(b[x][--y]!=0)
break;
while((b[x][y]==0) && (y>=0))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
--y;
}
++y;
if(b[--x][y]!=0)
break;
while((b[x][y]==0) && (x>=0))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
--x;
}
++x;
}
return 0;
}
|
46 | 22760 | int main()
{
int a[100][100];
int flag[100][100] = {0};
int i, j, row, col;
int count = 0;
cin >> row >> col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
{
cin >> a[i][j];
}
int hang1 = 0;
int hang2 = row - 1;
int lie1 = col - 1;
int lie2 = 0;
while (count < row * col)
{
for (j = 0; j < col; j++)
{
if (flag[hang1][j] == 0)
{
cout << a[hang1][j] << endl;
count++;
flag[hang1][j] = 1;
}
}
hang1++;
for (i = 0; i < row; i++)
{
if (flag[i][lie1] == 0)
{
cout << a[i][lie1] << endl;
count++;
flag[i][lie1] = 1;
}
}
lie1--;
for (j = col - 1; j >= 0; j--)
{
if (flag[hang2][j] == 0)
{
cout << a[hang2][j] << endl;
count++;
flag[hang2][j] = 1;
}
}
hang2--;
for (i = row - 1; i >= 0; i--)
{
if (flag[i][lie2] == 0)
{
cout << a[i][lie2] << endl;
count++;
flag[i][lie2] = 1;
}
}
lie2++;
}
return 0;
}
|
46 | 22761 | int main(){
int row,cow;
scanf("%d%d",&row,&cow);
int array[row][cow];
for(int i=0;i<row;i++){
for(int k=0;k<cow;k++){
scanf("%d",&array[i][k]);
}
}
int time=0;
for(int i=0;i<100;i++){
for(int m=i;m<cow-i;m++){
printf("%d\n",array[i][m]);
time++;
}
if(time==row*cow){
break;
}
for(int n=i+1;n<row-i;n++){
printf("%d\n",array[n][cow-i-1]);
time++;
}
if(time==row*cow){
break;
}
for(int j=cow-2-i;j>=i;j--){
printf("%d\n",array[row-i-1][j]);
time++;
}
if(time==row*cow){
break;
}
for(int l=row-2-i;l>=i+1;l--){
printf("%d\n",array[l][i]);
time++;
}
if(time==row*cow){
break;
}
}
return 0;
}
|
46 | 22762 | main()
{
int a[100][100];
int row,col,i,j,temp[4]={1,0,1,0},flag=0,t;
scanf("%d%d",&row,&col);
temp[1]=row-2;
temp[3]=col-2;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
if(row!=1&&col!=1){
i=0;j=0;p(a[0][0]);
while((temp[0]-temp[1])*(int)pow(-1,flag)<0 && (temp[2]-temp[3])*(int)pow(-1,flag)<0){
if(col<=3) {break;}
for(j=temp[2];(j-temp[3])*(int)pow(-1,flag)<=0;j+=(int)pow(-1,flag)){
p(a[i][j]);
}
p(a[i][j]);
for(i=temp[0];(i-temp[1])*(int)pow(-1,flag)<=0;i+=(int)pow(-1,flag)){
p(a[i][j]);
}
p(a[i][j]);
t=temp[0];temp[0]=temp[1];temp[1]=t;
t=temp[2];temp[2]=temp[3];temp[3]=t;
flag++;
for(j=temp[2];(j-temp[3])*(int)pow(-1,flag)<=0;j+=(int)pow(-1,flag)){
p(a[i][j]);
}
p(a[i][j]);
for(i=temp[0];(i-temp[1])*(int)pow(-1,flag)<=0;i+=(int)pow(-1,flag)){
p(a[i][j]);
}
p(a[i+1][j+1]);
t=temp[0];temp[0]=temp[1];temp[1]=t;
t=temp[2];temp[2]=temp[3];temp[3]=t;
temp[0]++;temp[2]++;temp[1]--;temp[3]--;
i++;
flag++;
}
if(col==3) j--;
if(temp[0]==temp[1]){
i=i+1;
for(j=temp[2];j<=temp[3];j++) p(a[i-1][j]);j--;
p(a[i-1][j+1]);p(a[i][j+1]);p(a[i+1][j+1]);
for(j=temp[3];j>=temp[2];j--) p(a[i+1][j]);j++;
p(a[i+1][j-1]);p(a[i][j-1]);
for(j=temp[2];j<=temp[3];j++) p(a[i][j]);
}
else if(temp[2]==temp[3]){
j=j+2;
p(a[temp[0]-1][j]);p(a[temp[0]-1][j+1]);
for(i=temp[0];i<=temp[1]+1;i++) p(a[i][j+1]);i--;
p(a[i][j]);
for(i=temp[1]+1;i>=temp[0];i--) p(a[i][j-1]);i++;
for(i=temp[0];i<=temp[1];i++) p(a[i][j]);
}
else if(abs(temp[2]-temp[3])==1 && abs(temp[0]-temp[1])!=1){
for(j=temp[2]+1;j<=temp[3];j++) p(a[i][j]);i++;
for(j=temp[3];j>=temp[2];j--) p(a[i][j]);
}
else{
p(a[i][j+2]);p(a[i+1][j+2]);p(a[i+1][j+1]);
}
if(row==2){
for(i=1;i<col;i++) p(a[0][i]);
for(i=col-1;i>=0;i--) p(a[1][i]);
}
if(col==2){
for(i=0;i<row;i++) p(a[i][1]);
for(i=row-1;i>0;i--) p(a[i][0]);
}
}
else if(row==1&&col==1) p(a[0][0]);
else if(row==1||col==1){
p(a[0][0]);
if(row==1) for(i=1;i<col;i++) p(a[0][i]);
if(col==1) for(i=1;i<row;i++) p(a[i][0]);
}
}
|
46 | 22763 |
void main()
{
int m,n;
int a[100][100]={0};
int b[100][100]={0};
int i,j;
int k,te;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
int u=0;
int tem=0;
for(i=0;i<m*n;)
{
if(u%4==0)
{
j=tem;
for(k=0;k<n;k++)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
te=k;
b[j][k]=1;
i++;
}
}
if(u%4==1)
{
k=te;
for(j=0;j<m;j++)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
tem=j;
b[j][k]=1;
i++;
}
}
if(u%4==2)
{
j=tem;
for(k=n-1;k>=0;k--)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
te=k;
b[j][k]=1;
i++;
}
}
if(u%4==3)
{
k=te;
for(j=m-1;j>=0;j--)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
tem=j;
b[j][k]=1;
i++;
}
}
u++;
}
} |
46 | 22764 | int main()
{
int row, col, a[100][100], t = 0, sum, n = 0;
cin >> row >> col;
for (int i = 0; i <= row - 1; i++)
{
for (int j = 0; j <= col - 1; j++)
{
cin >> a[i][j];
}
}
sum = row * col;
while (1)
{
for (int i = n; i < col - n; i++)
{
cout << a[n][i] << endl;
t++;
}
if (t == sum) break;
for (int i = n + 1; i < row - n; i++)
{
cout << a[i][col - n - 1] << endl;
t++;
}
if (t == sum) break;
for (int i = col - n - 2; i >= n; i--)
{
cout << a[row - n - 1][i] << endl;
t++;
}
if (t == sum) break;
for (int i = row - n - 2; i > n; i--)
{
cout << a[i][n] << endl;
t++;
}
if (t == sum) break;
n++;
}
return 0;
} |
46 | 22765 | 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 | 22766 | int array[100][100];
int main()
{
int row,col,i,j,k,c,count=0;
cin>>row>>col;
for (i=1;i<=row;i++)
for (j=1;j<=col;j++)
cin>>array[i][j];
c=row*col;
for (k=1,i=1,j=1;k<=c;k++)
{
count++;
cout<<array[i][j]<<endl;
if (count<col)
j++;
else if (count==col||count<col+row-1)
i++;
else if (count==col+row-1||count<2*col+row-2)
j--;
else if (count==2*col+row-2||count<(col+row)*2-4)
i--;
else
{
j++;
row-=2;col-=2;count=0;
}
}
return 0;
} |
46 | 22767 | int main() {
int i, j,r,c,x,y,a[110][110];
for (i=0;i<110;i++) for (j=0;j<110;j++) a[i][j]=-1;
for (scanf("%d%d", &r, &c), i = 1; i <=r; i++)
for (j = 1; j <= c; j++) scanf("%d", &a[i][j]);
for (i=j=1,x=0,y=1;a[i][j]!=-1;i+=x,j+=y){
printf("%d\n",a[i][j]);
a[i][j]=-1;
if (a[i+x][j+y]==-1){
r = y;
y= -x;
x=r;
}
}
} |
46 | 22768 | int sign[100][100]={0},arr[100][100];
void right(int i,int j)
{
void down(int i,int j);
printf("%d\n",arr[i][j]);
sign[i][j]=0;
if(sign[i][j+1]!=0)
{
right(i,j+1);
}
else
{
if(sign[i+1][j]!=0)
{
down(i+1,j);
}
}
}
void left(int i,int j)
{
void up(int i,int j);
printf("%d\n",arr[i][j]);
sign[i][j]=0;
if(sign[i][j-1]!=0&&j>0)
{
left(i,j-1);
}
else
{
if(sign[i-1][j]!=0)
{
up(i-1,j);
}
}
}
void up(int i,int j)
{
void right(int i,int j);
printf("%d\n",arr[i][j]);
sign[i][j]=0;
if(sign[i-1][j]!=0&&i>0)
{
up(i-1,j);
}
else
{
if(sign[i][j+1]!=0)
{
right(i,j+1);
}
}
}
void down(int i,int j)
{
void left(int i,int j);
printf("%d\n",arr[i][j]);
sign[i][j]=0;
if(sign[i+1][j]!=0)
{
down(i+1,j);
}
else
{
if(sign[i][j-1]!=0)
{
left(i,j-1);
}
}
}
int main()
{
void left(int i,int j);
void right(int i,int j);
void up(int i,int j);
void down(int i,int j);
int row,col,i,j;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&arr[i][j]);
sign[i][j]=1;
}
}
right(0,0);
return 0;
} |
46 | 22769 | int main()
{
int array[100][100]={0};
int x,y;
cin>>x>>y;
for(int i=0;i!=x;i++)
for(int j=0;j!=y;j++)
cin>>array[i][j];
int x1=0,x2=x-1,y1=0,y2=y-1;
while(x2>=x1&&y2>=y1)
{
if(x2==x1&&y2==y1)
cout<<array[x1][y1]<<endl;
else if(x2==x1)
{
for(int k=y1;k<=y2;k++)
cout<<array[x1][k]<<endl;
}
else if(y1==y2)
{
for(int k=x1;k<=x2;k++)
cout<<array[k][y1]<<endl;
}
else
{
for(int k=y1;k<y2;k++)
cout<<array[x1][k]<<endl;
for(int k=x1;k<x2;k++)
cout<<array[k][y2]<<endl;
for(int k=y2;k>y1;k--)
cout<<array[x2][k]<<endl;
for(int k=x2;k>x1;k--)
cout<<array[k][y1]<<endl;
}
x1++;
x2--;
y1++;
y2--;
}
return 0;
} |
46 | 22770 | int main(){
int a,b,i,j,k;
int s[100][100];
scanf("%d %d",&a,&b);
for(i=0;i<a;i++){
for(j=0;j<b;j++){
scanf("%d",&s[i][j]);
}
}
for(k=0;k<a*1.0/2&&k<b*1.0/2;k++){
if(b<=a&&k*2==b-1){
for(i=k;i<=a-k-1;i++){
printf("%d\n",s[i][k]);
}
}else if(a<b&&k*2==a-1){
for(j=k;j<=b-k-1;j++){
printf("%d\n",s[k][j]);
}
}else{
for(j=k;j<=b-k-1;j++){
printf("%d\n",s[k][j]);
}
for(i=k+1;i<=a-k-1;i++){
printf("%d\n",s[i][b-k-1]);
}
for(j=b-k-2;j>=k;j--){
printf("%d\n",s[a-k-1][j]);
}
for(i=a-k-2;i>=k+1;i--){
printf("%d\n",s[i][k]);
}
}
}
return 0;
} |
46 | 22771 |
int main()
{
int a[100][100];
int m,n,i,j;
int mini,maxi,minj,maxj;
int time,count=0;;
scanf("%d %d",&m,&n);
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
mini=0;
maxi=m-1;
minj=0;
maxj=n-1;
for (time=1;count<m*n;time++)
{
switch (time%4)
{
case 1:
{
for (i=mini,j=minj;j<=maxj;j++)
{
printf("%d\n",a[i][j]);
count++;
}
mini++;
break;
}
case 2:
{
for (j=maxj,i=mini;i<=maxi;i++)
{
printf("%d\n",a[i][j]);
count++;
}
maxj--;
break;
}
case 3:
{
for (i=maxi,j=maxj;j>=minj;j--)
{
printf("%d\n",a[i][j]);
count++;
}
maxi--;
break;
}
case 0:
{
for (j=minj,i=maxi;i>=mini;i--)
{
printf("%d\n",a[i][j]);
count++;
}
minj++;
break;
}
}
}
return 0;
} |
46 | 22772 | 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 | 22773 | int main(){
int h,l,i,j,k=0,n,m=0;
scanf("%d%d",&h,&l);
int p[h][l];
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d", &p[i][j]);
}
}
i=0;j=0;
for(n=0;;){
while(j<l-k){
if(n==h*l-1){printf("%d",p[i][j]);m=1;break;}else{printf("%d\n",p[i][j]);n++;}
j++;
}j--;i++;if(m==1){break;}
while(i<h-k){
if(n!=h*l-1){printf("%d\n",p[i][j]);n++;}else{printf("%d",p[i][j]);m=1;break;}
i++;
}i--;j--;if(m==1){break;}
while(j-k>=0){
if(n!=h*l-1){printf("%d\n",p[i][j]);n++;}else{printf("%d",p[i][j]);m=1;break;}
j--;
}j++;i--;k++;if(m==1){break;}
while(i-k>=0){
if(n!=h*l-1){printf("%d\n",p[i][j]);n++;}else{printf("%d",p[i][j]);m=1;break;}
i--;
}i++;j++;if(m==1){break;}
}
return 0;
}
|
46 | 22774 |
int main(){
int sz[100][100],col,row,i,k,count=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(k=0;k<col;k++){
scanf("%d",&sz[i][k]);
}
}
i=0;
k=0;
for(1;1;1){
for(k=k;k<col;k++){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i][k+1]==0||k+1==col){
i=i+1;
break;
}
}
if(count>=col*row){
break;
}
for(i=i;i<row;i++){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i+1][k]==0||i+1==row){
k=k-1;
break;
}
}
if(count>=col*row){
break;
}
for(k=k;k>=0;k--){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i][k-1]==0||k==0){
i=i-1;
break;
}
}
if(count>=col*row){
break;
}
for(i=i;i>=0;i--){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i-1][k]==0||i==0){
k=k+1;
break;
}
}
if(count>=col*row){
break;
}
}
return 0;
} |
46 | 22775 | int main(){
int n,ROW,COL,a,b;
int sz[100][100];
scanf("%d%d",&ROW,&COL);
for(a=0;a<ROW;a++){
for(b=0;b<COL;b++){
scanf("%d",&sz[a][b]);
}
}
if(ROW>COL)
n=COL;
else
n=ROW;
int i,s,t,p,q;
if(n%2==0){
for(i=0;i<(n+1)/2;i++){
for(s=i;s<COL-i;s++){
printf("%d\n",sz[i][s]);
}
for(t=i+1;t<ROW-i;t++){
printf("%d\n",sz[t][COL-i-1]);
}
for(p=COL-i-2;p>=i;p--){
printf("%d\n",sz[ROW-i-1][p]);
}
for(q=ROW-i-2;q>i;q--){
printf("%d\n",sz[q][i]);
}
}
}
else if(n%2==1){
for(i=0;i<(n-1)/2;i++){
for(s=i;s<COL-i;s++){
printf("%d\n",sz[i][s]);
}
for(t=i+1;t<ROW-i;t++){
printf("%d\n",sz[t][COL-i-1]);
}
for(p=COL-i-2;p>=i;p--){
printf("%d\n",sz[ROW-i-1][p]);
}
for(q=ROW-i-2;q>i;q--){
printf("%d\n",sz[q][i]);
}
}
for(i=(n-1)/2;i<=(n-1)/2;i++){
for(s=i;s<COL-i;s++){
printf("%d\n",sz[i][s]);
}
for(t=i+1;t<ROW-i;t++){
printf("%d\n",sz[t][COL-i-1]);
}
}
}
return 0;
}
|
46 | 22776 | 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 | 22777 |
int main()
{
int row,col;
int i,j;
int a[100][100];
int p=0,q=0;
for(i=0;i<100;i++)
{
for(j=0;j<100;j++)
a[i][j]=-1;
}
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
if(col==1)
{
for(j=0;j<row;j++)
{
printf("%d\n",a[j][0]);
a[0][j]=-1;
}
}
else
{
for(i=row-1,j=col-1;i>0,j>0;i--,j--)
{
for(;q<=j-1;q++)
{
if(a[p][q]!=-1)
printf("%d\n",a[p][q]);
a[p][q]=-1;
}
for(;p<=i-1;p++)
{
if(a[p][q]!=-1)
printf("%d\n",a[p][q]);
a[p][q]=-1;
}
for(;q>=col-j;q--)
{
if(a[p][q]!=-1)
printf("%d\n",a[p][q]);
a[p][q]=-1;
}
for(;p>=row-i;p--)
{
if(a[p][q]!=-1)
printf("%d\n",a[p][q]);
a[p][q]=-1;
}
p=p+1;
q=q+1;
}
if((q%2==0)&&(p%2==0))
{
i=q/2;
j=p/2;
if(a[p-j][q-i]!=-1)
printf("%d",a[p-j][q-i]);
}
}
return 0;
}
|
46 | 22778 | int main()
{
int n,m,a[1000][1000],i,j,s,q=0;
cin>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>a[i][j];
int flag=0;
for(i=0;;i++)
{
for(j=q;j<m-q;j++)
{
flag++;
cout<<endl<<a[i][j];
}
if(flag==n*m)
break;
j--;
for(s=i+1;s<n-q;s++)
{
flag++;
cout<<endl<<a[s][j];
}
if(flag==n*m)
break;
s--;
for(j=j-1;j>=q;j--)
{
flag++;
cout<<endl<<a[s][j];
}
if(flag==n*m)
break;
j++;
for(s=s-1;s>q;s--)
{
flag++;
cout<<endl<<a[s][j];
}
if(flag==n*m)
break;
q++;
}
return 0;
}
|
46 | 22779 | int main()
{
int a, b, n = 1;
cin >> a >> b;
int c[101][101];
for (int i = 1; i <= a; i++)
for (int j = 1; j <= b; j++)
cin >> c[i][j];
while (2 * n <= a && 2 * n <= b)
{
for (int i = n; i <= b - n; i++)
cout << c[n][i] << endl;
for (int i = n; i <= a - n; i++)
cout << c[i][b-n+1] << endl;
for (int i = b - n + 1; i > n; i--)
cout << c[a-n+1][i] << endl;
for (int i = a - n+1; i > n; i--)
cout << c[i][n] << endl;
n++;
}
for (int i = n; i <= b + 1 - n; i++)
for (int j = n; j <= a + 1 - n; j++)
cout << c[j][i] << endl;
return 0;
} |
46 | 22780 | 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 | 22781 | int main()
{
int i,j,x=0,y=0,row,col,k=0;
int a[100][100];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
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*col;i++)
{
printf("%d\n",a[x][y]);
if(k==0 && x+y==col-1)
k=1;
else if(k==1 && x-y==row-col)
k=2;
else if(k==2 && x+y==row-1)
k=3;
else if(k==3 && x-y==1)
k=0;
x+=dx[k];
y+=dy[k];
}
return 0;
} |
46 | 22782 | int main()
{
/* Read data */
int col, row, a[100][100];
cin >> row >> col;
for(int i=0; i<row; ++i)
for(int j=0; j<col; ++j)
cin >> a[i][j];
/* Const direction */
const int dir[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
/* Parameter Initialization */
/* State records current direction index, step records step size for 4 directions, curstep is current step size, pos records current position */
int state=0, step[4] = {col, row-1, col-1, row-2}, curstep=step[state], pos[2] = {0,0}, flag=1;
/* Main Solver */
while(curstep > 0)
{
for(int i=0+flag; i<curstep; ++i)
{
cout << a[pos[0]][pos[1]] << endl;
pos[0] += dir[state][0];
pos[1] += dir[state][1];
}
step[state] = step[state]-2;
state = (state+1)%4;
curstep = step[state];
flag = 0;
}
cout << a[pos[0]][pos[1]] << endl;
return 0;
} |
46 | 22783 | void main(){
int n[100][100],d[100][100], r,c,i,j,f,g;
scanf("%d %d\n",&r,&c);
for(i=0;i<r;i++){
scanf("\n");
for(j=0;j<c;j++){
scanf("%d",&n[i][j]);
d[i][j]=1;
}
}
i=0;
j=0;
g=0;
for(f=1;f<=r*c;f++){
printf("%d\n",n[i][j]);
d[i][j]=0;
if(g==0){
if(j<c-1&&d[i][j+1]){
j++;
g=0;}
else if(i<r-1&&d[i+1][j]){
i++;
g=0;}
else if(j>0&&d[i][j-1]){
j--;
g=0;}
else if(i>0&&d[i-1][j]){
i--;
g=1;}
}
else{
if(i>0&&d[i-1][j]){
i--;
g=1;}
else if(j<c-1&&d[i][j+1]){
j++;
g=0;}
}
}}
|
46 | 22784 | int main()
{
int input[100][100],i,j,k,m,n,output[10000],a=0;
int row,col;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&input[i][j]);
}
for(i=0;i<row;i++)
{
for(j=i;j<col-i;j++)
{
output[a++]=input[i][j];
}
for(k=i+1;k<row-i;k++)
{
output[a++]=input[k][j-1];
}
for(m=j-2;m>=i;m--)
{
output[a++]=input[k-1][m];
}
for(n=k-2;n>i;n--)
{
output[a++]=input[n][m+1];
}
if(i==k)
{
break;
}
}
for(i=0;i<row*col-1;i++)
printf("%d\n",output[i]);
printf("%d",output[row*col-1]);
return 0;
} |
46 | 22785 | /*************************
***??:??? 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 | 22786 |
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 | 22787 |
int main()
{
int array[100][100],row,col,i,j,k,a,b,c,d;
scanf("%d %d",&row,&col);
for (i=0;i<row;i++)
{
for (j=0;j<col;j++)
{
scanf("%d",&(array[i][j]));
}
}
for (k=0;k<row;k++)
{
if (row-1-k-k==1&&col-1-k-k==1)
{
printf("%d\n%d\n%d\n%d\n",array[k][k],array[k][k+1],array[k+1][k+1],array[k+1][k]);
break;
}
if (row-1-k-k==0&&col-1-k-k==0)
{
printf("%d",array[k][k]);
break;
}
if (row-1-k-k==1&&col-1-k-k==0)
{
printf("%d\n%d\n",array[k][k],array[k+1][k]);
break;
}
if (row-1-k-k==1&&col-1-k-k!=1)
{
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]);
}
break;
}
if (row-1-k-k==0)
{
for (i=k,j=k;j<=col-1-k;j++)
{
printf("%d\n",array[i][j]);
}
break;
}
if (col-1-k-k==1)
{
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]);
}
break;
}
if (col-1-k-k==0)
{
for (i=k,j=col-1-k;i<=row-1-k;i++)
{
printf("%d\n",array[i][j]);
}
break;
}
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]);
}
}
return 0;
}
|
46 | 22788 | /* 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 | 22789 | int main()
{
int row,col,i,j,u[100][100],a,sum=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&u[i][j]);
}
}
for(a=0;a<row/2+1;a++)
{
for(i=a,j=a;j<col-a;j++)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
for(j=col-a-1,i=a+1;i<row-a;i++)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
for(i=row-a-1,j=col-a-2;j>=a;j--)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
for(j=a,i=row-a-2;i>a;i--)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
}
return 0;
}
|
46 | 22790 | int main(){
int h,l,i,k,n,hsx,hxx=0,lsx,lxx=0;
int shu[100][100];
scanf("%d%d",&h,&l);
for(i=0;i<h;i++){
for(k=0;k<l;k++){
scanf("%d",&(shu[i][k]));
}
}
hsx=h-1;
lsx=l-1;
for(n=0;(hsx>hxx)&&(lsx>lxx);n++){
for(k=lxx;k<lsx;k++){
printf("%d\n",shu[hxx][k]);
}
for(i=hxx;i<hsx;i++){
printf("%d\n",shu[i][lsx]);
}
for(k=lsx;k>lxx;k--){
printf("%d\n",shu[hsx][k]);
}
for(i=hsx;i>hxx;i--){
printf("%d\n",shu[i][lxx]);
}
hsx--;
hxx++;
lsx--;
lxx++;
}
if((hxx==hsx)&&(lsx>lxx)){
for(k=lxx;k<=lsx;k++){
printf("%d\n",shu[hxx][k]);
}
}
else if((lxx==lsx)&&(hsx>hxx)){
for(i=hxx;i<=hsx;i++){
printf("%d\n",shu[i][lxx]);
}
}
else if((hsx==hxx)&&(lsx==lxx)){
printf("%d",shu[hxx][lxx]);
}
return 0;
}
|
46 | 22791 |
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 | 22792 | 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 | 22793 |
int main()
{
int row , col ;
cin >> row >> col ;
int a[row][col] ;
for( int i = 0 ; i < row ; i ++ )
for( int j = 0 ; j < col ; j ++ )
cin >> a[i][j] ;
int minrow = 0 , maxrow = row - 1 ,
mincol = 0 , maxcol = col - 1 , n = 0 , i = 0 , j = 0 , count = 0 ;
for( ; n > -1 ; n ++ )
{
/*for( ; minrow <= i && i <= maxrow && mincol <= j && j <= maxcol ;
n % 2 == 0 ? n % 4 == 0 ? j ++ : j -- : n % 4 == 1 ? i ++ : i -- )
cout << a[i][j] << endl ;*/
if( n % 2 == 0 )
{
if( n % 4 == 0 ) {
for( ; j <= maxcol ; j ++ )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
minrow ++ ; j -- ; i ++ ; }
else {
for( ; j >= mincol ; j -- )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
maxrow -- ; j ++ ; i -- ; }
}
else
{
if( n % 4 == 1 ){
for( ; i <= maxrow ; i ++ )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
maxcol -- ; i -- ; j -- ; }
else {
for( ; i >= minrow ; i -- )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
mincol ++ ; i ++ ; j ++ ;}
}
if( count == row * col ) break ;
}
return 0 ;
} |
46 | 22794 | int main()
{
int row,col;
cin>>row>>col;
int shuzu[100][100];
int p=0,q=0,count=0;
for(p=0;p<row;p++)
for(q=0;q<col;q++){cin>>shuzu[p][q];}
for(;row-count>0&&col-count>0;)
{
p=count;for(q=count;q<col;q++){cout<<shuzu[p][q]<<endl;}
if(row==count+1)return 0;
q=col-1;for(p=count+1;p<row;p++){cout<<shuzu[p][q]<<endl;}
if(col==1+count)return 0;
p=row-1;for(q=col-2;q>=count;q--){cout<<shuzu[p][q]<<endl;}
q=count;for(p=row-2;p>count;p--){cout<<shuzu[p][q]<<endl;}
row--;col--;count++;
}
return 0;
} |
46 | 22795 | 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 | 22796 | int main()
{
int m,n,i,j,s,k,l,t;
int a[100][100];
scanf("%d%d",&m,&n);
s=t=0;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
s=s+1;
}
}
l=m/2;
if(n<m) l=n/2;
for(k=0;k<l;k++)
{
for(j=k;j<n-k-1;j++) {printf("%d\n",a[k][j]);t=t+1;}
for(i=k;i<m-k-1;i++) {printf("%d\n",a[i][n-k-1]);t=t+1;}
for(j=n-k-1;j>k;j--) {printf("%d\n",a[m-k-1][j]);t=t+1;}
for(i=m-k-1;i>k;i--) {printf("%d\n",a[i][k]);t=t+1;}
}
if(t!=s)
{
if(m>n){ for(i=k;i<m-k;i++) printf("%d\n",a[i][l]);}
if(m<n){ for(j=k;j<n-k;j++) printf("%d\n",a[l][j]);}
if(m==n) printf("%d\n",a[l][l]);
}
return 0;
}
|
46 | 22797 | int main()
{
int row,col,n;
cin >> row >> col;
n=row*col;
int array[row][col];
int i,j;
for (i=1;i<=row;i++)
{
for (j=1;j<=col;j++)
{
int a;
cin >> a;
array[i-1][j-1]=a;
}
}
int mini=0,minj=0,k;
for (k=1;k<=n;)
{
if (j!=col)
{ j=minj;
while (j<col)
{
cout << array[mini][j] << endl;
k++;
j++;
}
}
mini++;
if (k>n)
{
break;
}
if (j==col)
{
i=mini;
while (i<row)
{
cout << array[i][col-1] << endl;
k++;
i++;
}
}
col--;
if (k>n)
{
break;
}
if (i==row)
{
j=col-1;
while (j>=minj)
{
cout << array[row-1][j] << endl;
k++;
j--;
}
}
row--;
if (k>n)
{
break;
}
if (j<minj)
{
i=row-1;
while (i>=mini)
{
cout << array[i][minj] << endl;
k++;
i--;
}
}
minj++;
if (k>n)
{
break;
}
}
return 0;
} |
46 | 22798 | int main(int argc, char* argv[])
{
int a[100][100],row,col,i,j,n=0,k=0;
scanf("%d%d",&row,&col);
for (i=0;i<row;i++)
{
for (j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
while (k!=(row*col))
{
for (j=(0+n);j<(col-n);j++)
{
printf("%d\n",a[n][j]);
k++;
}
if(k==row*col)break;
for (i=(1+n);i<(row-n);i++)
{
printf("%d\n",a[i][col-1-n]);
k++;
}
if(k==row*col)break;
for (j=(col-2-n);j>=(0+n);j--)
{
printf("%d\n",a[row-n-1][j]);
k++;
}
if(k==row*col)break;
for (i=(row-2-n);i>=(1+n);i--)
{
printf("%d\n",a[i][n]);
k++;
}
if(k==row*col)break;
n++;
}
return 0;
}
|
46 | 22799 | void main()
{
int n,m,i1,i2,j1,j2,i,a[100][100];
scanf("%d%d",&n,&m);
for (i1=0;i1<=n-1;i1++)
for(j1=0;j1<=m-1;j1++)
scanf("%d",&a[i1][j1]);
i1=0;j1=0;i2=n-1;j2=m-1;
for (;;)
{
for (i=j1;i<=j2;i++)
printf("%d\n",a[i1][i]);
i1++;
if (i1>i2) break;
for (i=i1;i<=i2;i++)
printf("%d\n",a[i][j2]);
j2--;
if (j1>j2) break;
for (i=j2;i>=j1;i--)
printf("%d\n",a[i2][i]);
i2--;
if (i1>i2) break;
for (i=i2;i>=i1;i--)
printf("%d\n",a[i][j1]);
j1++;
if (j1>j2) break;
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.