id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
22,500 | void main()
{
int i,j,r,c,num=0,a[100][100],k;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
k=r*c;
for(i=0;;i++)
{
for(j=i;j<=c-1-i;j++)
{
printf("%d\n",a[i][j]);
num=num+1;
}
if(num==k)
break;
for(j=i+1;j<=r-1-i;j++)
{
printf("%d\n",a[j][c-i-1]);
num=num+1;
}
if(num==k)
break;
for(j=c-i-2;j>=i;j--)
{
printf("%d\n",a[r-1-i][j]);
num=num+1;
}
if(num==k)
break;
for(j=r-i-2;j>=(i+1);j--)
{
printf("%d\n",a[j][i]);
num=num+1;
}
if(num==k)
break;
}
}
| 46 |
22,501 | void main()
{
void shuru(int,int);
int row,col;
scanf("%d%d",&row,&col);
shuru(row-1,col-1);
}
void shuru(int x,int y)
{
void huixing(int (*p)[100],int,int,int);
int i,j,k,t;
int a[100][100];
int (*p)[100];
p=a;
for(i=0;i<=x;i++)
{
for(j=0;j<=y;j++)
{
scanf("%d",&a[i][j]);
}
}
if(x<y) t=x;
else t=y;
for(k=0;k<=t/2;k++)
{
huixing(p,k,x,y);
}
}
void huixing(int (*p)[100],int g,int h,int l)
{
int i,sum=0;
for(i=0;i<=l-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+g)+g+i));
sum=sum+1;
}
}
for(i=1;i<=h-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+g+i)+l-g));
sum=sum+1;
}
}
for(i=1;i<=l-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+h-g)+l-g-i));
sum=sum+1;
}
}
for(i=1;i<h-2*g;i++)
{
if(sum<(h-2*g+1)*(l-2*g+1))
{
printf("%d\n",*(*(p+h-g-i)+g));
sum=sum+1;
}
}
} | 46 |
22,502 |
int main ()
{
int a[105][105];
int m,n;
cin>>n>>m;
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
cin>>a[i][j];
int k = 0;
for(int t = 0; t < m * n; k ++)
{
for(int j1 = k; j1 < m - k; j1 ++)
{
cout<<a[k][j1]<<endl;
t ++;
}
for(int i1 = k + 1; i1 < n - k; i1 ++)
{
cout<<a[i1][m - 1 - k]<<endl;
t ++;
}
if( (k + 1 <= n - 1 - k) && ( m - 2 - k >= k) )
{
for(int j = m - 2 - k; j >= k; j --)
{
cout<<a[n - 1 - k][j]<<endl;
t ++;
}
for(int i = n - 2 - k; i >= k + 1; i --)
{
cout<<a[i][k]<<endl;
t ++;
}
}
}
return 0;
}
| 46 |
22,503 | void main()
{
int s[100][100],(*p)[100],i,j,b,a,w,q,k,t;
scanf("%d %d",&a,&b);
p=s;
for(i=0;i<=a-1;i++)
{
for(j=0;j<=b-1;j++)
{
scanf("%d",*(p+i)+j);
//printf("%d",*(*(p+i)+j));
}
}
t=0;
if(b!=1)
{for(i=0;i<=(a-1)/2;i++)
{
for(j=i;j<=b-1-i;j++)
{
if(t==0)
{
printf("%d",*(*(p+i)+j));
t=1;
}
else
{printf("\n%d",*(*(p+i)+j));
if(j==b-i-1)
{
for(k=i+1;k<=a-1-i;k++)
{
printf("\n%d",*(*(p+k)+j));
if(k==a-1-i)
{
for(q=b-i-2;q>=i;q--)
{
printf("\n%d",*(*(p+k)+q));
if(q==i)
{
for(w=a-i-2;w>=i+1;w--)
{
printf("\n%d",*(*(p+w)+q));
}
}
}
}
}
}
}
}
}
}
else
{
for(i=0;i<=a-1;i++)
{
for(j=0;j<=b-1;j++)
{
if(t!=0)
printf("\n%d",*(*(p+i)+j));
else
{printf("%d",*(*(p+i)+j));
t=1;}//printf("%d",*(*(p+i)+j));
}
}
}
} | 46 |
22,504 | 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 |
22,505 | //***************************
//**???2.cpp
//**??????
//**???2013.11.1
//**?????????????
//***************************
int main()
{
int a[100][100];
int row, col;
int n = 0; // n??????????
cin >> row >> col;
for (int i = 1; i <= row; i++)
for (int j = 1; j <= col; j++)
cin >> a[i][j];
for (int i = 1; i <= (row + 1) / 2; i++)
for (int j = i; j <= col + 1 - i; j++) // ???????
{
if (n == row * col) break; // ???????????????
cout << a[i][j] << endl;
n++; // ???????????
if (j == col + 1 - i)
for (int k = i + 1; k <= row + 1 - i; k++) // ????????????
{
if (n == row * col) break;
cout << a[k][j] << endl;
n++;
if (k == row + 1 - i)
for (int l = col - i; l >= i; l--) // ?????????????
{
if (n == row * col) break;
cout << a[k][l] << endl;
n++;
if (l == i)
for (int m = row - i; m >= 1 + i; m--) // ????????????
{
if (n == row * col) break;
cout << a[m][l] << endl;
n++;
} // ?????????????i??????????????i???????????????????
}
}
}
return 0;
} | 46 |
22,506 | 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 |
22,507 | 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 |
22,508 |
int main()
{
int row, col;
int i, j;
int Array[100][100];
int startRow = 0, startCol = 0, endRow, endCol;
int step = 1;
scanf("%d %d", &row, &col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d", &Array[i][j]);
endRow = row - 1;
endCol = col - 1;
while(startRow <= endRow && startCol <= endCol)
{
switch(step)
{
case 1:
for(j = startCol; j <= endCol; j++)
printf("%d\n", Array[startRow][j]);
step++;
startRow++;
break;
case 2:
for(i = startRow; i <= endRow; i++)
printf("%d\n", Array[i][endCol]);
step++;
endCol--;
break;
case 3:
for(j = endCol; j >= startCol; j--)
printf("%d\n", Array[endRow][j]);
step++;
endRow--;
break;
case 4:
for(i = endRow; i >= startRow; i--)
printf("%d\n", Array[i][startCol]);
step = 1;
startCol++;
break;
}
}
return 0;
} | 46 |
22,509 | 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 |
22,510 |
int main ()
{
int mat[100][100];
int i,j,row,col;
int m=0,n=0;
int count=0;
scanf("%d%d",&row,&col);
for(i=0;i<100;i++)
for(j=0;j<100;j++)
mat[i][j]=-1;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&mat[i][j]);
for(;;)
{
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
n++;
if(mat[m][n]==-1)
{
n--;
m++;
break;
}
}
if(count>=row*col)break;
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
m++;
if(mat[m][n]==-1)
{
m--;
n--;
break;
}
}
if(count>=row*col)break;
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
n--;
if(mat[m][n]==-1)
{
n++;
m--;
break;
}
}
if(count>=row*col)break;
for(;;)
{
printf("%d\n",mat[m][n]);
count++;
mat[m][n]=-1;
m--;
if(mat[m][n]==-1)
{
m++;
n++;
break;
}
}
if(count>=row*col)break;
}
return 0;
} | 46 |
22,511 | 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 |
22,512 | 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 |
22,513 | /*????????
?????
??????
???????????????*/
int main()
{
int hang,lie;
cin>>hang>>lie;//?????
int a[100][100];
int i,j;
for(i=1;i<=hang;i++)
{
for(j=1;j<=lie;j++) cin>>a[i][j]; //????
}
int sum=0,quan=1;
while(sum<hang*lie)
{
for(i=quan;i<=lie-quan+1;i++) {cout<<a[quan][i]<<endl; sum++;} if(sum==hang*lie) break; //????????????????????????
for(i=quan+1;i<=hang-quan+1;i++){cout<<a[i][lie-quan+1]<<endl; sum++;} if(sum==hang*lie) break;
for(i=lie-quan;i>=quan;i--) {cout<<a[hang-quan+1][i]<<endl; sum++;} if(sum==hang*lie) break;
for(i=hang-quan;i>=quan+1;i--){cout<<a[i][quan]<<endl; sum++;} if(sum==hang*lie) break;
quan++;
}
return 0;
} | 46 |
22,514 | int sum(int a,int b,int c){
int d=0,e;
for(e=1;e<=c;e++){
d=a+a+b+b-4*(2*e-1)+d;
}
return d;
}
int min(int a,int b,int c,int d){
if(a<b)
b=a;
if(b<c)
c=b;
if(c<d)
d=c;
return d;
}
int main(){
int a[100][100],s[10000];
int row,col,i,j,b,c,d,e;
int f,g,h;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++){
scanf("%d",&a[i][j]);
b=col-j;
c=row-i;
d=min(i-1,j-1,b,c);
e=sum(row,col,d);
f=i-d;
g=j-d;
if(f==1&&g>=1)
h=e+g;
else if(g==(col-2*d)&&f<=(row-2*d))
h=e+f+g-1;
else
h=e+row+col-1-4*d+col-2*d-g+row-2*d-f;
s[h]=a[i][j];
}
}
for(i=1;i<=row*col;i++)
printf("%d\n",s[i]);
return 0;
}
| 46 |
22,515 |
int main(int argc, char* argv[])
{int a[100][100],row,col,i,j,n=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
j=0;
do
{
for(i=0+j;i<col-j;i++)
{
printf("%d\n",a[j][i]);
n++;
}if(n==row*col)break;
for(i=j+1;i<row-j;i++)
{
printf("%d\n",a[i][col-1-j]);
n++;
}if(n==row*col)break;
for(i=col-2-j;i>0+j;i--)
{
printf("%d\n",a[row-j-1][i]);
n++;
}if(n==row*col)break;
for(i=row-j-1;i>0+j;i--)
{
printf("%d\n",a[i][j]);
n++;
}if(n==row*col)break;
j++;
}
while(n!=row*col);
return 0;
} | 46 |
22,516 | int main() {
int row,col;
int sz[100][100];
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int xx_row=0;
int sx_row=row-1;
int xx_col=0;
int sx_col=col-1;
while((xx_row<sx_row)&&(xx_col<sx_col)){
for(int i=xx_col;i<sx_col;i++){
printf("%d\n",sz[xx_row][i]);
}
for(int j=xx_row;j<sx_row;j++){
printf("%d\n",sz[j][sx_col]);
}
for(int k=sx_col;k>xx_col;k--){
printf("%d\n",sz[sx_row][k]);
}
for(int p=sx_row;p>xx_row;p--){
printf("%d\n",sz[p][xx_col]);
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;
}
if(xx_row==sx_row){
if(xx_col!=sx_col){
for(int i=xx_col;i<=sx_col;i++){
printf("%d\n",sz[xx_row][i]);
}
}
}
if(xx_col==sx_col){
for(int j=xx_row;j<=sx_row;j++){
printf("%d\n",sz[j][xx_col]);
}
}
return 0;
}
| 46 |
22,517 | // ????????
int main()
{
int m,n;
cin>>m>>n;
int a[m+1][n+1];
for (int i=1;i<=m;i++)
{
for (int j=1;j<=n;j++)
cin>>a[i][j];
}
int min;
if (m>=n) min=n;
else min=m;
for (int i=1;i<=(1+min)/2;i++)
{
for (int j=i;j<=n+1-i;j++)
{
if (a[i][j]!=-1)
{
cout<<a[i][j]<<endl;
a[i][j]=-1;
}
}
for (int j=i+1;j<=m+1-i;j++)
{
if (a[j][n+1-i]!=-1)
{
cout<<a[j][n+1-i]<<endl;
a[j][n+1-i]=-1;
}
}
for (int j=n-i;j>i;j--)
{
if (a[m+1-i][j]!=-1)
{
cout<<a[m+1-i][j]<<endl;
a[m+1-i][j]=-1;
}
}
for (int j=m+1-i;j>i;j--)
{
if (a[j][i]!=-1)
{
cout<<a[j][i]<<endl;
a[j][i]=-1;
}
}
}
return 0;
} | 46 |
22,518 | int main(){
int row,col,k,i,j;
int sz[100][100];
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=0; row-k>k && col-k>k; k++) {
for (i=k,j=k; j<col-k-1; j++) {
printf("%d\n", sz[i][j]);
}
for (; i<row-k-1; i++) {
printf("%d\n", sz[i][j]);
}
if (i==k || j==k) {
printf("%d\n", sz[i][j]);
break;
}
for (; j>k; j--) {
printf("%d\n", sz[i][j]);
}
for (; i>k; i--) {
printf("%d\n", sz[i][j]);
}
}
return 0;
}
| 46 |
22,519 | int main()
{
int a[100][100] = { 0 } , b[10000] = { 0 } ;
int r , l ;
int i , j = 0 , k = 0 ;
cin >> r >> l ;
int n = 0 , s = r - 1 , e = l - 1 , w = 0 ;
for ( i = 0 ; i < r ; i++ )
for ( j = 0 ; j < l ; j++ )
cin >> a[i][j] ;
i = 0 ;
while ( i <= r * l )
{
k = n ; j = w ;
for ( j = w ; j <= e ; j++ )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
}// j = e + 1
if ( i == r * l )
break ;
j-- ;
for ( k = n + 1 ; k <= s - 1 ; k++ )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
}// j=e , k = s - 1 ;
if ( i == r * l )
break ;
for ( j = e ; j >= w ; j-- )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
} // j = w - 1
if ( i == r * l )
break ;
j++ ;
for ( k = s - 1 ; k >= n + 1 ; k-- )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
}
// k = n
if ( i == r * l )
break ;
n++ ; s-- ; e-- ; w++ ;
}
return 0 ;
} | 46 |
22,520 | int main()
{
int a[100][100],i,j,n,m,flag[100][100]={0},k=0,l=0,num=0,sign=1;
cin>>n>>m;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>a[i][j];
}
}
while(num<m*n)
{
cout<<a[k][l]<<endl;
flag[k][l]=1;
num++;
if(sign==1)
{
if(l!=m-1&&flag[k][l+1]==0)
{
l++;
}
else
{
sign=2;
k++;
continue;
}
}
if(sign==2)
{
if(k!=n-1&&flag[k+1][l]==0)
{
k++;
}
else
{
sign=3;
l--;
continue;
}
}
if(sign==3)
{
if(l!=0&&flag[k][l-1]==0)
{
l--;
}
else
{
sign=4;
k--;
continue;
}
}
if(sign==4)
{
if(m!=0&&flag[k-1][l]==0)
{
k--;
}
else
{
sign=1;
l++;
continue;
}
}
}
return 0;
} | 46 |
22,521 | void main()
{
int i,j,t,a[100][100],m,n;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)for(j=0;j<n;j++)scanf("%d",&a[i][j]);
for(i=0,j=0;i<(m/2+m%2)&&j<(n/2+n%2);i++,j++)
{
for(t=j;t<n-j;t++)printf("%d\n",a[i][t]);
for(t=i+1;t<m-i;t++)printf("%d\n",a[t][n-j-1]);
if(i<m/2)for(t=n-j-2;t>=j;t--)printf("%d\n",a[m-i-1][t]);
if(j<n/2)for(t=m-i-2;t>=i+1;t--)printf("%d\n",a[t][j]);
}
}
//??????????rp??
| 46 |
22,522 | //********************************
//*???2.???????? **
//*?????? 1300017623 **
//*???2013.11.1 **
//********************************
int main()
{
int a[100][100];
int row, col, i, j;
cin >> row >> col;
int i1 = 0, i2 = row - 1, j1 = 0, j2 = col - 1;
for (i = 0; i < row ; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
while (1)
{
for (j = j1; j <= j2; j++)
cout << a[i1][j] << endl;
i1++;
if (i1 > i2)
break;
for (i = i1; i <= i2; i++)
cout << a[i][j2] << endl;
j2--;
if (j1 > j2)
break;
for (j = j2; j >= j1; j--)
cout << a[i2][j] << endl;
i2--;
if (i1 > i2)
break;
for (i = i2; i >= i1; i--)
cout << a[i][j1] << endl;
j1++;
if(i1 > i2)
break;
}
return 0;
} | 46 |
22,523 | int main()
{
int i,j,row,cow,a[100][100];
scanf("%d%d",&row,&cow);
for(i=0;i<row;i++)
{
for(j=0;j<cow;j++)
{
scanf("%d",&a[i][j]);
}
if(i!=row-1)
printf("\n");
}
i=0;
while(row-i-i>1&&cow-i-i>1)
{
for(j=i;j<cow-i;j++)
{
printf("%d\n",a[i][j]);
}
for(j=i+1;j<row-i;j++)
{
printf("%d\n",a[j][cow-i-1]);
}
for(j=cow-2-i;j>=i;j--)
{
printf("%d\n",a[row-1-i][j]);
}
for(j=row-2-i;j>=i+1;j--)
{
printf("%d\n",a[j][i]);
}
i++;
}
if(row-i-i==1)
{
for(j=i;j<cow-i;j++)
{
printf("%d\n",a[i][j]);
}
}
else if(cow-i-i==1)
{
for(j=i;j<row-i;j++)
{
printf("%d\n",a[j][i]);
}
}
return 0;
} | 46 |
22,524 | int main()
{
int array[100][100];
int row,col,m,n;
scanf("%d%d",&m,&n);
int a,x,y,z=0;
for(row=0;row<m;row++){
for(col=0;col<n;col++){
scanf("%d",&array[row][col]);
}
}
for(a=0;a<m+1/2&&a<n+1/2;a++){
x=m-a;
y=n-a;
for(col=a;col<y;col++){
printf("%d\n",array[a][col]);
z+=1;
}
if(z>=m*n){
break;
}
for(row=a+1;row<x;row++){
printf("%d\n",array[row][y-1]);
z+=1;
}
if(z>=m*n){
break;
}
for(col=y-2;col>a-1;col--){
printf("%d\n",array[x-1][col]);
z+=1;
}
if(z>=m*n){
break;
}
for(row=x-2;row>a;row--){
printf("%d\n",array[row][a]);
z+=1;
}
if(z>=m*n){
break;
}
}
return 0;
}
| 46 |
22,525 | int main()
{
int m,n,i,j,k,a,b,c;
int sz[100][100];
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&sz[i][j]);
}
}
for(i=0,a=0,b=1,j=0,k=0;i<m*n;i++,j+=a,k+=b)
{
printf("%d\n",sz[j][k]);
if(a==0&&b==1&&j+k==n-1)
{
a=1;
b=0;
}
else if(a==1&&b==0&&j-k==m-n)
{
a=0;
b=-1;
}
else if(a==0&&b==-1&&j+k==m-1)
{
a=-1;
b=0;
}
else if(a==-1&&b==0&&j-k==1)
{
a=0;
b=1;
}
}
return 0;
}
| 46 |
22,526 | int arr[100][100] = {0};
int pos[120][120] = {0};
int rr, cc;
void bianli(int, int, int, int);
int main()
{
int i, j;
cin >> rr;
cin >> cc;
for(i = 0; i < rr; i ++)
{
for (j = 0; j < cc; j ++)
{
cin >> arr[i][j];
pos[i][j] = 1;
}
}
bianli(0, 0, 0, 1);
return 0;
}
//0 ??? 1 ???
void bianli(int k, int ii, int jj, int s)
{
if(pos[ii][jj] == 0)
{
return;
}
int i, j;
//??
if(k == 0)
{
//??
if(s == 0)
{
for (j = jj; j >= 0; j --)
{
if(pos[ii][j] == 1)
{
cout << arr[ii][j] << endl;
pos[ii][j] = 0;
}
else
{
bianli(1, ii - 1, j + 1, 0);
return;
}
}
bianli(1, ii - 1, 0, 0);
return;
}
//??
else
{
for (j = jj; j < cc; j ++)
{
if(pos[ii][j] == 1)
{
cout << arr[ii][j] << endl;
pos[ii][j] = 0;
}
else
{
bianli(1, ii + 1, j - 1, 1);
return;
}
}
bianli(1, ii + 1, cc - 1, 1);
return;
}
}
//??
else
{
//??
if(s == 0)
{
for (i = ii; i >= 0; i --)
{
if(pos[i][jj] == 1)
{
cout << arr[i][jj] << endl;
pos[i][jj] = 0;
}
else
{
bianli(0, i + 1, jj + 1, 1);
return;
}
}
bianli(0, 0, jj + 1, 1);
return;
}
//??
else
{
for (i = ii; i < rr; i ++)
{
if(pos[i][jj] == 1)
{
cout << arr[i][jj] << endl;
pos[i][jj] = 0;
}
else
{
bianli(0, i - 1, jj - 1, 0);
return;
}
}
bianli(0, rr - 1, jj - 1, 0);
return;
}
}
return;
} | 46 |
22,527 | int main(){
int a[100][100],n,m,i,j,m1,m2,n1,n2,k;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&a[i][j]);
}
}
k=0;
m1=0;
m2=m-1;
n1=0;
n2=n-1;
loop:
for(j=m1;j<=m2;j++){
printf("%d\n",a[n1][j]);
k=k+1;
if(k==n*m){
goto end;
}
}
m2=m2-1;
for(i=n1+1;i<=n2;i++){
printf("%d\n",a[i][m2+1]);
k=k+1;
if(k==n*m){
goto end;
}
}
n2=n2-1;
for(j=m2;j>=m1;j--){
printf("%d\n",a[n2+1][j]);
k=k+1;
if(k==n*m){
goto end;
}
}
m1=m1+1;
for(i=n2;i>n1;i--){
printf("%d\n",a[i][m1-1]);
k=k+1;
if(k==n*m){
goto end;
}
}
n1=n1+1;
goto loop;
end:
return 0;
} | 46 |
22,528 |
int main(){
int row,col,r,c,a[100][100],s,n;
scanf("%d%d",&row,&col);
s=0;
for(r=0;r<row;r++){
for(c=0;c<col;c++){
scanf("%d",&a[r][c]);
}
}for(n=0;n<100;n++){
for(c=n;c<col-n;c++){
printf("%d\n",a[n][c]);
s++;
}
printf("\n");
if(s==row*col){
break;
}for(r=n+1;r<row-n;r++){
printf("%d\n",a[r][col-1-n]);
s++;
}printf("\n");
if(s==row*col)
break;
for(c=col-2-n;c>=n;c--){
printf("%d\n",a[row-1-n][c]);
s++;
}
printf("\n");
if(s==row*col)
break;
for(r=row-2-n;r>n;r--){
printf("%d\n",a[r][n]);
s++;
}printf("\n");
if(s==row*col){
break;
}
}
return 0;
} | 46 |
22,529 | int main(){
int a[100][100]={0},row,col,num=0;
cin>>row>>col;
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
cin>>a[i][j];
}
}
for(int i=0;;i++){
if(num>=row*col)break;
int b,x,y,z;
for(b=i;b<col-i;b++){
cout<<a[i][b]<<endl;
num++;
}
if(num>=row*col)break;
for(x=i+1;x<row-i;x++){
cout<<a[x][b-1]<<endl;
num++;
}
if(num>=row*col)break;
for(y=col-i-2;y>=i;y--){
cout<<a[row-i-1][y]<<endl;
num++;
}
if(num>=row*col)break;
for(z=row-i-2;z>i;z--){
cout<<a[z][i]<<endl;
num++;
}
}
return 0;
} | 46 |
22,530 | 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 |
22,531 | ///********************************
//*??????????? **
//*?????? 1300012745 **
//*???2013.11.1 **
//********************************
int main()
{
int a[100][100], row, col, i, j, //row????col????i,j????????row,col????????????????????????????????????
r, c; // r,c????????????????
cin >> row >> col;
for (i = 0; i <= row - 1; i++) //??????????????
for (j = 0; j <= col - 1; j++)
cin >> a[i][j];
r = 0;
c = -1; //??????????????????????????????????
while ((row >= 2) && (col >= 2)) //?????????2??????????????????????????????????
{
for (i = 1; i <= col; i++) //????col?????????
{
c++;
cout << a[r][c] << endl;
}
for (i = 1; i <= row - 1; i++) //??row-1????????
{
r++;
cout << a[r][c] << endl;
}
for (i = 1; i <= col - 1; i++) //???col-1
{
c--;
cout << a[r][c] << endl;
}
for (i = 1; i <= row - 2; i++) //??row-2?????????????????
{
r--;
cout << a[r][c] << endl;
}
col-=2; //???????????????2??2?
row-=2;
}
if ((row == 1) && (col != 1)) //?????????????????????????????????????????????????????
for (i = 1; i <= col; i++) //?????????
{
c++;
cout << a[r][c] << endl;
}
if ((col == 1) && (row != 1)) //???????
{
c++;
for (i = 1; i <= row; i++)
{
cout << a[r][c] << endl;
r++;
}
}
if ((row == 1) && (col == 1)) //??????????????row?col???????
cout << a[r][c+1];
cin.get();cin.get();
return 0;
}
| 46 |
22,532 | 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 |
22,533 | int main(){
int row,col,array[100][100],i,j,l,t,count1,count2; //??????????100?100???????
cin>>row>>col; //??row?col
for(i=0;i<row;i++) //????
for(j=0;j<col;j++)
cin>>array[i][j];
for(i=row-1,j=col-1,t=0,count1=row,count2=col;count1>0&&count2>0;count1=count1-2,count2=count2-2,t++) //???????t??????????count1?count2??????????????????????
{
/*cout<<"****"<<"count1="<<count1<<' '<<"count2="<<count2<<' '<<"t="<<t<<endl;
cout<<"l1="<<l<<endl;*/
for(l=t;l<j-t;l++) //???????????
{cout<<array[t][l]<<endl;
/*cout<<"***";*/
}
/*cout<<"l2="<<l<<endl;*/
for(l=t;l<i-t;l++) //??????
{cout<<array[l][j-t]<<endl;
/*cout<<"***2";*/}
if(count1!=1)
for(l=j-t;l>t;l--) //??????
{cout<<array[i-t][l]<<endl;
/*cout<<"***3";*/}
else if(count2!=1)cout<<array[i-t][j-t];
if(count2!=1)
for(l=i-t;l>t;l--) //??????
{ cout<<array[l][t]<<endl;
/*cout<<"***4";*/}
else if(count1!=1)cout<<array[i-t][t];
if(count1==1&&count2==1)
cout<<array[t][j-t];
/*cout<<'*'<<"count1="<<count1<<' '<<"count2="<<count2<<' '<<"t="<<t<<endl;*/
}
/*cout<<"**"<<"count1="<<count1<<' '<<"count2="<<count2<<' '<<"t="<<t<<endl;*/
return 0;
} | 46 |
22,534 | // *****************************************************************************
//*????????????.cpp
//*??;1300012725
//*?????2013.11
//*?????????????
//******************************************************************************
int main()
{
int a[200][200];
int r, c, i, j, p; //i,j?????????????????????p??????
cin >> r >> c;
for( i = 1; i <= r; i++ )
{
for( j = 1; j <= c; j++ )
{
cin >> a[i][j]; //??????
}
}
i = 1;
j = 1;
while( i <= r && j <= c )
{
for( p = j; p <= c; p++ )
{
cout << a[i][p] << endl; //??????????
}
for( p = i+1; p <= r;p++ )
{
cout << a[p][c] << endl; //??????????
}
for( p = c-1; p >= j && i != r && j != c; p-- )
{
cout << a[r][p] << endl; //??????????
}
for( p = r-1; p > i && i != r && j != c; p-- )
{
cout << a[p][j] << endl; //??????????
}
i++;
j++;
r--;
c--; //???????
}
return 0;
}
| 46 |
22,535 | int main()
{
int arrey [100][100];
int i, j, k, times, all;
int row, col;
cin >> row >> col;
for(i = 0; i < row; i ++)
for(j = 0; j < col ; j ++)
cin >> arrey[i][j];
k = 0;
times = 0;
all = row * col;
do{
i = k;
j = k;
for( ; j < col - 1; j ++)
{
cout << arrey[i][j] << endl;
times ++;
}
for( ; i < row - 1;i ++)
{
cout << arrey[i][j] << endl;
times ++;}
if( k < col - 1 && k < row - 1 )
{
for( ;j > k; j --)
{
cout << arrey[i][j] << endl;
times ++;
}
for( ;i > k; i --)
{
cout << arrey[i][j] << endl;
times ++;
}
}
else if( k == col - 1 && col == row )
{
cout << arrey[k][k];
times++;
}
else
{
cout << arrey[i][j];
times ++;
}
if( times == all)
break;
col --;
row --;
k ++;
}while(1);
return 0;
} | 46 |
22,536 | int main()
{
int array[101][101], pos[101][101] = {0};
int row, col, i, j, count = 0, n;
cin >> row >> col;
n = row * col;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
cin >> array[i][j];
pos[i][j] = 1;
}
}
i = 0;
j = 0;
while (1)
{
while (pos[i][j+1] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
j++;
count++;
}
if (count == n - 1) break;
while (pos[i+1][j] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
i++;
count++;
}
if (count == n - 1) break;
while (j >= 0 && pos[i][j-1] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
j--;
count++;
}
if (count == n - 1) break;
while (i >= 0 && pos[i-1][j] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
i--;
count++;
}
if (count == n - 1) break;
}
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
if (pos[i][j] == 1)
{
cout << array[i][j] << endl;
}
}
}
return 0;
} | 46 |
22,537 | void main()
{
int row,col,i,j,a[100][100],counter;
scanf("%d %d",&row,&col);
counter=row*col;
for(i=0;i<row;i++){
for(j=0;j<col;j++) scanf("%d",&a[i][j]);
}
row-=1;col-=1;
for(i=0;i<=row/2;i++)
{
for(j=i;j<=col-i;j++){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
j--;
for(i+=1;i<=row-(col-j);i++){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
i--;
for(j-=1;j>=row-i;j--){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
j++;
for(i-=1;i>j;i--){
printf("%d\n",a[i][j]);
counter--;
if(counter==0) goto end;
}
}
end:
;
} | 46 |
22,538 | int main()
{
int m,n;
scanf("%d%d",&m,&n);
int sz[m+2][n+2];
for(int i=0;i<m+2;i++)
{
for(int k=0;k<n+2;k++)
{
sz[i][k]=0;
}
}
for(int i=1;i<m+1;i++)
{
for(int k=1;k<n+1;k++)
{
scanf("%d",&sz[i][k]);
}
}
int i=1,j=1;
while(i<m+1&&j<n+1)
{
printf("%d\n",sz[i][j]);
sz[i][j]=0;
if(sz[i][j+1]!=0&&sz[i][j-1]==0&&sz[i-1][j]==0)
{
j++;
}
else if(sz[i+1][j]!=0&&sz[i][j+1]==0&&sz[i-1][j]==0)
{
i++;
}
else if(sz[i+1][j]==0&&sz[i][j-1]!=0&&sz[i][j+1]==0)
{
j--;
}
else if(sz[i][j-1]==0&&sz[i+1][j]==0&&sz[i-1][j]!=0)
{
i--;
}
else if(sz[i][j-1]==0&&sz[i+1][j]==0&&sz[i-1][j]==0&&sz[i][j+1]==0)
{
break;
}
}
return 0;
}
| 46 |
22,539 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int array[100][100];
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
int k,r,sum;
sum=row*col;
r=-1;
while(r<10000)
{
if(sum==1)
{
printf("%d",array[r+1][r+1]);
sum--;
}
if(sum==0)
{
break;
}
r++;
if(col>1)
{
for(k=r;k<col-1;k++)
{
printf("%d\n",array[r][k]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
if(row>1)
{
for(k=r;k<row-1;k++)
{
printf("%d\n",array[k][col-1]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
if(col>1)
{
for(k=col-1;k>r;k--)
{
printf("%d\n",array[row-1][k]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
if(row>1)
{
for(k=row-1;k>r;k--)
{
printf("%d\n",array[k][r]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
col--;
row--;
}
return 0;
}
| 46 |
22,540 | int main()
{
int a[100][100]={0},row,col,i=0,j=0,t=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]);
}
i=0;
j=0;
do
{
for(j=t;j<col-t;j++)
printf("%d\n",a[i][j]);
j-=1;
if(2*s+1==row) break;
for(i=s+1;i<row-s;i++)
printf("%d\n",a[i][j]);
i-=1;
t+=1;
if(col==t+s) break;
for(j=col-t-1;j>=s;j--)
printf("%d\n",a[i][j]);
j+=1;
s+=1;
if(row==s+t) break;
for(i=row-s-1;i>=t;i--)
printf("%d\n",a[i][j]);
i+=1;
if(col==2*t) break;
}
while(t!=col && s!=row);
return 0;
}
| 46 |
22,541 | 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 |
22,542 | int main()
{
int m,n,time=0;
cin>>m>>n;
int a[m][n];
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
cin>>a[i][j];
}
for(int i=0;;i++)
{
for(int j=i;j<=n-1-i;j++)
{
cout<<a[i][j]<<endl;
time++;
}
if(time==m*n)break;
for(int j=i+1;j<=m-1-i;j++)
{
cout<<a[j][n-i-1]<<endl;
time++;
}
if(time==m*n)break;
for(int j=n-i-2;j>=i;j--)
{
cout<<a[m-i-1][j]<<endl;
time++;
}
if(time==m*n)break;
for(int j=m-i-2;j>=i+1;j--)
{
cout<<a[j][i]<<endl;
time++;
}
if(time==m*n)break;
}
return 0;
}
| 46 |
22,543 | void main()
{
void toy(int b[100][100],int c,int d);
int a[100][100];
int n,m,i,j;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
}
toy(a,n,m);
}
void toy(int b[100][100],int c,int d)
{
int k,l,t;
if(c==1)
{for(k=0;k<d;k++)
printf("%d\n",b[0][k]);
}
else if(c==2)
{
for(k=0;k<d;k++)
printf("%d\n",b[0][k]);
for(k=d-1;k>=0;k--)
printf("%d\n",b[1][k]);
}
else if(d==1)
{
for(k=0;k<c;k++)
printf("%d\n",b[k][0]);
}
else if(d==2)
{
for(k=0;k<c;k++)
printf("%d\n",b[k][0]);
for(k=c-1;k>=0;k--)
printf("%d\n",b[k][1]);
}
else
{
for(k=0;k<d;k++)
printf("%d\n",b[0][k]);
for(k=1;k<c-1;k++)
printf("%d\n",b[k][d-1]);
for(k=d-1;k>=0;k--)
printf("%d\n",b[c-1][k]);
for(k=c-2;k>=1;k--)
printf("%d\n",b[k][0]);
for(l=0;l<c-2;l++)
{
for(t=0;t<d-2;t++)
b[l][t]=b[l+1][t+1];
}
toy(b,c-2,d-2);
}
} | 46 |
22,544 | /*
* 1104-1.cpp
*
* Created on: 2011-11-5
* Author: Administrator
*/
int main(){
int row,col;
cin>>row>>col;
int a[row][col];
int i,j,k,m,s=0;
m=row*col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>a[i][j];
for(i=0;i<row/2;i++){
for(j=i;j<col-i-1;j++){
if(s>=m)
break;
else{
cout<<a[i][j]<<endl;
s++;}
}
for(k=i;k<row-i-1;k++){
if(s>=m)
break;
else{
cout<<a[k][col-i-1]<<endl;
s++;}
}
for(j=col-i-1;j>i;j--){
if(s>=m)
break;
else{
cout<<a[row-1-i][j]<<endl;
s++;}
}
for(k=row-i-1;k>i;k--){
if(s>=m)
break;
else{
cout<<a[k][i]<<endl;
s++;}
}
}
if(row%2){
for(j=row/2;j<col-row/2;j++)
cout<<a[row/2][j]<<endl;
}
return 0;
}
| 46 |
22,545 | void main()
{
int a[100][100],i,j,t,row,col;
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<col;i++)
{
for(j=i;j<=col-1;j++)
{t=a[i][j];
printf("%d\n",a[i][j]);
}
for(j=i+1;j<=row-1;j++)
{t=a[j][col-1];
printf("%d\n",a[j][col-1]);
}
if(i>=row-1)
break;
if(i>=col-1)
break;
for(j=col-2;j>=i;j--)
{t=a[row-1][j];
printf("%d\n",a[row-1][j]);
}
for(j=row-2;j>i;j--)
{t=a[j][i];
printf("%d\n",a[j][i]);
}
row--;
col--;
}
} | 46 |
22,546 | int main()
{
int row, col, h, l, left, up; //????a
int a[110][110];
cin >> row >> col; //?????
for ( int i = 0; i < row; i++ ) //????????
{
for ( int j = 0; j < col; j++ )
cin >> a[i][j];
}
l = 0; //???
h = 0;
left = 0;
up = 0;
while ( left < col && up < row ) //???????????????????
{
for ( l = left; l < col - 1; l++ ) //???????????
{
cout << a[h][l] << endl;
}
for ( h = up; h < row - 1; h++ )
{
cout << a[h][l] << endl;
}
if ( ( up + 1 ) >= row ) //???????????
{
cout << a[h][col - 1];
break;
}
if ( ( left + 1 ) >= col )
{
cout << a[row - 1][l];
break;
}
for ( ; l > left; l-- )
{
cout << a[h][l] << endl;
}
for ( ; h > up; h-- )
{
cout << a[h][l] << endl;
}
left++; //????????
up++;
col--;
row--;
h = up;
}
return 0;
}
| 46 |
22,547 |
int main()
{
int sz[100][100],i,row,col,j,k=0,min;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
min=row;
if(row>col){
min=col;
}
while(k<(min+1)/2){
for(j=0+k;j<col-k;j++){
printf("%d\n",sz[0+k][j]);
}
for(i=1+k;i<row-k;i++){
printf("%d\n",sz[i][col-1-k]);
}
for(j=col-2-k;j>-1+k;j--){
if(row-1-k<=0+k){
break;
}
printf("%d\n",sz[row-1-k][j]);
}
for(i=row-2-k;i>k;i--){
if(k>=col-1-k){
break;
}
printf("%d\n",sz[i][k]);
}
k+=1;
}
return 0;
}
| 46 |
22,548 | 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 |
22,549 | int main ()
{
int array[100][100]; //??????array
int row, col; //?????
cin >> row >> col; //?????
for ( int i = 0; i < row; i ++ ) //????
for ( int j = 0; j < col; j ++ )
cin >> array[i][j];
int startrow = 0, startcol = 0; //??????????
int sum = 0; //???????????
while (true) //?????????????
{
for ( int i = startcol; i < col-startcol; i ++ )
{cout << array[startrow][i]<<endl;sum ++;}
if ( sum == row * col ) break;
for ( int i = startrow + 1; i < row-startrow; i ++ )
{cout << array[i][col-startcol-1]<<endl;sum ++;}
if ( sum == row * col ) break;
for ( int i = col-startcol-2; i > startcol; i -- )
{cout << array[row-startrow-1][i]<<endl;sum ++;}
if ( sum == row * col ) break;
for ( int i = row-startrow-1; i > startrow; i -- )
{cout << array[i][startcol]<<endl;sum ++;}
if ( sum == row * col ) break;
startrow ++; //????????????????
startcol ++;
}
return 0;
} | 46 |
22,550 | int main()
{
int a[100][100];
int h,s,i,j,m,z=0;
scanf("%d%d",&h,&s);
m=h*s;
for(i=0;i<h;i++)
{
for(j=0;j<s;j++)
scanf("%d",&a[i][j]);
}
for(i=0;;i++)
{
for(j=i;j<s-i;j++)
{
printf("%d\n",a[i][j]);
z++;
}
if(z==m)break;
for(j=i+1;j<h-i;j++)
{
printf("%d\n",a[j][s-1-i]);
z++;
}
if(z==m)break;
for(j=s-i-2;j>=i;j--)
{
printf("%d\n",a[h-i-1][j]);
z++;
}
if(z==m)break;
for(j=h-i-2;j>i;j--)
{
printf("%d\n",a[j][i]);
z++;
}
if(z==m)break;
}
} | 46 |
22,551 | //***********************************
//* ???????? *
//* ?????? *
//* ?????2011?11?5? *
//***********************************
int main()
{
int array[100][100];
int row, col, i, j, p, count;
cin >> row >> col;//???????
for(i = 0; i < row; i ++)
{
for(j = 0; j < col; j ++)
{
cin >> array[i][j];//??????
}
}
p = 0;//p???????????
count = 0;//count?????????
i = 0;
j = 0;
while(1)
{
for(j = count; j < col - count; j ++)
{
cout << array[i][j] << endl;
p = p + 1;
}//??????
if(p == row * col)
break;
for(i = count + 1; i < row - count; i ++)
{
cout << array[i][j - 1] << endl;
p = p + 1;
}//??????
if(p == row * col)
break;
for(j = col - count - 2; j >= count; j --)
{
cout << array[i - 1][j] << endl;
p = p + 1;
}//??????
if(p == row * col)
break;
for(i = row - count - 2; i > count; i --)
{
cout << array[i][j + 1] << endl;
p = p + 1;
}//??????
i = i + 1;
if(p == row * col)
break;//??????????????,??
count = count + 1;
}
return 0;
} | 46 |
22,552 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int sz[100][100];
int i,j;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int n,time=0;
i=0,j=0;
for(n=0;;n++){
for(;j<col-n;j++){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
j--;
i++;
for(;i<row-n;i++){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
i--;
j--;
for(;j>n-1;j--){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
j++;
i--;
for(;i>n;i--){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
i++;
j++;
}
return 0;
}
| 46 |
22,553 | int main(){
int tt[100][100];
int r,c;
scanf("%d%d",&r,&c);
for(int x=0;x<r;x++){
for(int y=0;y<c;y++){
scanf("%d",&tt[x][y]);
}
}
int i1=0,i2=c-1,i3=r-1,i4=0,m1=0,m2=1,m3=c-2,m4=r-2,n1=c-1,n2=r-1,n3=0,n4=1,j,s=0,a=1;
while(1){
for(j=m1;j<=n1&&a==1;j++){
printf("%d\n",tt[i1][j]);
s+=1;
if(s==r*c){a=0;}
}
m1++;n1--;i1++;
for(j=m2;j<=n2&&a==1;j++){
printf("%d\n",tt[j][i2]);
s+=1;
if(s==r*c){a=0;}
}
m2++;n2--;i2--;
for(j=m3;j>=n3&&a==1;j--){
printf("%d\n",tt[i3][j]);
s+=1;
if(s==r*c){a=0;}
}
m3--;n3++;i3--;
for(j=m4;j>=n4&&a==1;j--){
printf("%d\n",tt[j][i4]);
s+=1;
if(s==r*c){a=0;}
}
m4--;n4++;i4++;
if(a==0){break;}
}
return 0;
} | 46 |
22,554 | void main()
{
int m,n,i,j,min=1;
int a[100][100];
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
if(m>n) min=n;
else min=m;
for(i=0;i<min;i++)
{
for(j=0;j<n;j++)
{
if(a[i][j]>-1000)
{
printf("%d\n",a[i][j]);
a[i][j]=-10000;
}
else continue;
}
for(j=0;j<m;j++)
{
if(a[j][n-1-i]>-1000)
{
printf("%d\n",a[j][n-1-i]);
a[j][n-1-i]=-10000;
}
else continue;
}
for(j=n-1;j>=0;j--)
{
if(a[m-1-i][j]>-1000)
{
printf("%d\n",a[m-1-i][j]);
a[m-1-i][j]=-10000;
}
else continue;
}
for(j=m-1;j>=0;j--)
{
if(a[j][i]>-1000)
{
printf("%d\n",a[j][i]);
a[j][i]=-10000;
}
else continue;
}
}
} | 46 |
22,555 | int main()
{
int x,y,m,n,i,j,k=0;
cin>>x>>y;
m=x;
if (x>y)
m=y;
m=(m+1)/2;
int max[x][y];
for (i=0;i<x;i++)
for (j=0;j<y;j++)
{
cin>>max[i][j];
}
for (n=0;n<m;n++)
{
i=n;
for (j=n;j<y-n;j++)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
i=y-n;
j--;
for (i=n+1;i<x-n;i++)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
i--;
for (j--;j>n-1;j--)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
j++;
for (i--;i>n;i--)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
}
return 0;
}
| 46 |
22,556 | int a[102][102];
int flag[102][102];
int row;
int col;
int go(int f,int i,int j,int count)
{
if(count!=col*row)
{ cout<<a[i][j]<<endl;
flag[i][j]=1;
if(f==0)
{
if(flag[i][j+1]==0)
go(f,i,j+1,count+1);
else go((f+1)%4,i+1,j,count+1);
}
if(f==1)
{
if(flag[i+1][j]==0)
go(f,i+1,j,count+1);
else go((f+1)%4,i,j-1,count+1);
}
if(f==2)
{
if(flag[i][j-1]==0)
go(f,i,j-1,count+1);
else go((f+1)%4,i-1,j,count+1);
}
if(f==3)
{
if(flag[i-1][j]==0)
go(f,i-1,j,count+1);
else
go((f+1)%4,i,j+1,count+1);
}
}
return 0;
}
int main()
{
int i;
int j;
cin>>row>>col;
int turn=0;
for(i=1;i<=row;i++)
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
for(i=0;i<=col+1;i++)
{
flag[0][i]=1;
flag[row+1][i]=1;
}
for(i=0;i<=row+1;i++)
{
flag[i][0]=1;
flag[i][col+1]=1;
}
go(0,1,1,0);
} | 46 |
22,557 | int main(){
int row,col;
scanf("%d %d",&row,&col);
int array[100][100];
int i,j;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d" ,&array[i][j]);
}
}
int n,N;
int time=0;
int m1,m2;
m1=(int)ceil(1.0*row/2);
m2=(int)ceil(1.0*col/2);
if(m1<m2){
N=m1;
}
else{
N=m2;
}
for(n=0;n<N;n++){
for(j=n;j<col-n;j++){
if(time<row*col){
printf("%d\n",array[n][j]);
time++;
}
}
for(i=n+1;i<row-n;i++){
if(time<row*col){
printf("%d\n",array[i][col-n-1]);
time++;
}
}
for(j=col-n-2;j>=n;j--){
if(time<row*col){
printf("%d\n",array[row-n-1][j]);
time++;
}
}
for(i=row-n-2;i>n;i--){
if(time<row*col){
printf("%d\n",array[i][n]);
time++;
}
}
}
return 0;
} | 46 |
22,558 | int main()
{
int a[100][100]={0},row,col,x1,x2,y1,y2,i,j;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;;i++)
{
if(i>=((row+1)/2)) break;
if(i>=((col+1)/2)) break;
x1=i;x2=row-i-1;y1=i;y2=col-i-1;
for(y1=y1;y1<=y2;y1++)
{
printf("%d\n",a[x1][y1]);
}
y1=i;
for(x1=x1+1;x1<=x2;x1++)
{
printf("%d\n",a[x1][y2]);
}
x1=i;
if(x1<x2)
for(y2=y2-1;y2>=y1;y2--)
{
printf("%d\n",a[x2][y2]);
}
y2=col-1-i;
if(y1<y2)
for(x2=x2-1;x2>x1;x2--)
{
printf("%d\n",a[x2][y1]);
}
}
return 0;
}
| 46 |
22,559 | /*
* huixingbianli.cpp
*
* Created on: 2012-12-8
* Author: Lenovo
*/
int array[100][100];
int row,col;
void out(int beginx,int beginy,int r,int c)
{
if(r==0||c==0) return;
int x,y;
if(r==1)
{
for(x=beginx;x<beginx+c;x++)
cout<<array[beginy][x]<<endl;
return;
}
if(c==1)
{
for(y=beginy;y<beginy+r;y++)
cout<<array[y][beginx]<<endl;
return;
}
for(x=beginx;x<beginx+c;x++)
cout<<array[beginy][x]<<endl;
x--;
for(y=beginy+1;y<beginy+r;y++)
cout<<array[y][x]<<endl;
y--;
for(x=x-1;x>=beginx;x--)
cout<<array[y][x]<<endl;
x++;
for(y=y-1;y>beginy;y--)
cout<<array[y][x]<<endl;
beginx++;
beginy++;
r-=2;
c-=2;
out(beginx,beginy,r,c);
}
int main()
{
int row,col,i,j;
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j];
out(0,0,row,col);
return 0;
}
| 46 |
22,560 | int main()
{
int row,col,i,j,d=0,count=0;
int de[]={0,1,2,3};
scanf("%d%d",&row,&col);
int a[row][col],b[row][col];
for(i=0;i<row;i++)
{
for(j=0;j<col;j++){scanf("%d",&a[i][j]);b[i][j]=1;}
}
i=0;j=0;
for(count=0;count<row*col;count++)
{
printf("%d\n",a[i][j]);
b[i][j]=0;
switch(de[d])
{
case 0: j++;break;
case 1: i++;break;
case 2: j--;break;
case 3: i--;break;
}
if(i<0||i>=row||j<0||j>=col||b[i][j]==0)
{
switch(de[d])
{
case 0: j--;i++;break;
case 1: i--;j--;break;
case 2: j++;i--;break;
case 3: i++;j++;break;
}
d=(d+1)%4;
}
}
return 0;
} | 46 |
22,561 | int row,col,array[MAXN][MAXN],sign[MAXN][MAXN];
int main(){
memset(array,0,sizeof(array));
memset(sign,0,sizeof(sign));
cin>>row>>col;
for(int i=0;i<row;i++){
for(int j=0;j<col;j++) cin>>array[i][j];
}
int num=0,sxy=0,cxy=0,mrow=0,mcol=0;;//0==x,1==y;0==left->right/down;1==right/up
while(num<row*col){
if(sxy==0){
while(mcol<col&&mcol>=0){
if(sign[mrow][mcol]==0) {
cout<<array[mrow][mcol]<<endl;
num++;
}
sign[mrow][mcol]=1;
if(cxy==0){
if(mcol+1<col&&sign[mrow][mcol+1]==0) mcol++;
else break;
}
else{
if(mcol-1>=0&&sign[mrow][mcol-1]==0) mcol--;
else break;
}
}
sxy=1;
}
else{
while(mrow<row&&mrow>=0){
if(sign[mrow][mcol]==0){
cout<<array[mrow][mcol]<<endl;
num++;
}
sign[mrow][mcol]=1;
if(cxy==0){
if(mrow+1<row&&sign[mrow+1][mcol]==0) mrow++;
else break;
}
else{
if(mrow-1>=0&&sign[mrow-1][mcol]==0) mrow--;
else break;
}
}
sxy=0;
cxy=(cxy) ? 0 : 1;
}
}
} | 46 |
22,562 | int main(){
int a[100][100]={0},h,l,k,j;
scanf("%d%d",&h,&l);
for(k=0;k<h;k++){
for(j=0;j<l;j++)
scanf("%d",&a[k][j]);
}
int ph=0,pl=0;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;int cs=h*l;
for(int z=1;z<cs;z++){
if((ph==0||a[ph-1][pl]==0)&&a[ph][pl+1]!=0){
pl=pl+1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else if((pl==l-1||a[ph][pl+1]==0)&&a[ph+1][pl]!=0){
ph=ph+1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else if(a[ph+1][pl]==0&&pl!=0&&a[ph][pl-1]!=0){
pl=pl-1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else if((a[ph][pl-1]==0||ph==0)&&a[ph-1][pl]!=0){
ph=ph-1;
printf("%d\n",a[ph][pl]);
a[ph][pl]=0;
}
else break;
}
return 0;
} | 46 |
22,563 | int main(){
int b[100][100],Row,Col,n,i,k,l,row,col,s=0;
scanf("%d %d",&Row,&Col);
for(row=0;row<Row;row++){
for(col=0;col<Col;col++){
scanf("%d",&b[row][col]);
}
}
for(i=1;s<Row*Col;i=i+1){
s=s+(Row+Col-4*i+4)*2-4;
}
n=i-1;
s=0;
for(k=1;k<=n;k++){
for(l=k-1;l<=Col-k&&s!=Row*Col;l++){
printf("%d\n",b[k-1][l]);
s=s+1;
}
for(l=k;l<=Row-k&&s!=Row*Col;l++){
printf("%d\n",b[l][Col-k]);
s=s+1;
}
for(l=Col-k-1;l>=k-1&&s!=Row*Col;l--){
printf("%d\n",b[Row-k][l]);
s=s+1;
}
for(l=Row-k-1;l>=k&&s!=Row*Col;l--){
printf("%d\n",b[l][k-1]);
s=s+1;
}
}
return 0;
}
| 46 |
22,564 | /*
* ????????.cpp
*
* Created on: 2011-11-4
* Author: ???
*/
void hxprint(int a[][100],int n,int m){//??????????????????
int i,j,b[100][100];
if(n==0||m==0){//??????0???
return;
}
else{
for(j=0;j<m;j++)//????????
cout<<a[0][j]<<endl;
for(i=1;i<n;i++)
cout<<a[i][m-1]<<endl;
if(n==1||m==1) return;//?????????
else{
for(j=m-2;j>=0;j--)//????????????
cout<<a[n-1][j]<<endl;
for(i=n-2;i>=1;i--)
cout<<a[i][0]<<endl;
for(i=0;i<n-2;i++)
for(j=0;j<m-2;j++){
b[i][j]=a[i+1][j+1];
}
hxprint(b,n-2,m-2);//?????????
}
}
}
int main(){
int i,j,a[100][100],n,m;
cin>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>a[i][j];
hxprint(a,n,m);
return 0;
} | 46 |
22,565 | 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,566 | /*????????
* bookfee.cpp
*
* Created on: 2011-12-23
* Author: WJ
*/
int main() {
int a[101][101], i, j, row, col;
cin >> row >> col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
int up = 0, down = row - 1, left = 0, right = col - 1; //??????????
int c = row * col;//????????????????
while (c > 0) {
for (j = left; j <= right; j++) {
cout << a[up][j] << endl;
}
c -= right-left + 1;
if (c <= 0)
break;
up++;
for (i = up; i <= down; i++) {
cout << a[i][right] << endl;
}
c -= down - up + 1;
if (c <= 0)
break;
right--;
for (j = right; j >= left; j--) {
cout << a[down][j] << endl;
}
c -= right - left + 1;
if (c <= 0)
break;
down--;
for (i = down; i >= up; i--) {
cout << a[i][left] << endl;
}
c -= down - up + 1;
if (c <= 0)
break;
left++;
}
return 0;
}
| 46 |
22,567 | 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 |
22,568 | int main ()
{
int s[100][100];
int row,col;
int n=0,m=0,k;
int a=0,b=1;
int i,j;
scanf ("%d %d", &row, &col);
for (i=0;i<=row-1;i++)
{
for (j=0;j<=col-1;j++)
{
scanf ("%d", &s[i][j]);
}
}
k=row*col;
for (i=1;i<=k;i++)
{
printf ("%d\n", s[n][m]);
if (n==b-1 && m<col-1)
{
m=m+1;
}
else if (n<row-1 && m==col-1)
{
n=n+1;
}
else if (n==row-1 && m==col-1)
{
m=m-1;
}
else if (n==row-1 && m<col-1 && m>a)
{
m=m-1;
}
else if (n==row-1 && m==a)
{
n=n-1;
}
else if (n<row-1 && m==a && b<n)
{
n=n-1;
}
else if (n==b && m==a)
{
m=m+1;
a=a+1;
b=b+1;
row=row-1;
col=col-1;
}
}
return 0;
}
| 46 |
22,569 | int main()
{
int row, col;
cin >> row >> col;
int a[row][col];
int i, j;
int t = 0; //?????t?
for ( i = 0; i < row; i++ )
for ( j = 0; j < col; j++ )
cin >> a[i][j];
while ( (row > 2 * t) && (col > 2 * t) )
{
for ( i = t; i <= col - t - 1; i++ )
cout << a[t][i] << endl; //????
for ( i = t + 1; i <= row - t - 1; i++ )
cout << a[i][col - t - 1] << endl; //????
if ( col == 2 * t + 1 || row == 2 * t + 1) break;
for ( i = col - t - 2; i >= t + 1; i-- )
cout << a[row - t - 1][i] << endl; //????
for ( i = row - t - 1; i >= t + 1; i-- )
cout << a[i][t] << endl; //????
t++;
}
return 0;
} | 46 |
22,570 | int main()
{
int row,col,i,j,k;
int array[100][100];
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j];
if(row%2==0)
for(k=0;k<row/2;k++)
{
if(col-k-1==k)
{
for(i=k;i<row-k;i++)
cout<<array[i][k]<<endl;
break;
}
else
{if(col-k-1!=k)
for(i=k;i<col-k-1;i++)
cout<<array[k][i]<<endl;
if(k!=row-k-1)
for(i=k;i<row-k-1;i++)
cout<<array[i][col-k-1]<<endl;
else
cout<<array[k][col-k-1]<<endl;
if(col-k-1!=k&&k!=row-k-1)
for(i=col-k-1;i>k;i--)
cout<<array[row-k-1][i]<<endl;
if(k!=row-k-1&&col-k-1!=k)
for(i=row-k-1;i>k;i--)
cout<<array[i][k]<<endl;}
}
else
for(k=0;k<row/2+1;k++)
{
if(col-k-1==k)
{
for(i=k;i<row-k;i++)
cout<<array[i][k]<<endl;
break;
}
else
{if(col-k-1!=k)
for(i=k;i<col-k-1;i++)
cout<<array[k][i]<<endl;
if(k!=row-k-1)
for(i=k;i<row-k-1;i++)
cout<<array[i][col-k-1]<<endl;
else
cout<<array[k][col-k-1]<<endl;
if(col-k-1!=k&&k!=row-k-1)
for(i=col-k-1;i>k;i--)
cout<<array[row-k-1][i]<<endl;
if(k!=row-k-1&&col-k-1!=k)
for(i=row-k-1;i>k;i--)
cout<<array[i][k]<<endl;}
}
return 0;
} | 46 |
22,571 |
int main(){
int m,n,sz[100][100],x,y,z,a,b,w=0,i;
int bz[100][100],flag=0;
//bz????????flag=0?????=1?????=2?????=3????
scanf("%d %d",&m,&n);
for(int p=0;p<=m+1;p++)
for(int q=0;q<=n+1;q++)
bz[q][p]=1;//????
for(int p=1;p<=m;p++)
{
for(int q=1;q<=n;q++)
{
scanf("%d",&sz[q][p]);
bz[q][p]=0;
}
}
x=1;y=1;
while(w<m*n)
{
printf("%d\n",sz[x][y]);
bz[x][y]=1;
w++;
switch(flag)
{
case 0:
if(bz[x+1][y]==1)
{
flag=1;//???
y++;
}
else
x++;
break;
case 1:
if(bz[x][y+1]==1)
{
flag=2;//???
x--;
}
else
y++;
break;
case 2:
if(bz[x-1][y]==1)
{
flag=3;//???
y--;
}
else
x--;
break;
case 3:
if(bz[x][y-1]==1)
{
flag=0;//???
x++;
}
else
y--;
break;
}
}
return 0;
}
| 46 |
22,572 |
int main()
{
int i,j,h,l,x,y,k;
int a[hang][lie];
scanf("%d %d",&h,&l);
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d",&a[i][j]);
}
}
k=0;
x=0;
i=0;
while(k<(h*l)){
for(j=x;j<l;j++){
printf("%d\n",a[i][j]);
k++;
a[i][j]=-1;
y=j;
if(a[i][j+1]==-1){
break;
}
}
if(k==(h*l)){
break;
}
for(i=x+1;i<h;i++){
printf("%d\n",a[i][y]);
k++;
a[i][y]=-1;
x=i;
if(a[i+1][y]==-1){
break;
}
}
if(k==(h*l)){
break;
}
for(j=y-1;j>=0;j--){
printf("%d\n",a[x][j]);
k++;
a[x][j]=-1;
y=j;
if(a[x][j-1]==-1){
break;
}
}
if(k==(h*l)){
break;
}
for(i=x-1;i>=0;i--){
printf("%d\n",a[i][y]);
k++;
a[i][y]=-1;
x=i;
if(a[i-1][y]==-1){
break;
}
}
if(k==(h*l)){
break;
}
}
return 0;
}
| 46 |
22,573 | int main()
{
int hui[100][100];
int row,col;
int n,m,i;
int rowa,cola;
int T;
scanf("%d %d\n",&rowa,&cola);
if(rowa<cola){T=rowa;}else{T=cola;}
row=rowa-1;col=cola-1;
for(n=0;n<rowa;n++){
for(m=0;m<cola;m++){
scanf("%d",&hui[n][m]);
}
}
for(i=0;i<floor(T*0.5+0.5);){
for(n=i,m=i;n<row-i+1;){
if(m<col-i){
printf("%d\n",hui[n][m]);
m++;
}else{
printf("%d\n",hui[n][m]);
n++;
}
}
i++;
if(m>col/2&&n>row/2){
for(n=row-i+1,m=col-i;n>i-1;){
if(m>i-1){
printf("%d\n",hui[n][m]);
m--;
}else{
printf("%d\n",hui[n][m]);
n--;
}
}
}
}
return 0;
}
| 46 |
22,574 | int main(){
int row,col;
int a[110][110];
int i,j;
int r,l,u,d,cntr,cntc,g;
scanf("%d%d",&row,&col);
for (i=0;i<row;i++){
for (j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
r=0;
u=0;
l=row-1;
d=col-1;
cntr=0;
cntc=0;
i=0;
j=0;
g=0;
for(g=0;(g<=row/2+1)&&(g<=col/2+1);g++){
while ((cntr!=row)&&(cntc!=col)&&(cntr%2==0)&&(cntr-cntc==0)){
printf("%d\n",a[i][j]);
if (j==d){
r++;
cntr++;
i++;
}
else if(j!=d){
j++;
}
}
while((cntr!=row)&&(cntc!=col)&&(cntc%2==0)){
printf("%d\n",a[i][j]);
if (i==l){
d--;
cntc++;
j--;
}
else{
i++;
}
}
while((cntr!=row)&&(cntc!=col)&&(cntr%2!=0)){
printf("%d\n",a[i][j]);
if (j==u){
u++;
cntr++;
i--;
}
else{
j--;
}
}
while((cntr!=row)&&(cntc!=col)&&(cntc%2!=0)){
printf("%d\n",a[i][j]);
if (i==r){
l--;
cntc++;
j++;
}
else{
i--;
}
}
}
return 0;
} | 46 |
22,575 | 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;
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)
{
if(row>1)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i++;
state=1;
}
else
{
printf("%d\n",sz[i][j]);
break;
}
}
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)
{
if(col>1)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j--;
state=2;
}
else
{
printf("%d\n",sz[i][j]);
break;
}
}
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;
}
}
}
return 0;
}
| 46 |
22,576 | 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 |
22,577 | //********************************
//*???????????
//*??? ?? 1300012814 **
//*???2013.10,30 **
//********************************
int main()
{
int a[101][101], row, col, num = 0, m = 1, n = 0; //?????row????col????num????????????m?????????n????????
cin >> row >>col; //??????
for (int i = 0; i <= row + 1;i++)
{
for (int j = 0; j <= col + 1; j++)
{
if (i == 0||j == 0||i == row + 1||j == col +1)
a[i][j] = 0;
else cin >> a[i][j];
}
} //????????????????????????????0
int i = 1, j = 1;
while (num < col * row) //???????????????
{
cout << a[i][j] <<endl;
a[i][j] = 0;
num++; //??a[i][j]??????num++???????????0
if (a[i + n][m + j] == 0) //??????????0?????????
{
if (m != 0)
{
n = m;
m = 0;
} //m?????????????????????
else
{
m = -n;
n = 0;
} //n?????????????????????
}
i = i + n;
j = j + m; //???????????
}
return 0;
} | 46 |
22,578 | int main()
{
int l,m,n,k,i,j,sum,p,q;
int s[150][150]={0};
int a[150][150]={0};
scanf("%d %d",&m,&n);
for (i=0;i<m;i++)
for (j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
s[i][j]=1;
}
sum=m*n;i=0;j=0;p=0;q=1;
while (sum>0)
{
k=0;
while (s[i][j]==1)
{
printf("%d\n",a[i][j]);
s[i][j]=0;sum--;
i+=p;
j+=q;
}
if ((p==0)&&(q==1)&&(k==0))
{
p=1;
q=0;
i=i+1;
j=j-1;
k=1;
}
if ((p==1)&&(q==0)&&(k==0))
{
p=0;
q=-1;
i=i-1;
j=j-1;k=1;
}
if ((p==0)&&(q==-1)&&(k==0))
{
p=-1;
q=0;
j=j+1;
i=i-1;k=1;
}
if ((p==-1)&&(q==0)&&(k==0))
{
p=0;
q=1;
j=j+1;
i=i+1;
k=1;
}
}
return 0;
}
| 46 |
22,579 | int main(){
int ROW,COL,a[100][100];
scanf("%d%d",&ROW,&COL);
for(int row=0;row<ROW;row++){
for(int col=0;col<COL;col++){
scanf("%d",&a[row][col]);
}
}
for(int k=0;k<(ROW<COL?(ROW+1)/2:(COL+1)/2);k++){
for(int col=k;col<COL-k-1;col++){
printf("%d\n",a[k][col]);
}
for(int row=k;row<ROW-k-1;row++){
printf("%d\n",a[row][COL-k-1]);
}
for(int col=COL-k-1;(col>k)&&(k!=1.0*(ROW+1)/2-1);col--){
printf("%d\n",a[ROW-k-1][col]);
}
for(int row=ROW-k-1;(row>k)&&(k!=1.0*(COL+1)/2-1);row--){
printf("%d\n",a[row][k]);
}
}
if((ROW%2!=0&&ROW<=COL)||(COL%2!=0&&COL<=ROW)){
printf("%d",a[ROW-(ROW<COL?(ROW+1)/2:(COL+1)/2)][COL-(ROW<COL?(ROW+1)/2:(COL+1)/2)]);
}
return 0;
} | 46 |
22,580 | void main()
{
int row,col,a[100][100],i,j,p,q,k;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
if(row<col)
q=row;
else
q=col;
p=(q+1)/2;
if(row==col||q%2==0)
{
for(k=0;k<p;k++)
{
for(j=k;j<col-k;j++)
printf("%d\n",a[k][j]);
for(i=k+1;i<row-k;i++)
printf("%d\n",a[i][col-1-k]);
for(j=col-2-k;j>=k;j--)
printf("%d\n",a[row-1-k][j]);
for(i=row-2-k;i>k;i--)
printf("%d\n",a[i][k]);
}
}
if(row!=col&&q%2!=0)
{
if(col>row)
{
if(q==1)
{
for(j=0;j<col;j++)
printf("%d\n",a[0][j]);
}
else
{
for(k=0;k<p-1;k++)
{
for(j=k;j<col-k;j++)
printf("%d\n",a[k][j]);
for(i=k+1;i<row-k;i++)
printf("%d\n",a[i][col-1-k]);
for(j=col-2-k;j>=k;j--)
printf("%d\n",a[row-1-k][j]);
for(i=row-2-k;i>k;i--)
printf("%d\n",a[i][k]);
}
for(j=p-1;j<col-p+1;j++)
printf("%d\n",a[p-1][j]);
}
}
if (row>col)
{
if(q==1)
{
for(i=0;i<row;i++)
printf("%d\n",a[i][0]);
}
else
{
for(k=0;k<p-1;k++)
{
for(j=k;j<col-k;j++)
printf("%d\n",a[k][j]);
for(i=k+1;i<row-k;i++)
printf("%d\n",a[i][col-1-k]);
for(j=col-2-k;j>=k;j--)
printf("%d\n",a[row-1-k][j]);
for(i=row-2-k;i>k;i--)
printf("%d\n",a[i][k]);
}
for(j=p-1;j<row-p+1;j++)
printf("%d\n",a[j][p-1]);
}
}
}
}
| 46 |
22,581 | /*
* 1.cpp
*
* Created on: 2011-11-4
* Author: 11294
*/
int main() {
int row, col;
cin >> row >> col;
int array[row][col];
int i, j;
for (i = 0; i < row; i++) {
for (j = 0; j < col; j++) {
cin >> array[i][j];
}
}
int p = 0;
for (; !(2 * p >= col - 2 || 2 * p >= row - 2);) {
for (i = p; i <= col - 2 - p; i++) {
cout << array[p][i] << endl;
}
for (j = p; j <= row - 2 - p; j++) {
cout << array[j][col - 1 - p] << endl;
}
for (i = p; i <= col - 2 - p; i++) {
cout << array[row - 1 - p][col - i - 1] << endl;
}
for (j = p; j <= row - 2 - p; j++) {
cout << array[row - 1 - j][p] << endl;
}
p++;
}
if (col == row) {
for (i = p; i <= col - 1 - p; i++) {
cout << array[p][i] << endl;
}
if(col%2==0){
for (i = col - 1 - p; i >= p; i--) {
cout << array[p + 1][i] << endl;
}
}}
if (col > row) {
for (i = p; i <= col - 1 - p; i++) {
cout << array[p][i] << endl;
}
if(row%2==0){
for (i = col - 1 - p; i >= p; i--) {
cout << array[p + 1][i] << endl;
}
}}
if (col < row) {
for (i = p; i <= row - 1 - p; i++) {
cout << array[i][p] << endl;
}
if(col%2==0){
for ( i = row - 1 - p;i >= p; i--) {
cout << array[i][p+1] << endl;
}
}}
return 0;
}
| 46 |
22,582 | void main()
{
int array[100][100]={0},i,j,row,col,h=0,n,k,r,c,m;
scanf("%d%d",&row,&col);
r=row;
c=col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
if(r<=c)
{
n=(r*2-1)/4;
m=2*r-1;
}
else
{
n=(c*2)/4;
m=c*2;
}
for(k=0;k<n;k++)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
for(j=col-1,i=h+1;i<row;i++)
{
printf("%d\n",array[i][j]);
}
for(i=row-1,j=col-2;j>=h;j--)
{
printf("%d\n",array[i][j]);
}
for(j=h,i=row-2;i>=h+1;i--)
{
printf("%d\n",array[i][j]);
}
h++;
col--;
row--;
}
if(m%4==1)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
}
if(m%4==2)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
for(j=col-1,i=h+1;i<row;i++)
{
printf("%d\n",array[i][j]);
}
}
if(m%4==3)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
for(j=col-1,i=h+1;i<row;i++)
{
printf("%d\n",array[i][j]);
}
for(i=row-1,j=col-2;j>=h;j--)
{
printf("%d\n",array[i][j]);
}
}
}
| 46 |
22,583 | int main()
{
int row, col, i, j, k, l, circle = 0, num = 0;
cin >> row >> col;
int a[100][100];
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
while (true)
{
for (i = circle; i < col - circle; i++)
{
cout << a[circle][i] << endl;
num++;
}
if (num == row * col) break;
for (i--, j = circle + 1; j < row - circle; j++)
{
cout << a[j][i] << endl;
num++;
}
if (num == row * col) break;
for (j--, k = i - 1; k >= circle; k--)
{
cout << a[j][k] << endl;
num++;
}
if (num == row * col) break;
for (k++, l = j - 1; l > circle; l--)
{
cout << a[l][k] << endl;
num++;
}
if (num == row * col) break;
circle++;
}
return 0;
}
| 46 |
22,584 | int main()
{
int i,j,k=0,b=1,h=1,l=1,x,y,a[100][100];
scanf("%d%d",&x,&y);
for(i=1;i<=x;i++)
{for(j=1;j<=y;j++)
{scanf("%d",&a[i][j]);}}
while(k<x*y-1)
{switch(b)
{case 1:
{for(i=h;i<=y-h;i++)
{printf("%d\n",a[h][i]);}
b=2;
k+=y-2*h+1;break;}
case 2:
{for(i=l;i<=x-l;i++)
{printf("%d\n",a[i][y-l+1]);}
b=3;
k+=x-2*l+1;break;}
case 3:
{for(i=y-h+1;i>=h+1;i--)
{printf("%d\n",a[x-h+1][i]);}
b=4;
k+=y-2*h+1;
h++;break;}
case 4:
{for(i=x-l+1;i>=l+1;i--)
{printf("%d\n",a[i][l]);}
b=1;
k+=x-2*l+1;
l++;break;}}}
if(x==y)
{printf("%d",a[h][l]);}
else if(b==2){printf("%d",a[h][y-h+1]);}
else if(b==3){printf("%d",a[x-l+1][y-l+1]);}
else if(b==4){printf("%d",a[x-h+1][h]);}
else if(b==1){printf("%d",a[l][l]);}
return 0;
}
| 46 |
22,585 | int main()
{
int row,col,k,j;
int time=0;
cin>>row>>col;
int arr[100][100];
for(k=0;k<row;k++)
for(j=0;j<col;j++)
{
cin>>arr[k][j];
}
int i=0;
while(time<row*col)
{
for(k=i;k<col-i&&time<row*col;k++)
{
cout<<arr[i][k]<<endl;
time++;
}
for(k=i+1;k<row-i&&time<row*col;k++)
{
cout<<arr[k][col-i-1]<<endl;
time++;
}
for(k=col-i-2;k>=i&&time<row*col;k--)
{
cout<<arr[row-i-1][k]<<endl;
time++;
}
for(k=row-i-2;k>i&&time<row*col;k--)
{
cout<<arr[k][i]<<endl;
time++;
}
i++;
}
return 0;
} | 46 |
22,586 | int main()
{
int a[100][100];
int i,j,m,n,k,s=0,x,y;
double l=0;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
i=0;
for(j=0;j<n;j++)
{
printf("%d\n",a[i][j]);
s++;
if(s==m*n)
return 0;
}
i=0;
j=n-1;
for(k=1;k>0;k++)
{
for(x=m-k;x>0;x--)
{
i+=(int)pow(-1,l);
printf("%d\n",a[i][j]);
s++;
if(s==m*n)
return 0;
}
for(x=n-k;x>0;x--)
{
j+=(int)pow(-1,l+1);
printf("%d\n",a[i][j]);
s++;
if(s==m*n)
return 0;
}
l++;
}
}
| 46 |
22,587 | 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 |
22,588 | int main(int argc, char* argv[])
{
int array[100][100];
int n,row,col,i,j,k=0,r,t,x=0;
float m;
scanf("%d",&row);
scanf("%d",&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
if(row>col)
{
n=col;
}
else n=row;
m=(float)n;
while(k<m/2)
{
for(j=k;j<col-k;j++)
{
if(x!=row*col)
{
printf("%d\n",array[k][j]);
x++;
}
}
for(i=k+1;i<row-1-k;i++)
{
if(x!=row*col)
{
printf("%d\n",array[i][col-k-1]);
x++;
}
}
for(t=col-k-1;t>k;t--)
{
if(x!=row*col)
{
printf("%d\n",array[row-k-1][t]);
x++;
}
}
for(r=row-1-k;r>k;r--)
{
if(x!=row*col)
{
printf("%d\n",array[r][k]);
x++;
}
}
k++;
}
return 0;
}
| 46 |
22,589 | int main()
{
int row=0,col=0;
cin>>row>>col;
int array[101][101];
int i=0,j=0,k=0;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j];
for(k=0;(row-2*k>2)&&(col-2*k>2);k++){
for(j=k;j<col-k;j++)
cout<<array[k][j ]<<endl;
for(i=k+1;i<row-k;i++)
cout<<array[i][col-1-k]<<endl;
for(j=col-2-k;j>=k;j--)
cout<<array[row-1-k][j]<<endl;
for(i=row-2-k;i>=k+1;i--)
cout<<array[i][k]<<endl;
}
if(row==col){
for(j=k;j<col-k;j++)
cout<<array[k][j ]<<endl;
for(i=k+1;i<row-k;i++)
cout<<array[i][col-1-k]<<endl;
for(j=col-2-k;j>=k;j--)
cout<<array[row-1-k][j]<<endl;
for(i=row-2-k;i>=k+1;i--)
cout<<array[i][k]<<endl;
}
else{
for(j=k;j<col-k;j++)
cout<<array[k][j ]<<endl;
for(i=k+1;i<row-k;i++)
cout<<array[i][col-1-k]<<endl;
}
return 0;
}
| 46 |
22,590 | /*************************************
*file 2.cpp ******
*author ??? ****
*date 2013-11-1 ***
*description ???????? *
*************************************/
int main()
{
int row, col; //???????
cin >> row >> col;
int i, j, m, n; //?????????
int s = row * col, k=0; //s???????,k????
int a[200][200];
for(i = 1; i <= row; i++)
{
for(j = 1; j <= col; j++)
cin >> a[i][j];
}
//??????i,i???i,col-i+1???row-i+1,col-i+1???row-i+1,i?????i,i?
for(i = 1; (i <= col - i + 1) && (i <= row - i + 1); i++)
{
for(m = i; m <= col - i + 1 && (k - s); m++) //???k-s?????????????????????????????????
{
cout << a[i][m] << endl;
k++;
}
for(m = i + 1; m <= row - i + 1 && (k - s); m++)
{
cout << a[m][col - i + 1] << endl;
k++;
}
for(m = col - i; m >= i && (k - s); m--)
{
cout << a[row - i + 1][m] << endl;
k++;
}
for(m = row - i; m > i && (k - s); m--)
{
cout << a[m][i] << endl;
k++;
}
}
return 0;
} | 46 |
22,591 | int main()
{
int array[100][100],row,col,i,k,j,t=0;
scanf("%d%d",&row,&col);
int m=row*col;
for(i=0;i<row;i++)
{
for(k=0;k<col;k++)
{
scanf("%d",&array[i][k]);
}
}
for(j=0;;j++)
{
for(k=j;k<=col-1-j;k++)
{
printf("%d\n",array[j][k]);
t++;
}
if(t==m) break;
for(i=j+1;i<=row-1-j;i++)
{
printf("%d\n",array[i][col-j-1]);
t++;
}
if(t==m) break;
for(k=col-j-2;k>=j;k--)
{
printf("%d\n",array[row-j-1][k]);
t++;
}
if(t==m) break;
for(i=row-j-2;i>j;i--)
{
printf("%d\n",array[i][j]);
t++;
}
if(t==m) break;
}
return 0;
} | 46 |
22,592 |
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 |
22,593 | int a[100][100]={0};
int main()
{void p(char c,int b1,int b2,int b3,int b4);
int i,j,k,l,n,m;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
p('y',0,0,n-1,m-1);
}
void p(char c,int b1,int b2,int b3,int b4)
{
int i,j,k,l;
if(c=='y')
{for(i=b1;i<=b3;i++)
printf("%d\n",a[b2][i]);
if(b2!=b4)
p('x',b1,b2+1,b3,b4);}
if(c=='x')
{for(i=b2;i<=b4;i++)
printf("%d\n",a[i][b3]);
if(b1!=b3)
p('z',b1,b2,b3-1,b4);}
if(c=='z')
{for(i=b3;i>=b1;i--)
printf("%d\n",a[b4][i]);
if(b2!=b4)
p('s',b1,b2,b3,b4-1);}
if(c=='s')
{for(i=b4;i>=b2;i--)
printf("%d\n",a[i][b1]);
if(b1!=b3)
p('y',b1+1,b2,b3,b4);}
}
| 46 |
22,594 | int main()
{
int sz[100][100],i,j,h,l,zs=0,ys,yx,n,k=0;
scanf("%d %d",&h,&l);
ys=l-1;
yx=h-1;
n=h*l;
for(i=0;i<h;i++)
for(j=0;j<l;j++)
scanf("%d",&sz[i][j]);
while(k!=-1)
{
for(i=zs,j=zs;j<=ys;j++)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
for(j=ys,i=zs+1;i<=yx;i++)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
for(i=yx,j=ys-1;j>=zs;j--)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
for(i=yx-1,j=zs;i>zs;i--)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
zs++;ys--;yx--;
if(k==n)return 0;
}
return 0;
} | 46 |
22,595 | 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 |
22,596 | int a[2000][2000];
void print(int h,int l)
{
int i,j;
for(j=0;j<l;j++)
{printf("%d\n",a[0][j]);}
for(i=1;i<h;i++)
{printf("%d\n",a[i][l-1]);}
for(j=l-2;j>=0;j--)
{printf("%d\n",a[h-1][j]);}
for(i=h-2;i>0;i--)
{printf("%d\n",a[i][0]);}
}
void gai(int h,int l)
{
int i,j;
for(i=0;i<h-1;i++)
{
for(j=0;j<l-2;j++)
{
a[i][j]=a[i][j+1];
}
}
for(j=0;j<l-2;j++)
{
for(i=0;i<h-2;i++)
{
a[i][j]=a[i+1][j];
}
}
}
void main()
{
int i,j,h,l;
scanf("%d %d",&h,&l);
for(i=0;i<h;i++)
{
for(j=0;j<l;j++)
{
scanf("%d",&a[i][j]);
}
}
for( ;(h>1&&l>1);h=h-2,l=l-2)
{
print(h,l);
gai(h,l);
}
if(h==1&&l>1)
{
for(j=0;j<l;j++) printf("%d\n",a[0][j]);
}
else if(l==1&&h>1)
{
for(i=0;i<h;i++) printf("%d\n",a[i][0]);
}
else if(h==1&&l==1)
{
printf("%d\n",a[0][0]);
}
} | 46 |
22,597 | int main()
{
int m,n,h=1,v=0,i,j;
int array[100][100];
while(cin>>m>>n)
{
memset(array,0,sizeof(array));
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>array[i][j];
h=1;v=0;
while(m>0&&n>0)
{
if(m!=1&&n!=1)
{
for(i=1;i<=n;i++)
{
v++;
cout<<array[h][v]<<endl;
}
for(i=1;i<=m-1;i++)
{
h++;
cout<<array[h][v]<<endl;
}
for(i=1;i<=n-1;i++)
{
v--;
cout<<array[h][v]<<endl;
}
for(i=1;i<=m-2;i++)
{
h--;
cout<<array[h][v]<<endl;
}
m=m-2;
n=n-2;
}
else if(m==1)
{
for(i=1;i<=n;i++)
{
v++;
cout<<array[h][v]<<endl;
}
m=m-2;
n=n-2;
}
else
{
v++;
for(i=1;i<=m;i++)
{
cout<<array[h][v]<<endl;
h++;
}
m=m-2;
n=n-2;
}
}
}
return 0;
} | 46 |
22,598 |
int main()
{
int row,col;
int i,j,k,time=0;
scanf("%d%d",&row,&col);
int array[100][100];
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
for (k=0;;k++)
{
for (i=k;i<col-k;i++)
{
printf("%d\n",array[k][i]);
time++;
if(time==row*col)break;}
if(time==row*col)break;
for (j=k+1;j<row-k;j++)
{
printf("%d\n",array[j][col-k-1]);
time++;
if(time==row*col)break;}if(time==row*col)break;
for (i=col-2-k;i>=k;i--)
{
printf("%d\n",array[row-k-1][i]);
time++;
if(time==row*col)break;}if(time==row*col)break;
for (j=row-2-k;j>k;j--)
{
printf("%d\n",array[j][k]);
time++;
if(time==row*col)break;
}if(time==row*col)break;
}
return 0;
} | 46 |
22,599 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.