id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
22,800 | int main()
{
int i,j,sum=0,c,e,f,m,n,a[100][100];
scanf("%d %d",&m,&n);
for(i=0;i<m;i++){
scanf("%d",&a[i][0]);
for(j=1;j<n;j++){
scanf(" %d",&a[i][j]);
}
}
for(c=0,e=m,f=n;;c++,e--,f--){
for(j=c;j<f;j++){
printf("%d\n",a[c][j]);
sum++;
}
if(sum==m*n)
break;
for(i=c+1;i<e;i++){
printf("%d\n",a[i][f-1]);
sum++;
}
if(sum==m*n)
break;
for(j=f-2;j>c-1;j--){
printf("%d\n",a[e-1][j]);
sum++;
}
if(sum==m*n)
break;
for(i=e-2;i>c;i--){
printf("%d\n",a[i][c]);
sum++;
}
if(sum==m*n)
break;
}
return 0;
}
| 46 |
22,801 | 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 |
22,802 | //********************************
//*??????????? **
//*????? 1300012845 **
//*???2013.11.2 **
//********************************
int main ()//???
{
int x[104][104]={0}, y[10001]={0}, N ;
int row, col, i, j, k, l=1, min ;
cin >> row >> col;
for ( i=1; i <=row; i++ )
{
for ( j=1; j <=col; j++ )
cin >> x[i][j];//?????x??
}
i=1, j=1;
N= row * col;
if ( row > col )
min = col;
else
min = row;
for (k=1; k <= min; k++ )//????1
{
for ( j=k; j <= col -k; j++ )//????????
{
if ( l>N )
break;//break??
y[l] = x[k][j]; //?????y??
l++;
}
for ( i=k; i <= row -k; i++ )//????????
{
if ( l>N )
break;
y[l] = x[i][col-k+1];
l++;
}
for ( j=col-k+1; j>=k+1; j-- )//??????????
{
if ( l>N )
break;
y[l] = x[row-k+1][j];
l++;
}
for ( i=row-k+1; i>=k+1; i--)//??????????
{
if ( l>N )
break;
y[l] = x[i][k];
l++;
}
}
if (col==row && col % 2!=0 )
y[N] = x [(col + 1)/2][(col + 1)/2];
for (l=1; l <= N; l++)//??
cout << y[l] << endl;
return 0;
} | 46 |
22,803 |
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 |
22,804 | int main(int argc, char* argv[])
{
int row,col,n,i,j,a[100][100];
int 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(n=0;n<=row;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",a[n][i]);
sum++;
}
if(sum==row*col)break;
for(j=n+1;j<row - n;j++)
{
printf("%d\n",a[j][col-(n+1)]);
sum++;
}
if(sum==row*col)break;
for(i=col-(n+1)-1;i>=n;i--)
{
printf("%d\n",a[row-(n+1)][i]);
sum++;
}
if(sum==row*col)break;
for(j=row-(n+1)-1;j>n;j--)
{
printf("%d\n",a[j][n]);
sum++;
}
if(sum==row*col)break;
}
return 0;
} | 46 |
22,805 | int main()
{
int i, j, k;
int sz[100][100];
int row,col;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=0;k<(col+1)/2;k++){
for(i=k,j=k;j<col-k;j++){
printf("%d\n",sz[i][j]);
}
if(2*k==row-1){break;}
for(i=k+1,j=col-k-1;i<row-k;i++){
printf("%d\n",sz[i][j]);
}
if(2*k==col-1){break;}
for(i=row-k-1,j=col-k-2;j>=k;j--){
printf("%d\n",sz[i][j]);
}
if(2*k==row-2){break;}
for(j=k,i=row-k-2;i>k;i--){
printf("%d\n",sz[i][j]);
}
if(2*k==col-2){break;}
}
return 0;
}
| 46 |
22,806 | 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 |
22,807 |
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 |
22,808 | int main()
{
int row,col,i,j,array[101][101],count=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
int num=row+col-1;
for(i=1;i<=num;i++)
{
if(count==row*col)
break;
else
switch(i%4)
{
case 1:
{
for(j=i/4;j<col-i/4;j++)
{
printf("%d\n",array[i/4][j]);
count+=1;
}
break;
}
case 2:
{
for(j=i/4+1;j<row-i/4;j++)
{
printf("%d\n",array[j][col-i/4-1]);
count+=1;
}
break;
}
case 3:
{
for(j=col-2-i/4;j>=i/4;j--)
{
printf("%d\n",array[row-1-i/4][j]);
count+=1;
}
break;
}
case 0:
{
for(j=row-1-i/4;j>=i/4;j--)
{
printf("%d\n",array[j][i/4-1]);
count+=1;
}
break;
}
}
}
return 0;
}
| 46 |
22,809 | void main()
{
int row,col,i,j,x=0,n;
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(n=0;;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",a[n][i]);
x++;
}
for(j=n+1;j<row-n;j++)
{
printf("%d\n",a[j][col-n-1]);
x++;
}
if(x==row*col)
break;
for(i=col-n-2;i>n-1;i--)
{
printf("%d\n",a[row-n-1][i]);
x++;
}
for(j=row-n-2;j>n;j--)
{
printf("%d\n",a[j][n]);
x++;
}
}
} | 46 |
22,810 | /*
* ????????.cpp
*
* Created on: 2012-12-27
* Author: i
*/
int a[103][103]={0},n=0,m=0;
void shuchu(int hang,int lie){
int i=0;
if((n%2==0&&hang>=n/2)||(m%2==0&&lie>=m/2)){}
else if(m%2==1&&lie==m/2)for(i=hang;i<n-hang;i++)cout<<a[i][lie]<<endl;
else if(n%2==1&&hang==n/2)for(i=lie;i<m-lie;i++)cout<<a[hang][i]<<endl;
else{
for(i=lie;i<m-lie;i++)cout<<a[hang][i]<<endl;
for(i=hang+1;i<n-hang;i++)cout<<a[i][m-lie-1]<<endl;
for(i=m-lie-2;i>=lie;i--)cout<<a[n-hang-1][i]<<endl;
for(i=n-hang-2;i>=hang+1;i--)cout<<a[i][lie]<<endl;
shuchu(hang+1,lie+1);
}
}
int main(){
int i=0,j=0;
cin>>n>>m;
for(i=0;i<n;i++){
for(j=0;j<m;j++){
cin>>a[i][j];
}
}
shuchu(0,0);
return 0;
}
| 46 |
22,811 |
int main()
{
int a[101][101];
int row, col, i, j, k, h, counter = 0, mul;
cin >> row >> col;
mul = row * col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
if (col % 2 == 0)
h = col / 2;
else
h = col / 2 + 1;
for (k = 0; k < h; k++)
{
for (i = k, j = k; j < col - k; j++)
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
j--;
for (i = 1 + k; i < row - k; i++)
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
i--;
for (j = col - 2 - k; j >= k; j--)
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
j++;
for (i = row - 2 - k; i > k; i-- )
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
i++;
}
return 0;
}
| 46 |
22,812 |
int main() {
int row, col;
scanf("%d%d", &row, &col);
int data[100][100];
for(int i = 0; i < row; i++) {
for(int j = 0; j < col; j++) {
scanf("%d", &data[i][j]);
}
}
int colLow = 0;
int rowLow = 0;
int colHigh = col - 1;
int rowHigh = row - 1;
while(rowLow <= rowHigh && colLow <= colHigh) {
for(int i = colLow; i <= colHigh; i++) {
printf("%d\n", data[rowLow][i]);
}
for(int i = rowLow + 1; i <= rowHigh - 1; i++) {
printf("%d\n", data[i][colHigh]);
}
if(rowHigh != rowLow) {
for(int i = colHigh; i >= colLow; i--) {
printf("%d\n", data[rowHigh][i]);
}
}
if(colHigh != colLow) {
for(int i = rowHigh - 1; i >= rowLow + 1; i--) {
printf("%d\n", data[i][colLow]);
}
}
colLow++;
rowLow++;
colHigh--;
rowHigh--;
}
}
| 46 |
22,813 | int main(void)
{
int m,n,i,j,k,t=0,a[101][101]={0},x[4]={0,1,0,-1},y[4]={1,0,-1,0};
cin>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
i=1,j=0,k=0;
while(a[i+x[k]][j+y[k]]!=0)
{
cout<<a[i+x[k]][j+y[k]];
t++;
a[i+x[k]][j+y[k]]=0;
if(t<m*n) cout<<endl;
i+=x[k],j+=y[k];
if(a[i+x[k]][j+y[k]]==0) k=(k+1)%4;
}
}
| 46 |
22,814 | 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 |
22,815 | int main(){
int r,c;
scanf("%d%d",&r,&c);
int sz[r][c];
for(int i=0;i<r;i++){for(int k=0;k<c;k++){scanf("%d",&sz[i][k]);}}
int a ;
if(r>c){a=c;}
else {a=r;}int x=0;
for (int i=0;i<a/2;i++){for (int m=x;m<c-x;m++){printf("%d\n",sz[x][m]);}
for(int m=x+1;m<r-x;m++){printf("%d\n",sz[m][c-1-x]);}
for(int m=c-2-x;m>x;m--){printf("%d\n",sz[r-1-x][m]);}
for(int m=r-1-x;m>x;m--){printf("%d\n",sz[m][x]);}
x++;
}
if(c>=r&&r%2!=0){for(int i=r/2;i<c-r/2;i++){printf("%d\n",sz[r/2][i]);}}
if(r>c&&c%2!=0){for(int i=c/2;i<r-c/2;i++){printf("%d\n",sz[i][c/2]);}
}
return 0;
}
| 46 |
22,816 | /*
* bianli2.cpp
*
* Created on: 2011-11-5
* Author: 1100012857
*/
int main()
{
int row,col,i,j;
int a[100][100];
cin>>row>>col;
for (i=0;i<=row-1;i++)
{
for (j=0;j<=col-1;j++)
{
cin>>a[i][j];
}
}
int lu_x=0,lu_y=0,rd_x=row-1,rd_y=col-1;
while(lu_x<rd_x&&lu_y<rd_y)
{
for (j=lu_y;j<=rd_y;j++)
cout<<a[lu_x][j]<<endl;
for (i=lu_x+1;i<=rd_x;i++)
cout<<a[i][rd_y]<<endl;
for (j=rd_y-1;j>=lu_y;j--)
cout<<a[rd_x][j]<<endl;
for (i=rd_x-1;i>=lu_x+1;i--)
cout<<a[i][lu_y]<<endl;
lu_x++;lu_y++;rd_x--;rd_y--;
}
if(lu_x==rd_x)
{
for (j=lu_y;j<=rd_y;j++) cout<<a[lu_x][j]<<endl;
}
else
{
for (i=lu_x;i<=rd_x;i++) cout<<a[i][rd_y]<<endl;
}
return 0;
}
| 46 |
22,817 |
int a[200][200],row,col,f;
void function(int r,int c)
{
int i,j;
f=0;
if(r==1){for(i=1;i<=c;i++){printf("%d\n", a[1][i]);}f=1;}
if(c==1&&f==0){for(i=1;i<=r;i++){printf("%d\n", a[i][1]);}}
if(r!=1&&c!=1){
for(i=1;i<=c;i++){printf("%d\n", a[1][i]);}
for(i=2;i<=r;i++){printf("%d\n", a[i][c]);}
for(i=c-1;i>=1;i--){printf("%d\n", a[r][i]);}
for(i=r-1;i>=2;i--){printf("%d\n", a[i][1]);}
}
for(i=2;i<=r-1;i++){
for(j=1;j<=c-2;j++){a[i][j]=a[i][j+1];}
}
for(i=1;i<=r-2;i++){
for(j=1;j<=c-2;j++){a[i][j]=a[i+1][j];}
}
if(c-2>=1&&r-2>=1){function(r-2,c-2);}
}
int main()
{
int i,j;
scanf("%d %d", &row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++){
scanf("%d", &a[i][j]);
} }
function(row,col);
}
| 46 |
22,818 | 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 |
22,819 | 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 |
22,820 | 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 |
22,821 | 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;
}
} | 46 |
22,822 | 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 |
22,823 | int main(){
int x,y;
scanf("%d%d",&y,&x);
int sz[x][y];
int c,d;
c=x*y;
d=0;
for(int b=0;b<y;b++){
for(int a=0;a<x;a++){
scanf("%d",&sz[a][b]);
}
}
for(int i=0;i!=-1;i++){
for(int a=i;a<x-i;a++){
printf("%d\n",sz[a][i]);
sz[a][i]=0;
d++;
}
if(d==c){
break;
}
for(int b=i+1;b<y-i;b++){
printf("%d\n",sz[x-i-1][b]);
sz[x-i-1][b]=0;
d++;
}
if(d==c){
break;
}
for(int a=x-i-2;a>=i;a--){
printf("%d\n",sz[a][y-i-1]);
sz[a][y-i-1]=0;
d++;
}
if(d==c){
break;
}
for(int b=y-i-2;b>i;b--){
printf("%d\n",sz[i][b]);
sz[i][b]=0;
d++;
}
if(d==c){
break;
}
}
return 0;
}
| 46 |
22,824 | int main()
{
int row,col,row1,row2,col1,col2,array[100][100],i,j,i1,i2,j1,j2;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&(array[i][j]));
}
}
col1=0;
col2=col-1;
row1=0;
row2=row-1;
while((row2-row1>0)&&(col2-col1>0))
{
for(i1=col1;i1<col2;i1++)
printf("%d\n",array[row1][i1]);
for(j1=row1;j1<row2;j1++)
printf("%d\n",array[j1][col2]);
for(i2=col2;i2>col1;i2--)
printf("%d\n",array[row2][i2]);
for(j2=row2;j2>row1;j2--)
printf("%d\n",array[j2][col1]);
col1++;
col2--;
row1++;
row2--;
}
if((row2-row1==0)&&(col2-col1!=0))
{
for(i=col1;i<=col2;i++)
{
printf("%d\n",array[row1][i]);
}
}
if((col2-col1==0)&&(row2-row1!=0))
{
for(j=row1;j<=row2;j++)
{
printf("%d\n",array[j][col1]);
}
}
if((col2-col1==0)&&(row2-row1==0))
printf("%d\n",array[row1][col1]);
return 0;
}
| 46 |
22,825 | void main()
{
int row,col,i,j,a[100][100],t,k=0,m=1,c,u;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
i=0;
j=0;
if(col<row)t=2*col+1;
else t=2*row;
u=t;
for(;t!=1;t--)
{
if(t%4==u%4)
{
for(c=col-k;c!=0;j++)
{
printf("%d\n",a[i][j]);
c--;
}
k++;
j--;
i++;
}
else if(t%4==(u-1)%4)
{
for(c=row-m;c!=0;i++)
{
printf("%d\n",a[i][j]);
c--;
}
m++;
i--;
j--;
}
else if(t%4==(u-2)%4)
{
for(c=col-k;c!=0;j--)
{
printf("%d\n",a[i][j]);
c--;
}
k++;
j++;
i--;
}
else if(t%4==(u-3)%4)
{
for(c=row-m;c!=0;i--)
{
printf("%d\n",a[i][j]);
c--;
}
m++;
i++;
j++;
}
}
}
| 46 |
22,826 | 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 |
22,827 |
int main(){
int h,l;
int i,j,n,t=0;
int sz[100][100];
scanf("%d%d",&h,&l);
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d",&sz[i][j]);
}
}
for(n=0;;n++){
for(i=n,j=n;j<l-n;j++){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
for(j=l-1-n,i=1+n;i<h-n;i++){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
for(i=h-1-n,j=l-2-n;j>=n;j--){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
for(j=n,i=h-2-n;i>n;i--){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
}
return 0;
}
| 46 |
22,828 | void main()
{
int row,col;
int i,j,n,time=0,a,b,c,d;
int array[100][100];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
for(n=0;;n++)
{
for(a=n;a<col-n;a++)
{
printf("%d\n",array[n][a]);
time++;
}
if(time==row*col)
break;
for(b=n+1;b<row-n;b++)
{
printf("%d\n",array[b][col-n-1]);
time++;
}
if(time==row*col)
break;
for(c=col-2-n;c>=n;c--)
{
printf("%d\n",array[row-n-1][c]);
time++;
}
if(time==row*col)
break;
for(d=row-2-n;d>n;d--)
{
printf("%d\n",array[d][n]);
time++;
}
if(time==row*col)
break;
}
}
| 46 |
22,829 | 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 |
22,830 | int main()
{
int row,col,i,j,k,c=0,h;
cin>>row>>col;
cout<<endl;
k=row*col;
int a[row][col],b[row+2][col+2];
for(i=0;i<=row-1;i++)
{for(j=0;j<=col-1;j++)
{cin>>a[i][j];}
}
for(i=1;i<=row;i++)
{for(j=1;j<=col;j++)
{b[i][j]=1;}
}
for(i=0;i<=col+1;i++)
{b[0][i]=0;b[row+1][i]=0;}
for(j=1;j<=row;j++)
{b[j][0]=0;b[j][col+1]=0;}
i=0;
j=0;
h=1;
while(1>0)
{if(h%4==1&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
j=j+1;
}while(b[i+1][j+1]!=0);
h=h+1;
i=i+1;
j=j-1;
}
if(h%4==2&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
i=i+1;
}while(b[i+1][j+1]!=0);
h=h+1;
j=j-1;
i=i-1;
}
if(h%4==3&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
j=j-1;
}while(b[i+1][j+1]!=0);
h=h+1;
i=i-1;
j=j+1;
}
if(h%4==0&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
i=i-1;
}while(b[i+1][j+1]!=0);
h=h+1;
j=j+1;
i=i+1;
}
if(c==k) break;
}
return 0;
}
| 46 |
22,831 | int main()
{
int sz[100][100],row,col,i,k,x=0,y=0,n=1;
cin>>row>>col;
for(i=0;i<row;i++)
{
for(k=0;k<col;k++)
{
cin>>sz[i][k];
}
}
while(n<=row*col)
{
for(k=y;k<(col-y-1);k++)
{
cout<<sz[x][k]<<"\n";
n++;
if(n>row*col)
break;
}
for(i=x;i<(row-x-1);i++)
{
cout<<sz[i][col-y-1]<<"\n";
n++;
if(n>row*col)
break;
}
for(k=col-y-1;k>y;k--)
{
cout<<sz[row-x-1][k]<<"\n";
n++;
if(n>row*col)
break;
}
for(i=row-x-1;i>x;i--)
{
cout<<sz[i][y]<<"\n";
n++;
if(n>row*col)
break;
}
if(x==(row-1)/2&&x==y&&row==col&&row%2==1)
{
cout<<sz[x][y]<<"\n";
n++;
}
x++;
y++;
}
return 0;
} | 46 |
22,832 | 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 |
22,833 | int main()
{
int i,j,a[100][100]={{0},{0}},s=0,b,t=0,r=0,c=0,R,rmin=0,C,cmin=0;
scanf("%d%d",&R,&C);
for(i=0;i<R;i++)
{
for(j=0;j<C;j++)
{
scanf("%d",&a[i][j]);
t=t+1;
}
}
for(b=0;b<=10000;b++)
{
for(c=cmin;c<C;c++)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
C-=1;
c-=1;
rmin+=1;
for(r=rmin;r<R;r++)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
R-=1;
r-=1;
for(c=C-1;c>=cmin;c--)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
c+=1;
for(r=R-1;r>=rmin;r--)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
r+=1;
cmin+=1;
}
} | 46 |
22,834 | int main(){
int h, l;
scanf("%d %d",&h, &l);
int sz[h][l];
for(int i=0;i<h;i++){
for(int j=0;j<l;j++){
scanf("%d",&sz[i][j]);
}
}
int qs_h=0, qs_l=0;
int zz_h=h-1, zz_l=l-1;
while(qs_h<=zz_h&&qs_l<=zz_l){
if(qs_h!=zz_h&&qs_l!=zz_l){
for(int i=qs_l;i<=zz_l;i++){
printf("%d\n",sz[qs_h][i]);
}
for(int i=qs_h+1;i<=zz_h;i++){
printf("%d\n",sz[i][zz_l]);
}
for(int i=zz_l-1;i>=qs_l;i--){
printf("%d\n",sz[zz_h][i]);
}
for(int i=zz_h-1;i>=qs_h+1;i--){
printf("%d\n",sz[i][qs_l]);
}
}//???????
if(qs_h==zz_h&&qs_l!=zz_l){
if(h%2==1){
for(int i=qs_l;i<=zz_l;i++){
printf("%d\n",sz[qs_h][i]);
}
}//???
if(h%2==0){
for(int i=zz_l;i>=qs_l;i--){
printf("%d\n",sz[qs_h][i]);
}
}//???
}//????
if(qs_h!=zz_h&&qs_l==zz_l){
for(int i=qs_h;i<=zz_h;i++){
printf("%d\n",sz[i][qs_l]);
}
}//????
if(qs_h==zz_h&&qs_l==zz_l){
printf("%d\n",sz[qs_h][zz_h]);
}//????
qs_h++;
qs_l++;
zz_l--;
zz_h--;
}
return 0;
}
| 46 |
22,835 | 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 |
22,836 | int main()
{
int row,col,i,j,time=0;
int a[101][101]={0};
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0,j=0;;)
{
for(i++,j++;;j++)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
for(j=j-1,i=i+1;;i++)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
for(i--,j--;;j--)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
for(j++,i--;;i--)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
}
return 0;
} | 46 |
22,837 | int main()
{
int m,n;
int h,l,i;
int sz[100][100];
scanf("%d%d",&m,&n);
for(h=0;h<m;h++)
{
for(l=0;l<n;l++)
{
scanf("%d",&(sz[h][l]));
}
}
for(i=0;i<(m+1)/2&&i<(n+1)/2;i++)
{
for(l=i;l<n-1-i;l++)
{
printf("%d\n",sz[i][l]);
}
for(h=i;h<=m-1-i;h++)
{
printf("%d\n",sz[h][n-1-i]);
}
for(l=n-2-i;l>=i;l--)
{
if(i!=m-1-i&&i!=n-1-i)
{
printf("%d\n",sz[m-1-i][l]);
}
}
for(h=m-2-i;h>=1+i;h--)
{
if(i!=m-1-i&&i!=n-1-i)
{
printf("%d\n",sz[h][i]);
}
}
}
return 0;
}
| 46 |
22,838 | int main()
{
int x,y,k,sum;
int a[100][100];
int i,j;
int count;
scanf("%d %d",&x,&y);
count=0;
for(i=0;i<x;i++)
{
for(j=0;j<y;j++)
{
scanf("%d",&a[i][j]);
}
}
sum=x*y;
i=0;
j=0;
k=0;
while(count<sum)
{
for(j=0+k;j<y;j++)
{
printf("%d\n",a[i][j]);
}
count+=y-k;
if(count==sum)
break;
for(i=1+k;i<x;i++)
{
printf("%d\n",a[i][j-1]);
}
count+=x-1-k;
if(count==sum)
break;
y--;
for(j=y-1;j>=k;j--)
{
printf("%d\n",a[i-1][j]);
}
count+=y-k;
if(count==sum)
break;
x--;
for(i=x-1;i>k;i--)
{
printf("%d\n",a[i][j+1]);
}
count+=x-1-k;
k++;
i=k;
}
}
| 46 |
22,839 |
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 |
22,840 | 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 |
22,841 | //********************************
//*??????? **
//*????? 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 |
22,842 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int array[100][100];
for(int rr=0;rr<row;rr++){
for(int cc=0;cc<col;cc++){
scanf("%d",&array[rr][cc]);
}
}
for(int t=1;t<100;t++){
int leftc=t-1;
int rightc=col-t;
if(leftc<=rightc){
if(leftc==rightc){
}
for(int c=leftc;c<=rightc;c++){
if(c==0){
printf("%d",array[0][0]);
}else{
printf("\n%d",array[t-1][c]);
}
}
}else{
break;
}
int upr=t;
int downr=row-1-t;
if(upr<=downr){
for(int r=upr;r<=downr;r++){
printf("\n%d",array[r][col-t]);
}
}
if(upr-downr>=2){
break;
}
if(leftc<=rightc){
for(int c=rightc;c>=leftc;c--){
printf("\n%d",array[row-t][c]);
}
}
if(leftc==rightc){
break;
}
if(upr<=downr){
for(int r=downr;r>=upr;r--){
printf("\n%d",array[r][t-1]);
}
}
}
return 0;
} | 46 |
22,843 | int main()
{int row,col;
int i,j;
cin>>row>>col;
int a[101][101];
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
cin>>a[i][j];
}
}
int x;
for(x=0;x<=row&&x<=col;x++)
{
i=x;
if(x<=col-1-x)
{
for(j=x;j<=col-1-x;j++)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
j=j-1;
if(x+1<=row-1-x)
{
for(i=x+1;i<=row-1-x;i++)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
i=row-1-x;
if(x<=col-2-x)
{
for(j=col-2-x;j>=x;j--)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
j=x;
if(x+1<=row-2-x)
{
for(i=row-2-x;i>=x+1;i--)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
}
return 0;
}
| 46 |
22,844 |
int main(int argc, char *argv[])
{int array[100][100];
int row,col,i,j,rowmin,rowmax,colmin,colmax;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
rowmin=0;
rowmax=row-1;
colmin=0;
colmax=col-1;
while(colmin<colmax&&rowmin<rowmax){
for(i=colmin;i<colmax;i++)
printf("%d\n",array[rowmin][i]);
for(i=rowmin;i<rowmax;i++)
printf("%d\n",array[i][colmax]);
for(i=colmax;i>colmin;i--)
printf("%d\n",array[rowmax][i]);
for(i=rowmax;i>rowmin;i--)
printf("%d\n",array[i][colmin]);
rowmin++;
rowmax--;
colmin++;
colmax--;}
if(rowmin==rowmax&&colmin<colmax)
{for(i=colmin;i<=colmax;i++)
printf("%d\n",array[rowmin][i]);}
else if(rowmin<rowmax&&colmin==colmax)
{for(i=rowmin;i<=rowmax;i++)
printf("%d\n",array[i][colmin]);
}
else if(rowmin==rowmax&&colmin==colmax)
printf("%d\n",array[rowmin][colmax]);
return 0;
}
| 46 |
22,845 | int main()
{
int hangshu, lieshu, array[101][101], i, j;
cin >> hangshu >> lieshu;
for (i = 0; i < hangshu; i++)
for (j = 0; j < lieshu; j++)
cin >> array[i][j];
int count = 0;
int total = hangshu * lieshu;
lieshu--; hangshu--;
for (i = 0; i <= hangshu; i++)
{
for (j = i; j <= lieshu - i; j++)
{
cout << array[i][j] << endl;
count++;
}
if (count == total)
break;
for (j = i + 1; j <= hangshu - i; j++)
{
cout << array[j][lieshu - i] << endl;
count++;
}
if (count == total)
break;
for (j = lieshu - i - 1; j >= i; j--)
{
cout << array[hangshu - i][j] << endl;
count++;
}
if (count == total)
break;
for (j = hangshu - i - 1; j >= i + 1; j--)
{
cout << array[j][i] << endl;
count++;
}
if (count == total)
break;
}
return 0;
} | 46 |
22,846 | int main()
{
int u[100][100];
int m,n,i,j,x,y,k;
scanf("%d",&m);scanf("%d",&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&(u[i][j]));
}
}
y=(m<n)?m:n;
x=y/2;
if(y%2==0){
for(k=0;k<x;k++){
for(j=k;j<=n-2-k;j++){
i=k;
printf("%d\n",u[i][j]);
}
for(i=k;i<=m-2-k;i++){
j=n-1-k;
printf("%d\n",u[i][j]);
}
for(j=n-1-k;j>=k+1;j--){
i=m-1-k;
printf("%d\n",u[i][j]);
}
for(i=m-1-k;i>=k+1;i--){
j=k;
printf("%d\n",u[i][j]);
}
}
}
else{
for(k=0;k<x;k++){
for(j=k;j<=n-2-k;j++){
i=k;
printf("%d\n",u[i][j]);
}
for(i=k;i<=m-2-k;i++){
j=n-1-k;
printf("%d\n",u[i][j]);
}
for(j=n-1-k;j>=k+1;j--){
i=m-1-k;
printf("%d\n",u[i][j]);
}
for(i=m-1-k;i>=k+1;i--){
j=k;
printf("%d\n",u[i][j]);
}
}
if(m<=n){
for(j=x;j<=n-1-x;j++){
printf("%d\n",u[x][j]);
}
}
if(m>n){
for(i=x;i<=m-1-x;i++){
printf("%d\n",u[i][x]);
}
}
}
return 0;
} | 46 |
22,847 | int main()
{
int h,l,i,j,a,b,c,k=0,num[100][100];
cin>>h>>l;
for(i=0;i<h;i++)
for(j=0;j<l;j++)
cin>>num[i][j];
for(i=0;k<h*l;i++){
for(j=i;(j<l-i)&&(k<h*l);j++){
cout<<num[i][j]<<endl;k++;}
for(j=i+1;(j<h-i)&&(k<h*l);j++){
cout<<num[j][l-1-i]<<endl;k++;}
for(j=l-2-i;(j>=i)&&(k<h*l);j--){
cout<<num[h-1-i][j]<<endl;k++;}
for(j=h-2-i;(j>i)&&(k<h*l);j--){
cout<<num[j][i]<<endl;k++;}}
return 0;
}
| 46 |
22,848 | 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 |
22,849 | 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 |
22,850 | int main()
{
int row, col, num[100][100], count;
int r, l;
int i, j, k;
cin >> row >> col;
count = row * col;
for (i = 1; i <= row; i++) // i???
{
for (j = 1; j <= col; j++) // j???
{
cin >> num[i][j];
}
} // end for
int r1, r2, l1, l2;
r1 = 1;
r2 = row;
l1 = 1;
l2 = col;
while ((r1 <= r2) && (l1 <= l2))
{
int flag = 0;
for (l = l1; l <= l2; l++)
{
cout << num[r1][l];
count--; // count?????????
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
for (r = r1 + 1; r <= r2; r++)
{
cout << num[r][l2];
count--;
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
for (l = l2 - 1; l >= l1; l--)
{
cout << num[r2][l];
count--;
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
for (r = r2 - 1; r > r1; r--)
{
cout << num[r][l1];
count--;
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
else
{
r1++;
r2--;
l1++;
l2--;
}
} // end while
return 0;
}
| 46 |
22,851 | 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 |
22,852 | 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 |
22,853 | 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 |
22,854 | int main(){
int sz[100][100],row,col;
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,sx_row=row-1;
int xx_col=0,sx_col=col-1;
int k,n;
while(xx_row<sx_row&&xx_col<sx_col){
for(k=xx_col;k<=sx_col-1;k++){
printf("%d\n",sz[xx_row][k]);
}
for(n=xx_row;n<=sx_row-1;n++){
printf("%d\n",sz[n][sx_col]);
}
for(k=sx_col;k>=xx_col+1;k--){
printf("%d\n",sz[sx_row][k]);
}
for(n=sx_row;n>=xx_row+1;n--){
printf("%d\n",sz[n][xx_col]);
}
xx_col++;
sx_col--;
xx_row++;
sx_row--;
}
if(sx_row==xx_row){
for(k=xx_col;k<=sx_col;k++){
printf("%d\n",sz[sx_row][k]);
}
}else
if(xx_row==sx_col){
for(n=xx_row;n<=sx_row;n++){
printf("%d\n",sz[n][sx_col]);
}
}
return 0;
} | 46 |
22,855 | int main()
{
int array[100][100], a, b, p, q, i, j, k = 1, x = 1;
cin >> a >> b;
for (i = 0; i <= a - 1; i++)
{
for (j = 0; j <= b - 1; j++)
{
cin >> array[i][j];
}
}
for (q = 0, p = b - 1; p >= 0, q <= a - 1; p--, q++)
{
for (i = b - 1 - p; i <= p; i++)
{
if (array[q][i] == -1)
{
break; k = 0;
}
cout << array[q][i] << endl << endl;
array[q][i] = -1;
}
for (i = q + 1; i <= a - 1 - q; i++)
{
if (array[i][p] == -1)
{
break; k = 0;
}
cout << array[i][p] << endl << endl;
array[i][p] = -1;
}
for (i = p - 1; i >= b - 1 - p; i--)
{
if (array[a - 1 - q][i] == -1)
{
break; k = 0;
}
cout << array[a - 1 - q][i] << endl << endl;
array[a - 1 - q][i] = -1;
}
for (i = a - 2 - q; i >= q; i--)
{
if (array[i][b - 1 - p] == -1)
{
break; k = 0;
}
cout << array[i][b - 1 - p] << endl << endl;
array[i][b - 1 - p] = -1;
}
for (i = 0; i <= a - 1; i++)
{
for (j = 0; j <= b - 1; j++)
{
if (array[i][j] != -1)
x = x * 0;
}
}
if (x == 1)
break;
x = 1;
}
return 0;
}
| 46 |
22,856 | 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 |
22,857 | 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 |
22,858 |
int main()
{
int row,col,i,j,k,l,m;
int a[100][100];
int b[10000];
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 ; i++ )
{
for( j=i ; j<col-i ; j++ )
{
cout<<a[i][j]<<endl;
if( j==col-i-1 )
{
for( k=i+1 ; k<row-i ; k++ )
{
cout<<a[k][j]<<endl;
if( k==row-i-1 )
{
for( l=col-i-2 ; l>=i ; l-- )
{
cout<<a[k][l]<<endl;
if( l==i )
{
for( m=row-i-2 ; m>i ; m-- )
{
cout<<a[m][l]<<endl;
}
}
}
}
}
}
}
}
} | 46 |
22,859 | int main()
{
int i,j,m,n,a[100][100];
int shang,xia,zuo,you;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
shang=0;
zuo=0;
xia=m-1;
you=n-1;
while(zuo<=you&&(shang<=xia)){
if(zuo!=you&&shang!=xia){
for(i=shang,j=zuo;j<=you;j++){
printf("%d\n",a[i][j]);
}
for(j=you,i=shang+1;i<=xia;i++){
printf("%d\n",a[i][j]);
}
for(i=xia,j=you-1;j>=zuo;j--){
printf("%d\n",a[i][j]);
}
for(i=xia-1,j=zuo;i>shang;i--){
printf("%d\n",a[i][j]);
}
}
else if(zuo==you&&shang!=xia){
for(j=zuo,i=shang;i<=xia;i++){
printf("%d\n",a[i][j]);
}
}
else if(shang==xia&&zuo!=you){
for(i=shang,j=zuo;j<=you;j++){
printf("%d\n",a[i][j]);
}
}
else if(shang==xia&&zuo==you){
i=shang;j=zuo;
printf("%d\n",a[i][j]);
}
zuo++,shang++,you--,xia--;
}
return 0;
}
| 46 |
22,860 | int main()
{
int a[101][101],i,j,k=0,l=1,m,n,c,d;//???????
cin>>m>>n;//?????????
c=m,d=n;//?m,n????c,d
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];//??????
j=0;//?j=0
while(j<c*d)//?j<c*d?
{
for(i=l;i<=n;i++)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[k+1][i]<<endl;//??a[k+1][i]
j=j+1;//j=j+1
}
for(k=i-1,i=l+1;i<=m;i++)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[i][k]<<endl;//??a[i][k]
j=j+1;//j=j+1
}
for(k=i-1,i=n-1;i>=l;i--)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[k][i]<<endl;//??a[k][i]
j=j+1;//j=j+1
}
for(k=i+1,i=m-1;i>=l+1;i--)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[i][k]<<endl;//??a[i][k]
j=j+1;//j=j+1
}
n=n-1;m=m-1;l=l+1;
}
return 0;
} | 46 |
22,861 | 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 |
22,862 | /*
* CR.cpp
*
* Created on: 2012-11-15
* Author: sony
*/
int a,b;
int x[101][101];
int p;
int sum;
void read(int start,int a,int b)
{
int v,h;
int i;
v = start;h = start;
if (a == 0 || b == 0)return;
if (a == 1 && b == 1){cout <<x[v][h] <<endl;return;}
for (i = 1;i <= b-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
h ++;
}
for (i = 1;i <= a-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
v ++;
}
for (i = 1;i <= b-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
h --;
}
for (i = 1;i <= a-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
v --;
}
read(v+1,a-2,b-2);
}
int main()
{
int j,r;
sum = 0;
cin >>a >>b;
p = a*b;
for (j = 1;j <= a;j ++)
for (r = 1;r <= b;r ++)
cin >>x[j][r];
read(1,a,b);
return 0;
} | 46 |
22,863 | 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 |
22,864 |
int main()
{
int a[100][100], b[100][100], row, col, p, q, dir;
cin >> row >> col;
for (int i = 0; i < 100; i++)
{
for (int i1 = 0; i1 < 100; i1++)
{
b[i][i1] = 1;
}
}
for (int i = 0; i < row; i++)
{
for (int i1 = 0; i1 < col; i1++)
{
cin >> a[i][i1];
b[i][i1] = 0;
}
}
p = 0;
q = 0;
dir = 1;
for (int i = 0; i < row * col; i++)
{
cout << a[p][q] << endl;
b[p][q] = 1;
switch(dir)
{
case 1:
if (b[p][q+1] == 0) q++;
else
{
p++;
dir = 2;
}
break;
case 2:
if (b[p+1][q] == 0) p++;
else
{
q--;
dir = 3;
}
break;
case 3:
if (b[p][q-1] == 0) q--;
else
{
p--;
dir = 4;
}
break;
case 4:
if (b[p-1][q] == 0) p--;
else
{
q++;
dir = 1;
}
break;
}
}
return 0;
} | 46 |
22,865 | int main()
{
int i,j,det[100][100],ROW,COL,row1,row2,col1,col2,count=0;
scanf("%d%d",&ROW,&COL);
for(j=0;j<ROW;j++){
for(i=0;i<COL;i++){
scanf("%d",&det[j][i]);
}
}
row1=0;
row2=ROW-1;
col1=0;
col2=COL-1;
while(row2>=row1&&col2>=col1){
for(i=col1;i<=col2;i++){
printf("%d\n",det[row1][i]);
count++;
} //verforward
if(count==ROW*COL){
break;
}
for(j=(row1+1);j<=row2;j++){
printf("%d\n",det[j][col2]);
count++;
} //hordown
if(count==ROW*COL){
break;
}
for(i=col2-1;i>=col1;i--){
printf("%d\n",det[row2][i]);
count++;
} //verbackward
if(count==ROW*COL){
break;
}
for(j=(row2-1);j>=(row1+1);j--){
printf("%d\n",det[j][col1]);
count++;
} //horup
col1++;
col2--;
row1++;
row2--;
}
return 0;
} | 46 |
22,866 | 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 |
22,867 | 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 |
22,868 | int main()
{
int a[110][110],row,col,i,j=0,k=0,geshu=0,zong;
scanf("%d %d",&row,&col);
zong=row*col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
j=0;i=0;
while(col>=1&&row>=1)
{
if(geshu==zong) break;
for(j=k;j<col;j++)
{
printf("%d\n",a[k][j]);
geshu+=1;
}
if(geshu==zong) break;
for(i=k+1;i<=(row-1);i++)
{
printf("%d\n",a[i][col-1]);
geshu+=1;
}
if(geshu==zong) break;
for(j=col-2;j>=k;j--)
{
printf("%d\n",a[row-1][j]);
geshu+=1;
}
if(geshu==zong) break;
for(i=row-2;i>=(k+1);i--)
{
printf("%d\n",a[i][k]);
geshu+=1;
}
row-=1;
col-=1;
k+=1;
}
return 0;
} | 46 |
22,869 | int main()
{
int row,col,r,c;
int i,j,times;
int x,y;
int a[120][120];
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
for(j=1;j<=col;j++)
scanf("%d",&a[i][j]);
r=row;
c=col;
times=0;
x=1;
y=0;
while(times<r*c)
{
if(col!=0)
{
for(i=1;i<=col;i++)
{
printf("%d\n",a[x][y+i]);
times++;
}
y+=col;
row--;
if(times==r*c)
col=row=0;
}
if(row!=0)
{
for(i=1;i<=row;i++)
{
printf("%d\n",a[x+i][y]);
times++;
}
x+=row;
col--;
if(times==r*c)
col=row=0;
}
if(col!=0)
{
for(i=1;i<=col;i++)
{
printf("%d\n",a[x][y-i]);
times++;
}
y-=col;
row--;
if(times==r*c)
col=row=0;
}
if(row!=0)
{
for(i=1;i<=row;i++)
{
printf("%d\n",a[x-i][y]);
times++;
}
x-=row;
col--;
if(times==r*c)
col=row=0;
}
}
return 0;
}
| 46 |
22,870 | int main(){
int m,n,sz[100][100],x,y,z,f,g,w,k;
scanf("%d %d",&m,&n);
for(int p=0;p<m;p++){
for(int q=0;q<n;q++){
scanf("%d",&sz[p][q]);
}
}
for( x=0;x<m/2&&x<n/2;x++){
for( y=x;y<n-1-x;y++){
printf("%d\n",sz[x][y]);
}
for( z=x;z<m-1-x;z++){
printf("%d\n",sz[z][y]);
}
for( f=n-1-x;f>x;f--){
printf("%d\n",sz[z][f]);
}
for( g=m-1-x;g>x;g--){
printf("%d\n",sz[g][f]);
}
}
if(m%2==1&&n>=m){
w=m/2;
for(k=w;k<n-w;k++){
printf("%d\n",sz[w][k]);
}
}
else if(n%2==1&&m>n){
w=n/2;
for(k=w;k<m-w;k++){
printf("%d\n",sz[k][w]);
}
}
return 0;
} | 46 |
22,871 | int main()
{
int row,col,m,n,p,q,i,j;
int a[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<=row-1;i++)
for(j=0;j<=col-1;j++)
scanf("%d",&a[i][j]);
m=0;
p=0;
n=row-1;
q=col-1;
while((n-m>1)&&(q-p)>1)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
for(i=m+1;i<=n;i++)
printf("%d\n",a[i][q]);
for(i=q-1;i>=p;i--)
printf("%d\n",a[n][i]);
for(i=n-1;i>=m+1;i--)
printf("%d\n",a[i][p]);
m++;
p++;
n--;
q--;
}
if(n==m)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
}
else if(n==m+1)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
for(i=q;i>=p;i--)
printf("%d\n",a[n][i]);
}
else if(p==q)
{
for(i=m;i<=n;i++)
printf("%d\n",a[i][p]);
}
else if(q==p+1)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
for(i=m+1;i<=n;i++)
printf("%d\n",a[i][q]);
for(i=q-1;i>=p;i--)
printf("%d\n",a[n][i]);
for(i=n-1;i>=m+1;i--)
printf("%d\n",a[i][p]);
}
return 0;
} | 46 |
22,872 |
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!=0)
{
printf("\n");
}
}
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)
{
printf("\n");
}
}
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)
{
printf("\n");
}
}
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
time++;
if(time!=row*col)
{
printf("\n");
}
}
if(time==row*col)break;
}
return 0;
}
| 46 |
22,873 |
void f(int x,int y,int a[][100])
{
int i,j;
if(x*y==0||x<0||y<0) //???????
return;
if(x==1||y==1)
{
for(i=0;i<x;i++)
for(j=0;j<y;j++)
{
cout<<a[i][j]<<endl;
}
return;
}
int b[100][100];
for(j=0;j<y;j++) //????
cout<<a[0][j]<<endl;
for(i=1;i<x;i++)
cout<<a[i][y-1]<<endl;
for(j=y-2;j>=0;j--)
cout<<a[x-1][j]<<endl;
for(i=x-2;i>0;i--)
cout<<a[i][0]<<endl;
for(i=1;i<x-1;i++)
for(j=1;j<y-1;j++)
{
b[i-1][j-1]=a[i][j];
}
f(x-2,y-2,b); //????????
return;
}
int main()
{
int x,y,a[100][100],i,j;
cin>>x>>y; //????
for(i=0;i<x;i++)
for(j=0;j<y;j++)
cin>>a[i][j];
if(x==1||y==1)
for(i=0;i<x;i++)
for(j=0;j<y;j++)
cout<<a[i][j]<<endl;
else
f(x,y,a);
return 0;
}
| 46 |
22,874 |
int main()
{
int i,j,m,n,r,c,k,sz[100][100],time=0;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&sz[i][j]);
}
}
for(i=0,j=0,m=r-1,n=c-1;i<=m&&j<=n;i++,j++,m--,n--){
for(k=j;k<=n;k++){
printf("%d\n",sz[i][k]);
time+=1;
}
if(time==r*c)break;
for(k=i+1;k<=m;k++){
printf("%d\n",sz[k][n]);
time+=1;
}
if(time==r*c)break;
for(k=n-1;k>=j;k--){
printf("%d\n",sz[m][k]);
time+=1;
}
if(time==r*c)break;
for(k=m-1;k>=i+1;k--){
printf("%d\n",sz[k][j]);
time+=1;
}
if(time==r*c)break;
}
return 0;
} | 46 |
22,875 | 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 |
22,876 |
int main()
{
int n,row,col;
int i,j,a[ROW][COL]={0},time=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
/*
int width = col;
int height = row;
for ( int i = 0; i <= (row - 1) / 2; i++){
if ( height <= 0 || width <= 0 )
break;
for( int j = 0; j < width; j++)
printf("%d\n", a[i][j+i]);
if ( height == 1)
break;
for( int j = 1; j < height - 1; j++)
printf("%d\n", a[j+i][i+width-1]);
for( int j = width - 1; j >= 0; j--)
printf("%d\n", a[i+height-1][j+i]);
if( width == 1)
break;
for( int j = height - 2; j > 0; j--)
printf("%d\n", a[j+i][i]);
width -= 2;
height -= 2;
}
*/
for(n=0; n <= ( row - 1)/2;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",a[n][i]);
}
if ( 2*n +1 == row)
break;
for(i=n+1;i<row-n-1;i++)
{
printf("%d\n",a[i][col-n-1]);
}
for(j=col-n-1;j>=n;j--)
{
printf("%d\n",a[row-n-1][j]);
}
if ( 2*n +1 == col)
break;
for(j=row-n-2;j>n;j--)
{
printf("%d\n",a[j][n]);
}
}
return 0;
} | 46 |
22,877 | int main()
{
int row,col;
int time=0;
int i,j;
int a[100][100];
int x1,x2,y1,y2;
scanf("%d %d",&row,&col);
x1=y1=1;
x2=row;
y2=col;
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
scanf("%d",&a[i][j]);
}
while(time<row*col)
{
for(i=y1;i<=y2;i++)
{
if (time==row*col) break;
printf("%d\n",a[x1][i]);
time++;
}
for(i=x1+1;i<=x2;i++)
{
if(time==row*col) break;
printf("%d\n",a[i][y2]);
time++;
}
for(i=y2-1;i>=y1;i--)
{
if(time==row*col) break;
printf("%d\n",a[x2][i]);
time++;
}
for(i=x2-1;i>=x1+1;i--)
{
if(time==row*col) break;
printf("%d\n",a[i][y1]);
time++;
}
x1++;
x2--;
y2--;
y1++;
}
return 0;
} | 46 |
22,878 | //???? ??? 12858
int main()
{
int i,j,c,dirx,diry,x,y,row,col,step; //dirx,diry???? x,y????? step????????
int a[101][101],b[101][101]; //a??????,b??????????
cin >> row >> col;
for (i = 1;i <= row; i++)
for (j = 1;j <= col; j++)
{
cin >> a[i][j];
b[i][j] = 1;
}
x = 1;y = 0;dirx = 0;diry = 1; //??????????
step = 0;
while (step < (col * row))
{
while (b[x + dirx][y + diry] == 1) //?????
{
x += dirx;y += diry;
b[x][y] = 0;
step++;
cout << a[x][y] << endl;
}
if ((dirx == 1) && (diry == 0)) //???????
{
dirx = 0;diry = -1;
}
else
if ((dirx == 0) && (diry == 1))
{
dirx = 1;diry = 0;
}
else
if ((dirx == -1) && (diry == 0))
{
dirx = 0;diry = 1;
}
else if ((dirx == 0) && (diry == -1))
{
dirx = -1;diry = 0;
}
}
return 0;
}
| 46 |
22,879 | //******************
//???2 **
//?????? **
//???2013.11.1 **
//******************
int main()
{
int row, col, num[200][200], a, b, c, c1, x, y;
cin >> row >> col;
for ( int i = 1; i <= row; i++ )
for ( int j = 1; j <= col; j++ )
cin >> num[i][j];
x = y = 1;
c1 = 0;
c = row * col;
for ( ;x <= row; )
{
for ( a = x; a <= col; a++ )
{
if ( c1 == c ) break;
cout << num[x][a] << "\n";
c1++;
}
a--;
for ( b = y + 1; b <= row; b++ )
{
if ( c1 == c ) break;
cout << num[b][a] << "\n";
c1++;
}
b--;
for ( a--; a >= x; a-- )
{
if ( c1 == c ) break;
cout << num[b][a] << "\n";
c1++;
}
a++;
b--;
for ( ; b > y; b-- )
{
if ( c1 == c ) break;
cout << num[b][a] << "\n";
c1++;
}
x++;
y++;
row--;
col--;
}
return 0;
} | 46 |
22,880 | 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 |
22,881 | int main()
{
int row, col, n = 0;
int i, j;
int a[100 + 10][100 + 10] = {0};
cin >> row >> col;
for (i = 0; i < row; i ++)
for (j = 0; j < col; j ++)
cin >> a[i][j];
i = 0; j = 0;
int buttom = row, right = col, left = 0, top = 0;
for (;;)
{
while(j <= right - 1)
{n ++; cout << a[i][j ++] << endl;}
if (n == col * row) break;
j --; i ++; top ++;
while(i <= buttom - 1)
{n ++; cout << a[i ++][j] << endl;}
if (n == col * row) break;
i --; j --; right --;
while(j >= left)
{n ++; cout << a[i][j --] << endl;}
if (n == col * row) break;
j ++; i --; buttom --;
while(i >= top)
{n ++; cout << a[i --][j] << endl;}
if (n == col * row) break;
i ++; j ++; left ++;
}
return 0;
} | 46 |
22,882 | int main()
{
int m,n,a[100][100];
int p,i,j,k,q,s,ys,hs;
scanf("%d%d",&m,&n);
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
if(m<=n)
{
p=m/2;
ys=m%2;
hs=1;
}
else
{
p=n/2;
ys=n%2;
hs=2;
}
for(i=1;i<=p;i++)
{
for(j=i;j<=n-i;j++)
{
printf("%d\n",a[i][j]);
}
for(k=i;k<=m-i;k++)
{
printf("%d\n",a[k][n+1-i]);
}
for(q=n-i+1;q>=i+1;q--)
{
printf("%d\n",a[m+1-i][q]);
}
for(s=m+1-i;s>=i+1;s--)
{
printf("%d\n",a[s][i]);
}
}
if(ys==1)
{
if(hs==1)
{
for(i=(m+1)/2;i<=n-(m-1)/2;i++)
{
printf("%d\n",a[(m+1)/2][i]);
}
}
if(hs==2)
{
for(i=(n+1)/2;i<=m-(n-1)/2;i++)
{
printf("%d\n",a[i][(n+1)/2]);
}
}
}
return 0;
}
| 46 |
22,883 | 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 |
22,884 | int main()
{
int a[100][100]={0},row,col,i=0,j=0,t=0,s=0,isRow,isCol;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
i=0;
j=0;
do
{
for(j=t;j<col-t;j++)
printf("%d\n",a[i][j]);
j-=1;
isRow = 0;
for(i=s+1;i<row-s;i++)
{
printf("%d\n",a[i][j]);
isRow = 1;
}
if( isRow== 0 ) break;
i-=1;
t+=1;
isCol = 0;
for(j=col-t-1;j>=s;j--)
{
printf("%d\n",a[i][j]);
isCol = 1;
}
if( isCol== 0 ) break;
j+=1;
s+=1;
for(i=row-s-1;i>=t;i--)
printf("%d\n",a[i][j]);
i+=1;
}
while(t!=col && s!=row);
return 0;
} | 46 |
22,885 | int main(){
int row,col,m,n;
int sz[105][105],e[105][105];
scanf("%d %d",&m,&n);
for(row=0;row<m;row++){
for(col=0;col<n;col++){
scanf("%d",&sz[row][col]);
}
}
while(m>0&&n>0){
if(m>1&&n>1){
for(col=0;col<n;col++){
printf("%d\n",sz[0][col]);
}
for(row=1;row<m;row++){
printf("%d\n",sz[row][n-1]);
}
for(col=n-2;col>=0;col--){
printf("%d\n",sz[m-1][col]);
}
for(row=m-2;row>=1;row--){
printf("%d\n",sz[row][0]);
}
for(row=0;row<m;row++){
for(col=0;col<n;col++){
e[row][col]=sz[row][col];
}
}
}else if(m==1){
for(col=0;col<n;col++){
printf("%d\n",sz[0][col]);
}
}else{
for(row=0;row<m;row++){
printf("%d\n",sz[row][0]);
}
}
m-=2;
n-=2;
for(row=0;row<m;row++){
for(col=0;col<n;col++){
sz[row][col]=e[row+1][col+1];
}
}
}
return 0;
} | 46 |
22,886 |
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 |
22,887 | int main()
{
int array[200][200],row,col,i,j,cnt = 0,sum = 0;
cin >> row >> col;
for (i = 0;i < row;i++)
for (j = 0;j < col;j++)
{
cin >> array[i][j];
}
i = 0;
j = 0;
while (cnt < row * col)
{
for (;j <= col - 1 - sum;j++)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
j--;
i++;
for (;i <= row - 1 - sum;i++)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
i--;
j--;
for (;j >= sum;j--)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
i--;
j++;
for (;i > sum;i--)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
i++;
j++;
sum++;
}
return 0;
}
| 46 |
22,888 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int sz[100][100];
int p,q;
for(p=0;p<row;p++)
{
for(q=0;q<col;q++)
{
scanf("%d",&sz[p][q]);
}
}
int ROW,COL;
int row1=0,row2=row-1;
int col1=0,col2=col-1;
for(;(row1<=row2)&&(col1<=col2);)
{
if((row1<=row2)&&(col1<=col2))
{
for(COL=col1;COL<=col2;COL++)
{
printf("%d\n",sz[row1][COL]);
}
row1=row1+1;
}
if((row1<=row2)&&(col1<=col2))
{
for(ROW=row1;ROW<=row2;ROW++)
{
printf("%d\n",sz[ROW][col2]);
}
col2=col2-1;
}
if((row1<=row2)&&(col1<=col2))
{
for(COL=col2;COL>=col1;COL--)
{
printf("%d\n",sz[row2][COL]);
}
row2=row2-1;
}
if((row1<=row2)&&(col1<=col2))
{
for(ROW=row2;ROW>=row1;ROW--)
{
printf("%d\n",sz[ROW][col1]);
}
col1=col1+1;
}
}
return 0;
}
| 46 |
22,889 | void main()
{
int a[100][100];
int rowm,coln,i,j,row,col;
rowm=1;
coln=0;
scanf("%d %d",&row,&col);
for(i=1;i<=row;i++)
for(j=1;j<=col;j++)
scanf("%d",&a[i][j]);
i=1;j=0;
while(1){
if(coln>=col) break;
for(i=rowm,j++;j<=col;j++)
printf("%d\n",a[i][j]);
coln++;
if(rowm>=row) break;
for(j=col,i++;i<=row;i++)
printf("%d\n",a[i][j]);
rowm++;
if(coln>=col) break;
for(i=row,j--;j>=coln;j--)
printf("%d\n",a[i][j]);
col--;
if(rowm>=row) break;
for(j=coln,i--;i>=rowm;i--)
printf("%d\n",a[i][j]);
row--;
}
} | 46 |
22,890 | 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 |
22,891 | int main()
{
int row,col,i,j,l,p,q,count;
int a[100][100];
cin>>row>>col;
p=(row+1)/2;
q=(col+1)/2;
count=0;
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
}
if(row<=col&&row%2==1)
{
for(i=1;i<=row/2;i++)
{
for(j=i;j<=col-i+1;j++)
{cout<<a[i][j]<<endl;count++;}
for(l=i+1;l<=row-i+1;l++)
{cout<<a[l][col-i+1]<<endl;count++;}
for(j=col-i;j>=i;j--)
{cout<<a[row-i+1][j]<<endl;count++;}
for(l=row-i;l>=i+1;l--)
{cout<<a[l][i]<<endl;count++;}
}
for(j=(row+1)/2;j<=col-(row-1)/2;j++)
{cout<<a[p][j]<<endl;}
}
else if(row>col&&col%2==1)
{
for(i=1;i<=col/2;i++)
{
for(j=i;j<=col-i+1;j++)
{cout<<a[i][j]<<endl;count++;}
for(l=i+1;l<=row-i+1;l++)
{cout<<a[l][col-i+1]<<endl;count++;}
for(j=col-i;j>=i;j--)
{cout<<a[row-i+1][j]<<endl;count++;}
for(l=row-i;l>=i+1;l--)
{cout<<a[l][i]<<endl;count++;}
}
for(i=(col+1)/2;i<=row-(col-1)/2;i++)
{cout<<a[i][q]<<endl;}
}
else
{
for(i=1;i<=row/2;i++)
{
if(count==row*col)break;
else
{
for(j=i;j<=col-i+1;j++)
{cout<<a[i][j]<<endl;count++;}
for(l=i+1;l<=row-i+1;l++)
{cout<<a[l][col-i+1]<<endl;count++;}
for(j=col-i;j>=i;j--)
{cout<<a[row-i+1][j]<<endl;count++;}
for(l=row-i;l>=i+1;l--)
{cout<<a[l][i]<<endl;count++;}
}
}
}
return 0;
} | 46 |
22,892 | 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 |
22,893 | 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 |
22,894 |
int a[104][104],n=0;
int row,col,i,j,s;
int out(int ai,int aj,int bi,int bj)
{
int i,j;
for (i=aj;i<=bj;i++) {printf("%d\n",a[ai][i],n); n++;}
for (i=ai+1;i<=bi;i++) {printf("%d\n",a[i][bj],n);n++;}
if (ai!=bi) {for (i=bj-1;i>aj;i--) {printf("%d\n",a[bi][i],n);n++;} }
if (aj!=bj) {for (i=bi;i>ai;i--) {printf("%d\n",a[i][aj],n);n++;} }
// printf(" %d******%d %d \n",n,ai,aj);
if (n!=s) out(ai+1,aj+1,bi-1,bj-1);
return 0;
}
int main()
{
scanf("%d %d",&row,&col);
s=row*col;
for (i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}}
out(1,1,row,col);
return 0;
}
| 46 |
22,895 | 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 |
22,896 | //#define s 100
int main(){
int row ,col;
int ew[100][100];
int a,b,p,q;
int i,j;
int e,f;
int m,n;
int min=0;
scanf("%d%d",&row,&col);
e=row/2;
f=col/2;
for(i=0;i<=row-1;i++)
{
for(j=0;j<=col-1;j++)
{
scanf("%d",&ew[i][j]);
}
}
if(row%2==0&&col%2==0)
{
if(e>f)
{
min=f;
}
if(e<=f)
{
min=e;
}
}
if(row%2==1&&col%2==1){
if(e+1>f+1)
{
min=f+1;
}
if(e+1<=f+1)
{
min=e+1;
}
}
if(row%2==1&&col%2==0)
{
if(e+1>f)
{
min=f;
}
if(e+1<=f)
{
min=e+1;
}
}
if(row%2==0&&col%2==1)
{
if(e>f+1)
{
min=f+1;
}
if(e<=f+1)
{
min=e;
}
}
if((row%2==0&&col%2==0)||((row%2==1&&col%2==0)&&(e+1>f))||((row%2==0&&col%2==1)&&(f+1>e)))
{
for(i=0;i<=min-1;i++)
{
for(a=i;a<=col-i-2;a++)
{
printf("%d\n",ew[i][a]);
}
for(b=i;b<=row-i-2;b++)
{
printf("%d\n",ew[b][col-1-i]);
}
for(p=col-i-1;p>=i+1;p--)
{
printf("%d\n",ew[row-i-1][p]);
}for(q=row-1-i;q>=i+1;q--)
{
printf("%d\n",ew[q][i]);
}
}
}
if( ((col%2==1)&&(row%2==0)&&(f+1<=e)) || ((col%2==1)&&(row%2==1)&&(f+1<=e+1)))
{
for(i=0;i<=min-2;i++)
{
for(a=i;a<=col-i-2;a++)
{
printf("%d\n",ew[i][a]);
}
for(b=i;b<=row-i-2;b++)
{
printf("%d\n",ew[b][col-1-i]);
}
for(p=col-i-1;p>=i+1;p--)
{
printf("%d\n",ew[row-i-1][p]);
}for(q=row-1-i;q>=i+1;q--)
{
printf("%d\n",ew[q][i]);
}
}
for(m=min-1;m<=row-min;m++)
{
printf("%d\n",ew[m][f]);
}
}
if( ((row%2==1)&&(col%2==0)&&(e+1<=f)) || ( (row%2==1) && (col%2==1) && (e+1<f+1) ) )
{
for(i=0;i<=min-2;i++)
{
for(a=i;a<=col-i-2;a++)
{
printf("%d\n",ew[i][a]);
}
for(b=i;b<=row-i-2;b++)
{
printf("%d\n",ew[b][col-1-i]);
}
for(p=col-i-1;p>=i+1;p--)
{
printf("%d\n",ew[row-i-1][p]);
}for(q=row-1-i;q>=i+1;q--)
{
printf("%d\n",ew[q][i]);
}
}
for(n=min-1;n<=col-min;n++)
{
printf("%d\n",ew[e][n]);
}
}
return 0;
}
| 46 |
22,897 |
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 |
22,898 | 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 |
22,899 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.