id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
22,600 | int main()
{
int n,m,a[1000][1000],i,j,s,q=0;
cin>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>a[i][j];
int flag=0;
for(i=0;;i++)
{
for(j=q;j<m-q;j++)
{
flag++;
cout<<endl<<a[i][j];
}
if(flag==n*m)
break;
j--;
for(s=i+1;s<n-q;s++)
{
flag++;
cout<<endl<<a[s][j];
}
if(flag==n*m)
break;
s--;
for(j=j-1;j>=q;j--)
{
flag++;
cout<<endl<<a[s][j];
}
if(flag==n*m)
break;
j++;
for(s=s-1;s>q;s--)
{
flag++;
cout<<endl<<a[s][j];
}
if(flag==n*m)
break;
q++;
}
return 0;
}
| 46 |
22,601 | void Matrix(int a[100][100],int srow,int scol,int erow,int ecol)
{
int i,j;
for(i=scol;i<=ecol;i++)
printf("%d\n",a[srow][i]);
for(i=srow+1;i<=erow;i++)
printf("%d\n",a[i][ecol]);
if(erow>srow)
for(i=ecol-1;i>=scol;i--)
printf("%d\n",a[erow][i]);
if(ecol>scol)
for(i=erow-1;i>=srow+1;i--)
printf("%d\n",a[i][scol]);
if(erow-srow>=2&&ecol-scol>=2)
Matrix(a,srow+1,scol+1,erow-1,ecol-1);
}
main()
{
int a[100][100],i,j,m,n;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
Matrix(a,0,0,m-1,n-1);
} | 46 |
22,602 | int main()
{
int row, col, array[100][100], i, j, k, min, flag;
cin >> row >> col;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
cin >> array[i][j];
}
}
min = (row < col) ? row : col;
for (k = 0; 2 * k < min; k++)
{
flag = 0;
for (i = 1 + k; i <= col - k; i++)
cout << array[1 + k][i] << endl;
for (j = 2 + k; j <= row - k; j++)
{cout << array[j][col - k] << endl; flag=1;}
if(flag)
{flag=0;
for (i = col - k - 1; i >= 1 + k; i--)
{cout << array[row - k][i] << endl;flag=1;}
if(flag)
for (j =row - k - 1; j >= 1 + k + 1; j--)
cout << array[j][1 + k] << endl;
}
}
return 0;
}
| 46 |
22,603 | int main(){
int a[100][100],r,c,m,n;
scanf("%d%d",&r,&c);
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
scanf("%d",&a[i][j]);
}
}
for(int k=0;r-k>k&&c-k>k;k++){
for(m=k,n=k;n<c-k-1;n++){
printf("%d\n",a[m][n]);
}
for(m=k;m<r-k-1;m++){
printf("%d\n",a[m][n]);
}
if (m==k||n==k){
printf("%d\n",a[m][n]);
break;
}
for(n=c-k-1;n>k;n--){
printf("%d\n",a[m][n]);
}
for(m=r-k-1;m>k;m--){
printf("%d\n",a[m][n]);
}
}
return 0;
} | 46 |
22,604 | /*????
????????????????row?col?
???row??????col???????????????
??????row?col??0<row<100, 0<col<100?
????
????????????????????
????
4 4
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7
*/
int main(){
int n,m,sum=0;
int str[100][100];
cin>>n>>m;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
cin>>str[i][j];
for(int k=0;k<(n+1)/2;k++){
for(int k1=k;k1<m-k;k1++){
cout<<str[k][k1]<<endl;
sum++;
if(sum==n*m)
return 0;}
for(int k2=k+1;k2<n-k;k2++){
cout<<str[k2][m-k-1]<<endl;
sum++;
if(sum==n*m)
return 0;}
for(int k3=m-k-2;k3>=k;k3--){
cout<<str[n-k-1][k3]<<endl;
sum++;
if(sum==n*m)
return 0;}
for(int k4=n-k-2;k4>k;k4--){
cout<<str[k4][k]<<endl;
sum++;
if(sum==n*m)
return 0;}
}
return 0;
}
| 46 |
22,605 | int main(){
int s[100][100], a, b, i, j, xx_a, xx_b, sx_a, sx_b , n;
scanf("%d %d", &a, &b);
xx_a=0;
xx_b=0;
sx_a=a-1;
sx_b=b-1;
for(i=0;i<a;i++){
for(j=0;j<b;j++){
scanf("%d", &s[i][j]);}}
while(sx_a>xx_a&&sx_b>xx_b){
for(j = xx_b; j < sx_b; j++){
printf("%d\n", s[xx_a][j]);}
for(i = xx_a; i < sx_a; i++){
printf("%d\n", s[i][sx_b]);}
for(j = sx_b; j > xx_b; j--){
printf("%d\n", s[sx_a][j]);}
for(i = sx_a; i > xx_a; i--){
printf("%d\n", s[i][xx_b]);}
sx_a--;
sx_b--;
xx_a++;
xx_b++;}
if((a*b)%2!=0){
if(a<b){
for(j = xx_a;j <= sx_b;j++){
printf("%d\n", s[xx_a][j]);}}
else{
for(j = xx_b;j <= sx_a;j++){
printf("%d\n", s[j][xx_b]);}}}
else if((b%2==0)&&(a%2!=0)&&(b>a)){
for(j = xx_a;j <= sx_b;j++){
printf("%d\n", s[xx_a][j]);}}
else if((a%2==0)&&(b%2!=0)&&(a>b)){
for(j = xx_b;j <= sx_a;j++){
printf("%d\n", s[j][xx_b]);}}
return 0;
}
| 46 |
22,606 | int main(int argc, char* argv[])
{
int a[100][100],row,col,i,j,n=0,k=0;
scanf("%d%d",&row,&col);
for (i=0;i<row;i++)
{
for (j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
while (k!=(row*col))
{
for (j=(0+n);j<(col-n);j++)
{
printf("%d\n",a[n][j]);
k++;
}
if(k==row*col)break;
for (i=(1+n);i<(row-n);i++)
{
printf("%d\n",a[i][col-1-n]);
k++;
}
if(k==row*col)break;
for (j=(col-2-n);j>=(0+n);j--)
{
printf("%d\n",a[row-n-1][j]);
k++;
}
if(k==row*col)break;
for (i=(row-2-n);i>=(1+n);i--)
{
printf("%d\n",a[i][n]);
k++;
}
if(k==row*col)break;
n++;
}
return 0;
}
| 46 |
22,607 | int main(){
int xx_col,sx_col,xx_row,sx_row,row,col,k,i,a[100][100];
scanf("%d%d",&row,&col);
for(k=0;k<row;k++){
for(i=0;i<col;i++){
scanf("%d",&a[k][i]);
}
}
xx_col=0;
xx_row=0;
sx_col=col-1;
sx_row=row-1;
for(;xx_col<=sx_col&&xx_row<=sx_row;xx_col++,xx_row++,sx_col--,sx_row--){
if(xx_col!=sx_col&&xx_row!=sx_row){
for(i=xx_col;i<sx_col;i++){
printf("%d\n",a[xx_row][i]);
}
for(i=xx_row;i<sx_row;i++){
printf("%d\n",a[i][sx_col]);
}
for(i=sx_col;i>xx_col;i--){
printf("%d\n",a[sx_row][i]);
}
for(i=sx_row;i>xx_row;i--){
printf("%d\n",a[i][xx_col]);
}
}else if(xx_col==sx_col){
for(i=xx_row;i<=sx_row;i++){
printf("%d\n",a[i][xx_col]);
}
}else if(xx_row==sx_row){
for(i=xx_col;i<=sx_col;i++){
printf("%d\n",a[xx_row][i]);
}
}
}
return 0;
} | 46 |
22,608 | /**
????2.cpp
? ?????
? ??11.01
? ??????????
*/
int main()
{
int row, col, a[100][100];
int i, j, n, num = 0, tot;
cin >> row >> col;
tot = row * col;
for(i = 0;i < row;i++)
for(j = 0;j < col;j++)
cin >> a[i][j];
for(n = 0;n < 1 + row / 2;n++)
{
for(i = n;i < col - n;i++)
{
cout << a[n][i] << endl;
num++;
}
if(num == tot)break;
for(j = n + 1;j < row - n;j++)
{
cout << a[j][col - n - 1] << endl;
num++;
}
if(num == tot)break;
for(i = col - 2 - n;i >= n;i--)
{
cout << a[row - n - 1][i] << endl;
num++;
}
if(num == tot)break;
for(j = row - 2 - n;j > n;j--)
{
cout << a[j][n] << endl;
num++;
}
if(num == tot)break;
}
return 0;
}
| 46 |
22,609 | int main()
{
int row,col,x,y,a[100][100],flag=0,i,k;
scanf("%d%d",&row,&col);
for(x=0;x<row;x++){
for(y=0;y<col;y++){
scanf("%d",&a[x][y]);}
}
k=(row>col)?col:row;
for(i=0;i<k;i++){
for(y=i;y<col-i;y++){
printf("%d\n",a[i][y]);
flag++;}
if(flag==row*col)
break;
for(x=i+1;x<row-i;x++){
printf("%d\n",a[x][col-1-i]);
flag++;}
if(flag==row*col)
break;
for(y=col-2-i;y>=i;y--){
printf("%d\n",a[row-1-i][y]);
flag++;}
if(flag==row*col)
break;
for(x=row-2-i;x>i;x--){
printf("%d\n",a[x][i]);
flag++;}
if(flag==row*col)
break;
}
return 0;
}
| 46 |
22,610 | int main ()
{
int r,c,i,j,t,n;
t=0;
int a[100][100]={0};
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&(a[i][j]));
}
}
int c0=c,r0=r;
int i0=0,j0=0;
while(1)
{
printf("%d",a[i0][j0]);
t++;
if(t==r*c)
{
break;
}
i=i0;
for(j=j0+1;j<j0+c0;j++)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
r0--;
j--;
for(i=i+1;i<i0+r0+1;i++)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
c0--;
i--;
for(j=j-1;j>=j0;j--)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
r0--;
j++;
for(i=i-1;i>i0;i--)
{
printf("\n%d",a[i][j]);
t++;
}
if(t==r*c)
{
break;
}
else
{
printf("\n");
}
c0--;
i0=i+1;
j0++;
}
return 0;
}
| 46 |
22,611 |
void circle(int list[][100], int row_min, int row_max, int col_min, int col_max)
{
int i,j;
if (row_min==row_max || col_min==col_max) {
for (i=col_min; i<col_max; i++) {
printf("%d\n",list[row_min][i]);
}
for (i=row_min; i<=row_max; i++) {
printf("%d\n",list[i][col_max]);
}
} else {
for (i=col_min; i<col_max; i++) {
printf("%d\n",list[row_min][i]);
}
for (i=row_min; i<row_max; i++) {
printf("%d\n",list[i][col_max]);
}
for (i=col_max; i>col_min; i--) {
printf("%d\n",list[row_max][i]);
}
for (i=row_max; i>row_min; i--) {
printf("%d\n",list[i][col_min]);
}
}
}
int main()
{
int array[100][100];
int i,j;
int sumrow,sumcol;
scanf("%d %d",&sumrow,&sumcol);
for (i=0; i<sumrow; i++) {
for (j=0; j<sumcol; j++) {
scanf("%d",&array[i][j]);
}
}
int row_min=0, row_max=sumrow-1, col_min=0, col_max=sumcol-1;
while (row_min<=row_max && col_min<=col_max) {
circle(array, row_min, row_max, col_min, col_max);
row_min++;
row_max--;
col_min++;
col_max--;
}
return 0;
} | 46 |
22,612 |
int main()
{
int row,col;
cin>>row>>col;
cout<<dec;
int a[101][101];
for (int i=1;i<=row;i++)
for (int j=1;j<=col;j++)
cin>>a[i][j];
for (int i=1;i<=row/2 && i<=col/2;i++)
{
for (int j=i;j<=col-i;j++) cout<<a[i][j]<<endl;
for (int j=i;j<=row-i;j++) cout<<a[j][col-i+1]<<endl;
for (int j=col-i+1;j>=i+1;j--) cout<<a[row-i+1][j]<<endl;
for (int j=row-i+1;j>=i+1;j--) cout<<a[j][i]<<endl;
}
if (row%2==1 && row<=col) for (int j=row/2+1;j<=col-row/2;j++) cout<<a[row/2+1][j]<<endl;
if (col%2==1 && row>col) for (int j=col/2+1;j<=row-col/2;j++) cout<<a[j][col/2+1]<<endl;
return 0;
}
| 46 |
22,613 |
int main()
{
int row,col,k=1,l=0,i,j;
scanf("%d %d",&row,&col);
int sz[100][100];
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
if(row==1&&col==1)
printf("%d",sz[0][0]);
else{
for(i=0;i<row*col;)
{
for(j=l;j<col-l;j++)
{
printf("%d\n",sz[l][j]);
i++;if(i==row*col) break;
}
if(i==row*col) break;
for(j=l+1;j<row-1-l;j++)
{
printf("%d\n",sz[j][col-1-l]);
i++;if(i==row*col) break;
} if(i==row*col) break;
for(j=col-1-l;j>=l;j--)
{
printf("%d\n",sz[row-1-l][j]);
i++;if(i==row*col) break;
} if(i==row*col) break;
for(j=row-2-l;j>l;j--)
{
printf("%d\n",sz[j][l]);
i++;if(i==row*col) break;
} if(i==row*col) break;
l++;
}
}
return 0;
}
| 46 |
22,614 | int main(){
int row,col,t;
int jz[100][100];
t=1;
scanf("%d %d",&row,&col);
for(int f=0;f<row;f++){
for(int g=0;g<col;g++){
scanf("%d",&jz[f][g]);}
}
for(int i=0;1;i++){
if(t==row*col+1){
break;}
for(int n=i;n<col-i;n++){
if(t==row*col+1){
break;}
printf("%d\n",jz[i][n]);
t++;
}
for(int m=i+1;m<row-i;m++){
if(t==row*col+1){
break;}
printf("%d\n",jz[m][col-(i+1)]);
t++;}
for (int k=col-(i+2);k>=i;k--){
if(t==row*col+1){
break;}
printf("%d\n",jz[row-(i+1)][k]);
t++;}
for(int e=row-(i+2);e>=i+1;e--){
if(t==row*col+1){
break;}
printf("%d\n",jz[e][i]);
t++;}
}
return 0;
}
| 46 |
22,615 | int main()
{
int a,b,i,j,k,l,m,p;
int f[num][num];
p=0;
scanf("%d %d",&a,&b);
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
scanf("%d",&f[i][j]);
}
}
for(i=0;;i++)
{
if(p==a*b)
break;
for(j=i;j<b-i;j++)
{
p++;
if(p<a*b)
{
printf("%d\n",f[i][j]);
}
else
{
printf("%d",f[i][j]);
break;
}
}
if(p==a*b)
break;
for(k=i+1;k<a-i;k++)
{
p++;
if(p<a*b)
{
printf("%d\n",f[k][b-1-i]);
}
else
{
printf("%d",f[k][b-1-i]);
break;
}
}
if(p==a*b)
break;
for(l=b-2-i;l>i-1;l--)
{
p++;
if(p<a*b)
{
printf("%d\n",f[a-1-i][l]);
}
else
{
printf("%d",f[a-1-i][l]);
break;
}
}
if(p==a*b)
break;
for(m=a-2-i;m>i;m--)
{
p++;
if(p<a*b)
{
printf("%d\n",f[m][i]);
}
else
{
printf("%d",f[m][i]);
break;
}
}
if(p==a*b)
break;
}
return 0;
} | 46 |
22,616 | int main() {
int i, j,r,c,x,y,a[110][110];
for (i=0;i<110;i++) for (j=0;j<110;j++) a[i][j]=-1;
for (scanf("%d%d", &r, &c), i = 1; i <=r; i++)
for (j = 1; j <= c; j++) scanf("%d", &a[i][j]);
for (i=j=1,x=0,y=1;a[i][j]!=-1;i+=x,j+=y){
printf("%d\n",a[i][j]);
a[i][j]=-1;
if (a[i+x][j+y]==-1){
r = y;
y= -x;
x=r;
}
}
} | 46 |
22,617 |
int main()
{
int num[100][100];
int row,col;
scanf("%d%d",&row,&col);
int i,j;
int a=0,b=row-1,c=0,d=col-1;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&num[i][j]);
}
}
do
{
i=a;
for(j=c;j<=d&&a<=b;j++)
{
printf("%d\n",num[i][j]);
}
a=a+1;
j=d;
for(i=a;i<=b&&c<=d;i++)
{
printf("%d\n",num[i][j]);
}
d=d-1;
i=b;
for(j=d;j>=c&&a<=b;j--)
{
printf("%d\n",num[i][j]);
}
b=b-1;
j=c;
for(i=b;i>=a&&c<=d;i--)
{
printf("%d\n",num[i][j]);
}
c=c+1;
/*
a=a+1;
b=b-1;
c=c+1;
d=d-1;
*/
}
while(a<=b||c<=d);
return 0;
}
| 46 |
22,618 | int main()
{
int row,col,matrix[ROW][COL],k[100000];
int i,j,a=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&matrix[i][j]);
}
}
int xx_row,sx_row,xx_col,sx_col;
xx_row=0;
sx_row=row-1;
xx_col=0;
sx_col=col-1;
while((xx_row<=sx_row)&&(xx_col<=sx_col)){
if((xx_row==sx_row)&&(xx_col==sx_col)){
k[a]=matrix[xx_row][xx_col];
a++;
}
for(j=xx_col;j<sx_col;j++){
k[a]=matrix[xx_row][j];
a++;
}
for(i=xx_row;i<sx_row;i++){
k[a]=matrix[i][sx_col];
a++;
}
for(j=sx_col;j>xx_col;j--){
k[a]=matrix[sx_row][j];
a++;
}
for(i=sx_row;i>xx_row;i--){
k[a]=matrix[i][xx_col];
a++;
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;
}
for(i=0;i<row*col;i++)
{
printf("%d\n",k[i]);
}
return 0;
}
| 46 |
22,619 | int main()
{int i,e,array[100][100],col,row,n=0;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{ for(e=0;e<col;e++)
scanf("%d",&array[i][e]);
}
i=0;
while(n<col*row)
{ for(e=0;e<col;e++)
{
if(array[i][e]!=0)
{ printf("%d\n",array[i][e]);
array[i][e]=0;
n++;
}
}
for(e=0;e<row;e++)
{ if(array[e][col-1-i]!=0)
{ printf("%d\n",array[e][col-1-i]);
array[e][col-1-i]=0;
n++;
}
}
for(e=1;e<=col;e++)
{ if(array[row-i-1][col-e]!=0)
{ printf("%d\n",array[row-1-i][col-e]);
array[row-1-i][col-e]=0;
n++;
}
}
for(e=1;e<=row;e++)
{ if(array[row-e][i]!=0)
{ printf("%d\n",array[row-e][i]);
array[row-e][i]=0;
n++;
}
}
i++;
}
return 0;
} | 46 |
22,620 | int main()
{
int col,row,i,j,*org,*p,m,n,count=0,total;
scanf("%d %d",&row,&col);
org=(int*)malloc(row*col*sizeof(int));
p=org;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
{
scanf("%d",p+i*col+j);
}
total=row*col;
i=0;j=0;
do
{
m=i;n=j;
for(;n<col-j;n++)
{printf("%d\n",*(p+m*col+n));count++;}
n--;
if(count==total)break;
for(m=i+1;m<row-i;m++)
{printf("%d\n",*(p+m*col+n));count++;}
m--;
if(count==total)break;
for(n=n-1;n>=j;n--)
{printf("%d\n",*(p+m*col+n));count++;}
n++;
if(count==total)break;
for(m=m-1;m>=i+1;m--)
{printf("%d\n",*(p+m*col+n));count++;}
m++;
if(count==total)break;
j++;i++;
}while(1);
free(org);
}
| 46 |
22,621 | int main()
{
int a[110][110],i,j,row,col;
cin>>row>>col;
for (i=0;i<row;i++)
{
for (j=0;j<col;j++)
{
cin>>a[i][j];
}
}
int num=0,n=0;
for (n=0;n<=500;n++)
{
for (int i1=n;i1<=col-n-1;i1++)
{
cout<<a[n][i1]<<endl;
num+=1;
}
if (num>=row*col)
break;
for (int i2=n+1;i2<=row-n-1;i2++)
{
cout<<a[i2][col-n-1]<<endl;
num++;
}
if (num>=row*col)
break;
for (int i3=col-n-2;i3>=n;i3--)
{
cout<<a[row-n-1][i3]<<endl;
num++;
}
if (num>=row*col)
break;
for (int i4=row-n-2;i4>n;i4--)
{
cout<<a[i4][n]<<endl;
num++;
}
if (num>=row*col)
break;
}
return 0;
}
| 46 |
22,622 | typedef struct
{
int file;
int flag;
}map;
void main()
{
map a[200][200];
int count=0,i,j,col,row;
char direction='d';
for(i=1;i<=200;i++)
{
for(j=1;j<=200;j++)
{
a[i-1][j-1].flag=0;
}
}
scanf("%d %d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j].file);
a[i][j].flag=1;
}
}
i=1;
j=1;
do
{
count++;
switch(direction)
{
case'd':
a[i][j].flag=0;
if(a[i][j+1].flag==1)
{
printf("%d\n",a[i][j].file);
j++;
}
else
{
printf("%d\n",a[i][j].file);
direction='s';
i++;
}
break;
case's':
a[i][j].flag=0;
if(a[i+1][j].flag==1)
{
printf("%d\n",a[i][j].file);
i++;
}
else
{
printf("%d\n",a[i][j].file);
direction='a';
j--;
}
break;
case'a':
a[i][j].flag=0;
if(a[i][j-1].flag==1)
{
printf("%d\n",a[i][j].file);
j--;
}
else
{
printf("%d\n",a[i][j].file);
direction='w';
i--;
}
break;
case'w':
a[i][j].flag=0;
if(a[i-1][j].flag==1)
{
printf("%d\n",a[i][j].file);
i--;
}
else
{
printf("%d\n",a[i][j].file);
direction='d';
j++;
}
break;
default:
break;
}
}while(count!=row*col);
} | 46 |
22,623 | //#define main xmain
int a[MAX][MAX];
int main()
{
int m, n, i, j;
scanf("%d %d", &m, &n);
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int rs = 0, re = m - 1;
int cs = 0, ce = n - 1;
while (re >= rs && ce >= cs) {
if (re > rs) {
if (ce > cs) {
for (j=cs; j<=ce; j++) {
printf("%d\n", a[rs][j]);
}
for (i=rs+1; i<=re; i++) {
printf("%d\n", a[i][ce]);
}
for (j=ce-1; j>=cs; j--) {
printf("%d\n", a[re][j]);
}
for (i=re-1; i>rs; i--) {
printf("%d\n", a[i][cs]);
}
}
else if (ce == cs) {
for (i=rs; i<=re; i++) {
printf("%d\n", a[i][cs]);
}
}
}
else if (re == rs) {
for (j=cs; j<=ce; j++) {
printf("%d\n", a[rs][j]);
}
}
re--;
rs++;
ce--;
cs++;
}
return 0;
}
int mn[][2] = {
{23, 23},
{44, 44},
{23, 44},
{44, 23},
{3, 4},
{4, 3},
{1, 1},
{1, 99},
{99, 1},
{99, 99}
};
int xn = 0;
int max_files = sizeof(mn) / sizeof(mn[0]);
char * output_dir = "data";
int rnd(int min, int max)
{
return min + ((rand() << 15) | rand()) % (max - min + 1);
}
void swap(int *a, int *b) {
int t;
t = *a;
*a = *b;
*b = t;
}
void fill(int a[][MAX], int m, int n) {
int i, j, count = rnd(1,10);
for (i=0; i<m; i++) {
for (j=0; j<n; j++) {
a[i][j] = count++;
}
}
for (i=0; i<m; i++) {
for (j=0; j<n; j++) {
int i1 = rnd(0, m-1);
int j1 = rnd(0, n-1);
int i2 = rnd(0, m-1);
int j2 = rnd(0, n-1);
swap(&a[i1][j1], &a[i2][j2]);
}
}
}
void print(int a[][MAX], int m, int n) {
int count = 0;
for (int i=0; i<m; i++) {
for (int j=0; j<n; j++) {
printf("%d", a[i][j]);
if (j == n-1)
printf("\n");
else
printf(" ");
}
}
}
void xbuild()
{
printf("%d %d\n", mn[xn][0], mn[xn][1]);
fill(a, mn[xn][0], mn[xn][1]);
print(a, mn[xn][0], mn[xn][1]);
xn++;
}
| 46 |
22,624 |
/*
* 1000012795-??????????.cpp
* ??????????
* Created on: 2010-12-30
* Author: ??
*/
int a[100][100]={0};//????????
void cut(int m,int n)//??????????????
{
int i,j;
if(m==0||n==0)//???????m=0||n=0????
return ;
if(m==1)//?????m=1??????????????
{
for(i=0;i<n;i++)
cout<<a[0][i]<<endl;
return ;
}
if(n==1)//?????n=1??????????????
{
for(i=0;i<m;i++)
cout<<a[i][0]<<endl;
return ;
}
for(i=0;i<n;i++)//?????????
cout<<a[0][i]<<endl;
for(i=1;i<m;i++)
cout<<a[i][n-1]<<endl;
for(i=n-2;i>=0;i--)
cout<<a[m-1][i]<<endl;
for(i=m-2;i>0;i--)
cout<<a[i][0]<<endl;
for(i=0;i<m-2;i++)//????????????????
for(j=0;j<n-2;j++)
{
a[i][j]=a[i+1][j+1];
}
cut(m-2,n-2);//?????????
}
int main()
{
int m,n,i,j;
cin>>m>>n;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
cin>>a[i][j];
cut(m,n);
return 0;
}
| 46 |
22,625 | int main()
{
int m,n;
int q;
scanf("%d %d",&m,&n);
q=m*n;
int sz[100][100];
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{scanf("%d",&sz[i][j]);}
}
int x;
int p=0;
for(x=0;x<=(m/2+1)&&x<=(n/2+1);x++)
{
for(j=x;j<=(n-x-1)&&x<=(n-x-1)&&p<q;j++)
{printf("%d\n",sz[x][j]);
p++;}
for(i=x+1;i<=(m-x-1)&&(x+1)<=(m-x-1)&&p<q;i++)
{printf("%d\n",sz[i][n-x-1]);
p++;}
for(j=(n-x-2);j>=x&&x<=(n-x-2)&&p<q;j--)
{printf("%d\n",sz[m-1-x][j]);
p++;}
for(i=(m-2-x);i>=(x+1)&&(x+1)<=(m-2-x)&&p<q;i--)
{printf("%d\n",sz[i][x]);
p++;}
}
return 0;
}
| 46 |
22,626 | void main()
{int a,s,k,i,j,x[100][100],row,col;
scanf("%d", &row);
scanf("%d", &col);
a=0;
for (i=1;i<=row;i++)
{for (j=1;j<=col;j++)
scanf("%d", &x[i][j]);}
for (k=1;k<=(row+1)/2&&k<=(col+1)/2;k++)
{if (k<=row/2&&k<=col/2) s=0;
else s=1;
for (i=k;i<=col-k+1;i++,a++)
{printf("%d\n", x[k][i]);
}if (a>=col*row) break;
for (j=k+1;j<=row-k;j++,a++)
{printf("%d\n", x[j][col-k+1]);
}if (a>=col*row) break;
for (i=col-k+1;i>=k;i--,a++)
{printf("%d\n", x[row-k+1][i]);
}if (a>=col*row) break;
for (j=row-k;j>k;j--,a++)
{printf("%d\n", x[j][k]);
}if (a>=col*row) break;
}
} | 46 |
22,627 | int main()
{
const int max = 100;
int row, col, i, j;
cin >> row;
cin >> col;
int num[max + 2][max + 2];
for(i = 0; i < max + 2; i++)
{
for(j = 0; j < max + 2; j++)
{
num[i][j] = -1;
}
}
for(i = 1; i <= row; i++)
{
for(j = 1; j <= col; j++)
{
cin >> num[i][j];
}
}
int flag = 0;
int maxnum = row * col;
int count = 0;
i = 1;
j = 1;
while(1)
{
if(flag == 0)
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
j++;
}
j--;
i++;
flag = 1;
}
else
{
if(flag == 1)
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
i++;
}
i--;
j--;
flag = 2;
}
else {
if(flag == 2)
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
j--;
}
j++;
i--;
flag = 3;
}
else
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
i--;
}
i++;
j++;
flag = 0;
}
}
}
if(count == maxnum) break;
}
return 0;
} | 46 |
22,628 | int main()
{
int p,row,col,i,k,j,a[100][100]; //row:?,col:?
cin>>row>>col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
cin>>a[i][j];
}
if(col>row)
p=row/2+row%2;
else
p=col/2+col%2;
for(i=0;i<p;i++)
{
for(k=i;k<col-i;k++)
cout<<a[i][k]<<endl;
for(k=i+1;k<row-i;k++)
cout<<a[k][col-i-1]<<endl;
if(i!=row-i-1)
{
for(k=col-i-2;k>=i;k--)
cout<<a[row-i-1][k]<<endl;
}
if(i!=col-i-1)
{
for(k=row-i-2;k>i;k--)
cout<<a[k][i]<<endl;
}
}
return 0;
} | 46 |
22,629 | int main()
{
int row,col;
int i,j,m,span=0;
scanf("%d%d",&row,&col);
int array[100][100];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
for (m=0;;m++)
{
for (i=m;i<col-m;i++)
{
printf("%d\n",array[m][i]);
span++;
}
printf("\n");
if(span==row*col)break;
for (j=m+1;j<row-m;j++)
{
printf("%d\n",array[j][col-m-1]);
span++;
}
printf("\n");
if(span==row*col)break;
for (i=col-2-m;i>=m;i--)
{
printf("%d\n",array[row-m-1][i]);
span++;
}
printf("\n");
if(span==row*col)break;
for (j=row-2-m;j>m;j--)
{
printf("%d\n",array[j][m]);
span++;
}
printf("\n");
if(span==row*col)break;
}
return 0;
}
| 46 |
22,630 | int main(){
int a,b,c,n,i,m,j,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]));
}
}
c=0;
for(i=0;c<n*m;i++){
a=i%4;
b=i/4;
if(a==0){
for(j=b;j<n-b;j++){
printf("%d\n",sz[b][j]);
c=c+1;
}
}
if(a==1){
for(j=b+1;j<m-b;j++){
printf("%d\n",sz[j][n-1-b]);
c=c+1;
}
}
if(a==2){
for(j=n-2-b;j>=b;j--){
printf("%d\n",sz[m-1-b][j]);
c=c+1;
}
}
if(a==3){
for(j=m-2-b;j>b;j--){
printf("%d\n",sz[j][b]);
c=c+1;
}
}
}
return 0;
} | 46 |
22,631 | int main()
{
int row,col;
int i,j,n;
int t=0;
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<row;n++)
{
for (i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
t++;
}
printf("\n");
if(t==row*col)
break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
t++;
}
printf("\n");
if(t==row*col)
break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
t++;
}
printf("\n");
if(t==row*col)
break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
t++;
}
printf("\n");
if(t==row*col)
break;
}
return 0;
}
| 46 |
22,632 | int main (){
int h,l,i,k,a,s[H][L];
scanf("%d %d",&h,&l);
for(i=0;i<h;i++){
for(k=0;k<l;k++){
scanf("%d",&(s[i][k]));
}
}
if(h<=l){
a=2*h-1;
}else{
a=2*l;
}
for(i=0;i<a;i++){
if(i%4==0){
for(k=i/4;k<=l-1-i/4;k++){
printf("%d\n",s[i/4][k]);
}
}else if(i%4==1){
for(k=i/4+1;k<=h-1-i/4;k++){
printf("%d\n",s[k][l-1-i/4]);
}
}else if(i%4==2){
for(k=l-2-i/4;k>=i/4;k--){
printf("%d\n",s[h-1-i/4][k]);
}
}else{
for(k=h-2-i/4;k>=(i+1)/4;k--){
printf("%d\n",s[k][i/4]);
}
}
}
return 0;
} | 46 |
22,633 | int main()
{
int row,col; //row????col???
int i,j;//????
int a[100][100];// ????????
cin>>row>>col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
cin>>a[i][j];
}
int m,n,t;//m???????n??????,t?????
m=row;
n=col;
t=0;
for(t=0;(t<n-t)&&(t<m-t);t++)
{
for(i=t,j=t;j<n-t;j++)
{
cout<<a[i][j]<<endl;
}
if(j==t) break;
for(i=1+t,j=n-t-1;i<m-t;i++)
{
cout<<a[i][j]<<endl;
}
if(i==1+t) break;
for(i=m-t-1,j=n-2-t;j>=t;j--)
{
cout<<a[i][j]<<endl;
}
if(j==n-2-t) break;
for(i=m-2-t,j=t;i>=1+t;i--)
{
cout<<a[i][j]<<endl;
}
}
return 0;
}
| 46 |
22,634 | int main(){
int row,col,i,j,time=0,n,a[100][100],max;
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){
max=row;
}
else{
max=col;
}
for(n=0;n<max;n++){
for(j=n;j<col-n;j++){
printf("%d\n",a[n][j]);
time++;
}
if(time==row*col){
break;
}
for(i=n+1;i<row-n;i++){
printf("%d\n",a[i][col-n-1]);
time++;
}
if(time==row*col){
break;
}
for(j=col-n-2;j>=n;j--){
printf("%d\n",a[row-1-n][j]);
time++;
}
if(time==row*col){
break;
}
for(i=row-n-2;i>n;i--){
printf("%d\n",a[i][n]);
time++;
}
if(time==row*col){
break;
}
}
return 0;
} | 46 |
22,635 | int main()
{
int i,j,x=0,y=0,row,col,k=0;
int a[100][100];
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<row*col;i++)
{
printf("%d\n",a[x][y]);
if(k==0 && x+y==col-1)
k=1;
else if(k==1 && x-y==row-col)
k=2;
else if(k==2 && x+y==row-1)
k=3;
else if(k==3 && x-y==1)
k=0;
x+=dx[k];
y+=dy[k];
}
return 0;
} | 46 |
22,636 | int main()
{
int r,c,a[100][100],b[10000]={0},i=0,j=0,p=0,q=0;
int z1,z2,z3,z4;
scanf("%d",&r);
scanf("%d",&c);
z1=z2=0,z3=r-1,z4=c-1;
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&a[i][j]);}}
if(c==1||r==1){
for(i=0;i<r;i++){
for(j=0;j<c;j++){
printf("%d\n",a[i][j]);}}}
else{
b[0]=a[0][0];
i=0,j=1;
for(p=1;p<(c*r);p++){
switch(q){
case 0:b[p]=a[i][j];j++;break;
case 1:b[p]=a[i][j];i++;break;
case 2:b[p]=a[i][j];j--;break;
case 3:b[p]=a[i][j];i--;break;
default:break;}
if(j==z4&&i==z1&&q==0){q=1;z1++;}
else if(i==z3&&j==z4&&q==1){q=2;z4--;}//??????
else if(j==z2&&i==z3&&q==2){q=3;z3--;}
else if(i==z1&&j==z2&&q==3){q=0;z2++;}
}
for(q=0;q<(c*r);q++){
printf("%d\n",b[q]);}}
} | 46 |
22,637 | int main()
{
int sz[100][100],i=0,j=0,row,col;
int hxx,hsx,lxx,lsx,m1,m2,m3,m4,n1,n2;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
hxx=0;hsx=row-1;lxx=0;lsx=col-1;
for(hxx=0,hsx=row-1,lxx=0,lsx=col-1;hxx<hsx&&lxx<lsx;hxx++,hsx--,lxx++,lsx--)
{
for(m1=lxx;m1<lsx;m1++)
{
printf("%d\n",sz[hxx][m1]);
}
for(m2=hxx;m2<hsx;m2++)
{
printf("%d\n",sz[m2][lsx]);
}
for(m3=lsx;m3>lxx;m3--)
{
printf("%d\n",sz[hsx][m3]);
}
for(m4=hsx;m4>hxx;m4--)
{
printf("%d\n",sz[m4][lxx]);
}
}
if(hxx==hsx)
{
for(n1=lxx;n1<=lsx;n1++)
{
printf("%d\n",sz[hxx][n1]);
}
}
else if(lxx==lsx)
{
for(n2=hxx;n2<=hsx;n2++)
{
printf("%d\n",sz[n2][lxx]);
}
}
return 0;
} | 46 |
22,638 | //**********************************
//* ????homework_10.cpp *
//* ??????1200012884 *
//* ?????2012?10?31? *
//* ????????????? *
//**********************************
int main()
{
int a[101][101];
int row, col, i, j, count = 0, time;
cin >> row >> col;
for (i = 0;i < row;i++)
for (j = 0;j < col;j++)
cin >> a[i][j];
i = -1;
j = -1;
time = row * col;
for (;;)
{
i++;
for (j += 1;j < col;j++)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
j--;
for (i += 1;i < row;i++)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
i--;
for (j -= 1;j >= count;j--)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
j++;
count++;
for (i -= 1;i >= count;i--)
{
cout << a[i][j] << endl;
time--;
}
if (time == 0)
break;
row--;
col--;
}
return 0;
}
| 46 |
22,639 | int a[10000][10000];
int main(){
int row,col,i,j,k=0,r,c,p=0;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&a[i][j]);
}
}
for(row=r,col=c;(row>0)&&(col>0);row=row-1,col=col-1){
if(p!=r*c){
for(j=k;j<col;j++){
printf("%d\n",a[k][j]);
p++;
}
}else{
break;
}
if(p!=r*c){
for(i=k;i<row-1;i++){
printf("%d\n",a[i+1][col-1]);
p++;
}
}else{
break;
}
if(p!=r*c){
for(j=col-1;j>k;j--){
printf("%d\n",a[row-1][j-1]);
p++;
}
}else{
break;
}
if(p!=r*c){
for(i=row-1;i>k+1;i--){
printf("%d\n",a[i-1][k]);
p++;
}
}else{
break;
}
k++;
}
return 0;
}
| 46 |
22,640 | int main()
{
int row,col;
int i,j,n,time=0;
cin>>row>>col;
int a[100][100];
int (*p)[100]=a;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>*(*(p+i)+j);
for (n=0;;n++)
{
for (i=n;i<col-n;i++)
{
cout<<*(*(p+n)+i)<<endl;
time++;//??????????time?????
}
if(time==row*col) break;
for (j=n+1;j<row-n;j++)
{
cout<<*(*(p+j)+col-n-1)<<endl;
time++;
}
if(time==row*col) break;
for (i=col-2-n;i>=n;i--)
{
cout<<*(*(p+row-n-1)+i)<<endl;
time++;
}
if(time==row*col) break;
for (j=row-2-n;j>n;j--)
{
cout<<*(*(p+j)+n)<<endl;
time++;
}
if(time==row*col) break;
}
return 0;
}
| 46 |
22,641 | int main()
{
int i,j,a[100][100],k,r,c,row,col,s,a1,a2,t;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
s=0;
t=row*col;
a1=0;
a2=0;
r=0;
c=0;
for(k=0;k<=100;k++)
{
for(c=a2;c<col;c++)
{
printf("%d\n",a[r][c]);
s++;
if(s==t)
{
return 0;
}
}
col--;
c--;
a1++;
for(r=a1;r<row;r++)
{
printf("%d\n",a[r][c]);
s++;
if(s==t)
{
return 0;
}
}
row--;
r--;
for(c=col-1;c>=a2;c--)
{
printf("%d\n",a[r][c]);
s++;
if(s==t)
{
return 0;
}
}
c++;
for(r=row-1;r>=a1;r--)
{
printf("%d\n",a[r][c]);
s++;
if(s==t)
{
return 0;
}
}
r++;
a2++;
}
} | 46 |
22,642 | void main()
{
int array[100][100],row,col,n,count=0,i,j,k,*p;
scanf("%d%d",&row,&col);
n=row*col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
for(k=0;;k++)
{
for(p=array[k]+k;p<array[k]+col-k-1;p++)
{
printf("%d\n",*p);
count++;
}
if(count==n)
break;
for(i=k;i<row-k;i++)
{
printf("%d\n",*(*(array+i)+col-k-1));
count++;
}
if(count==n)
break;
for(i=col-k-2;i>=k;i--)
{
printf("%d\n",*(*(array+row-k-1)+i));
count++;
}
if(count==n)
break;
for(i=row-k-2;i>k;i--)
{
printf("%d\n",*(*(array+i)+k));
count++;
}
if(count==n)
break;
}
}
| 46 |
22,643 |
int main()
{
int i,j,k,l,r,c,a[100][100];
scanf("%d %d",&r,&c);
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&a[i][j]);
}
}
l=0;
k=1;
if(r==1&&c==1)
printf("%d",a[0][0]);
else
{
for(j=0;;)
{
switch (k)
{
case 1: goto p1;break;
case 2: goto p2;break;
case 3: goto p3;break;
case 4: goto p4;
}
p1:{
for(i=l;i<c-l;i++)
{
printf("%d\n",a[l][i]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
p2:{
for(i=l+1;i<r-l-1;i++)
{
printf("%d\n",a[i][c-l-1]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
p3:{
for(i=c-l-1;i>=l;i--)
{
printf("%d\n",a[r-l-1][i]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
p4:{
for(i=r-l-2;i>l;i--)
{
printf("%d\n",a[i][l]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
end:
{
k++;
if(k>4)
{
k=1;
l++;
}
}
}
}
out:;
return 0;
}
| 46 |
22,644 |
int main()
{
int a[200][200];
int row ,col;
int i,j;
cin>>row>>col;
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
}
int upm,downm,right,left;
upm=1;
downm=row;
right=col;
left=1;
int time=0;
while(1)
{
for(j=left;j<=right;j++)
{
cout<<a[upm][j];
if(time<row*col-1)
cout<<endl;
time=time+1;
}
if(time==row*col)
break;
for(i=upm+1;i<=downm;i++)
{
cout<<a[i][right];
if(time<row*col-1)
cout<<endl;
time=time+1;
}
if(time==row*col)
break;
for(j=right-1;j>=left;j--)
{
cout<<a[downm][j];
if(time<row*col-1)
cout<<endl;
time=time+1;
}
if(time==row*col)
break;
for(i=downm-1;i>upm;i--)
{
cout<<a[i][left];
if(time<row*col-1)
cout<<endl;
time=time+1;
}
if(time==row*col)
break;
upm=upm+1;
downm=downm-1;
right=right-1;
left=left+1;
}
return 0;
}
| 46 |
22,645 | int mat[102][102];
int unvis[102][102];
int main()
{
int n,r,c,i,j,d;
int dir[4][2] ={{0,1},{1,0},{0,-1},{-1,0}};
scanf("%d%d",&r,&c);
for(i = 0;i < r ;i ++)
for(j = 0; j < c; j++)
{
scanf("%d",&mat[i][j]);
unvis[i][j] = 1;
}
n = r * c;
r = 0;
c = 0;
d = 0;
while(n)
{
unvis[r][c] = 0;
printf("%d\n",mat[r][c]);
i = r + dir[d][0];
j = c + dir[d][1];
if(i >=0 && j>=0 && unvis[i][j])
{
r = i;
c = j;
}
else
{
d = (d + 1) % 4;
r = r + dir[d][0];
c = c + dir[d][1];
}
n--;
}
return 0;
} | 46 |
22,646 | int main()
{
int row,col,rowsx,rowxx,colsx,colxx;
scanf("%d%d",&row,&col);
int sz[100][100];
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
rowsx=row-1;
rowxx=0;
colsx=col-1;
colxx=0;
while(rowxx<=rowsx&&colxx<=colsx)
{
if(rowxx==rowsx){
for(int o=colxx;o<=colsx;o++)
{
printf("%d\n",sz[rowxx][o]);
}
break;
}
if(colsx==colxx){
for(int p=rowxx;p<=rowsx;p++)
{
printf("%d\n",sz[p][colxx]);
}
break;
}
for(int k=colxx;k<=colsx;k++){
printf("%d\n",sz[rowxx][k]);
}
for(int l=rowxx+1;l<=rowsx;l++){
printf("%d\n",sz[l][colsx]);
}
for(int m=colsx-1;m>=colxx;m--){
printf("%d\n",sz[rowsx][m]);
}
for(int n=rowsx-1;n>rowxx;n--){
printf("%d\n",sz[n][colxx]);
}
rowsx--;
rowxx++;
colsx--;
colxx++;
}
return 0;
}
| 46 |
22,647 | int main ()
{
int a[100][100]={0},cnt=0,i,j,row,col,l=0;
cin >> row>>col ;
cnt = row * col ;
for(i = 0 ;i < row;i++)
{
for(j = 0 ; j <col ;j++)
cin >> a[i][j] ;
}
while(cnt > 0)
{
for(j=l;j<(col-l);j++)
{
cout << a[l][j]<<endl;
cnt--;
}
if(cnt == 0) break ;
for (i=(l+1);i<row-l;i++)
{
cout << a[i][col-l-1]<<endl;
cnt--;
}
if(cnt == 0) break ;
for(j=col-l-2;j>l-1;j--)
{
cout << a[row-l-1][j]<<endl;
cnt-- ;
}
if(cnt == 0) break ;
for(i=row-l-2;i>l;i--)
{
cout << a[i][l]<<endl;
cnt--;
}
l++ ;
}
return 0 ;
}
| 46 |
22,648 |
int main(){
int sz[155][155];
int i,j,p,q,c=0,a,b,col,row;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&(sz[i][j]));
}
}
p=0,q=0,a=col,b=row;
while(1)
{
for(i=p,j=p;j<=p+a-1;j++)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
for(j=p+a-1,i=q+1;i<=q+b-2;i++)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
for(i=q+b-1,j=p+a-1;j>=p;j--)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
for(j=p,i=q+b-2;i>=q+1;i--)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
a-=2,b-=2;
p++,q++;
if(c>=col*row)
break;
}
return 0;
}
| 46 |
22,649 | void main()
{
int a[100][100],row,col,i,j;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
int k;
for(k=0;k<=row/2-1&&k<=col/2-1;k++)
{
for(j=0+k;j<col-k;j++)
{
printf("%d\n",a[k][j]);
}
for(i=1+k;i<row-k;i++)
{
printf("%d\n",a[i][col-1-k]);
}
for(j=col-2-k;j>=k;j--)
{
printf("%d\n",a[row-1-k][j]);
}
for(i=row-2-k;i>=k+1;i--)
{
printf("%d\n",a[i][k]);
}
}
if(row>col&&col%2!=0)
{
for(i=k;i<row-k;i++)
{
printf("%d\n",a[i][col/2]);
}
}
if(row<col&&row%2!=0)
{
for(j=k;j<col-k;j++)
{
printf("%d\n",a[row/2][j]);
}
}
if(row==col&&row%2!=0)
{
printf("%d",a[row/2][col/2]);
}
} | 46 |
22,650 | int main() {
int row = 0, col = 0, sumtimes = 0, i = 0, j = 0,sum=0;
cin >> row >> col;
int max = row > col ? row : col;
int a[row][col];
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
cin >> a[i][j];
while (sum<row*col) {
for (j = sumtimes / 4; j <= col - 1 - sumtimes / 4; j++) {
cout << a[i][j] << endl;
sum++;
}
if (sum==row*col)break;
sumtimes++;
for (i = sumtimes / 4 + 1; i <= row - 1 - sumtimes / 4 - 1; i++) {
cout << a[i][j - 1] << endl;
sum++;
}
if (sum==row*col)break;
sumtimes++;
for (j--; j >= sumtimes / 4; j--) {
cout << a[i][j] << endl;
sum++;
}
if (sum==row*col)break;
sumtimes++;
for (i--; i >= sumtimes / 4 + 1; i--) {
cout << a[i][j + 1] << endl;
sum++;
}
if (sum==row*col)break;
i++;
sumtimes++;
}
return 0;
}
| 46 |
22,651 | int main(){
int m,n,sz[100][100],x,y,z,a,b,w=0,i;
scanf("%d %d",&m,&n);
for(int p=0;p<m;p++)
{
for(int q=0;q<n;q++)
{
scanf("%d",&sz[p][q]);
}
}
if(m>n)
i=n;
else
i=m;
for(x=0;x<i/2;x++)
{
for(y=0+x;y<n-1-x;y++)
{
printf("%d\n",sz[x][y]);
}
for(z=0+x;z<m-1-x;z++)
{
printf("%d\n",sz[z][y]);
}
for(a=n-1-x;a>0+x;a--){
printf("%d\n",sz[z][a]);
}
for(b=m-1-x;b>0+x;b--)
{
printf("%d\n",sz[b][a]);
}
}
if(m%2==1&&n>=m)
{
w=m/2;
for(y=w;y<=n-1-w;y++)
printf("%d\n",sz[w][y]);
}
else if(n%2==1&&m>=n)
{
w=n/2;
for(x=w;x<=m-1-w;x++)
printf("%d\n",sz[x][w]);
}
return 0;
}
| 46 |
22,652 | int main()
{int sz[100][100];
int hang,lie;
scanf("%d %d",&hang,&lie);
for(int a=0;a<hang;a++){
for(int b=0;b<lie;b++){
scanf("%d",&sz[a][b]);
}
}
int c,d,e,f;
int hs=0,ls=0;
int hz=hang-1,lz=lie-1;
while(hs<=hz&&ls<=lz)
{if(hs!=hz&&lz!=ls)
{for(c=ls;c<=lz-1;c++){
printf("%d\n",sz[hs][c]);
}
for(d=hs;d<=hz-1;d++){
printf("%d\n",sz[d][lz]);
}
for(e=lz;e>=ls+1;e--){
printf("%d\n",sz[hz][e]);
}
for(f=hz;f>=hs+1;f--){
printf("%d\n",sz[f][ls]);
}}
else{for(int m=hs;m<=hz;m++){
for(int n=ls;n<=lz;n++){
printf("%d\n",sz[m][n]);
}
}}
hs++;
ls++;
hz--;
lz--;
}
return 0;
} | 46 |
22,653 | int main()
{
int x[100][100];
int a,b;
scanf("%d %d",&a,&b);
int m,n;
for(m=0;m<a;m++)
{
for(n=0;n<b;n++)
{
scanf("%d",&x[m][n]);
}
}
int xx_row=0,sx_row=a-1;
int xx_col=0,sx_col=b-1;
int i,j;
while((xx_row<sx_row)&&(xx_col<sx_col))
{
for(j=xx_col;j<sx_col;j++)
{
printf("%d\n",x[xx_row][j]);
}
for(i=xx_row;i<sx_row;i++)
{
printf("%d\n",x[i][sx_col]);
}
for(j=sx_col;j>xx_col;j--)
{
printf("%d\n",x[sx_row][j]);
}
for(i=sx_row;i>xx_row;i--)
{
printf("%d\n",x[i][xx_col]);
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;
}
if((xx_row==sx_row)&&(xx_col==sx_col))
{
printf("%d\n",x[xx_row][xx_col]);
}
if((xx_row==sx_row)&&(xx_col!=sx_col))
{
for(i=xx_col;i<=sx_col;i++)
{ printf("%d\n",x[xx_row][i]);}
}
if((xx_col==sx_col)&&(xx_row!=sx_row))
{
for(i=xx_row;i<=sx_row;i++)
{ printf("%d\n",x[i][xx_col]);}
}
return 0;
}
| 46 |
22,654 |
int main()
{
int sz[100][100],i,j,row,k,col;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
for(i=0;i<row-1-i&&i<col-1-i;i++)
{
for(j=i;j<col-1-i;j++)
printf("%d\n",sz[i][j]);
for(j=i;j<row-1-i;j++)
printf("%d\n",sz[j][col-1-i]);
for(j=col-1-i;j>i;j--)
printf("%d\n",sz[row-1-i][j]);
for(j=row-1-i;j>i;j--)
printf("%d\n",sz[j][i]);
}
if(i==row-i-1&&i==col-i-1)
printf("%d\n",sz[i][i]);
if(i==row-1-i&&i<col-i-1)
{
for(k=i;k<col-i;k++)
printf("%d\n",sz[i][k]);
}
if(i<row-1-i&&i==col-1-i)
{
for(k=i;k<row-i;k++)
printf("%d\n",sz[k][i]);
}
return 0;
} | 46 |
22,655 |
void main()
{
int m,n;
int a[100][100]={0};
int b[100][100]={0};
int i,j;
int k,te;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
int u=0;
int tem=0;
for(i=0;i<m*n;)
{
if(u%4==0)
{
j=tem;
for(k=0;k<n;k++)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
te=k;
b[j][k]=1;
i++;
}
}
if(u%4==1)
{
k=te;
for(j=0;j<m;j++)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
tem=j;
b[j][k]=1;
i++;
}
}
if(u%4==2)
{
j=tem;
for(k=n-1;k>=0;k--)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
te=k;
b[j][k]=1;
i++;
}
}
if(u%4==3)
{
k=te;
for(j=m-1;j>=0;j--)
if(b[j][k]==0)
{
printf("%d\n",a[j][k]);
tem=j;
b[j][k]=1;
i++;
}
}
u++;
}
} | 46 |
22,656 | int main()
{
int n,m,M,N,i,t,e,k,s[200][200];
scanf("%d%d", &N, &M);
t=M*N;
e=0;
for(n=0;n<N;n++)
{
for(m=0;m<M;m++)
{
scanf("%d", &s[n][m]);
}
}
for(k=0;k<103;k++)
{
for(i=k;i<M-k;i++)
{
printf("%d\n", s[k][i]);
e++;
}
if(e==t)
{
break;
}
for(i=k+1;i<N-k;i++)
{
printf("%d\n", s[i][M-k-1]);
e++;
}
if(e==t)
{
break;
}
for(i=M-k-2;i>k-1;i--)
{
printf("%d\n", s[N-k-1][i]);
e++;
}
if(e==t)
{
break;
}
for(i=N-k-2;i>k;i--)
{
printf("%d\n", s[i][k]);
e++;
}
if(e==t)
{
break;
}
}
return 0;
}
| 46 |
22,657 | int main(){
int a[100][100];
int row,col,i,j,x=0,y;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
int sum=0;
i=0;
while(sum<(row*col)){
for(j=x;j<col;j++){
printf("%d\n",a[i][j]);
sum++;
a[i][j]=-1;
y=j;
if(a[i][j+1]==-1){
break;
}
}
if(sum==row*col){
break;
}
for(i=i+1;i<row;i++){
printf("%d\n",a[i][y]);
sum++;
a[i][y]=-1;
x=i;
if(a[i+1][y]==-1){
break;
}
}
if(sum==row*col){
break;
}
for(j=y-1;j>=0;j--){
printf("%d\n",a[x][j]);
sum++;
a[x][j]=-1;
y=j;
if(a[x][j-1]==-1){
break;
}
}
if(sum==row*col){
break;
}
for(i=x-1;i>0;i--){
printf("%d\n",a[i][y]);
sum++;
a[i][y]=-1;
x=i;
if(a[i-1][y]==-1){
break;
}
}
if(sum==row*col){
break;
}
}
return 0;
}
| 46 |
22,658 | int sz[100][100];
int main(){
int k,ROW,COL,row,col,time=0,m=0;
scanf("%d %d",&ROW,&COL);
for(row=0;row<ROW;row++){
for(col=0;col<COL;col++){
scanf("%d",&sz[row][col]);
}
}
for(k=0;k<100;k++){
for(col=k;col<COL-k-1;col++){
printf("%d\n",sz[k][col]);
time++;
if(time==COL*ROW){
m=1;
break;
}
}
for(row=k;row<ROW-k-1;row++){
if(m==1) break;
printf("%d\n",sz[row][COL-k-1]);
time++;
if(time==COL*ROW){
m=1;
break;
}
}
for(col=COL-k-1;col>k;col--){
if(m==1) break;
printf("%d\n",sz[ROW-k-1][col]);
time++;
if(time==COL*ROW){
m=1;
break;
}
}
for(row=ROW-k-1;row>k;row--){
if(m==1) break;
printf("%d\n",sz[row][k]);
time++;
// printf("time=%d\n",time);
if(time==COL*ROW){
m=1;
break;
}
}
if(time==COL*ROW-1){
printf("%d",sz[(ROW-1)/2][(COL-1)/2]);
break;
}
if(m==1) break;
}
return 0;
}
| 46 |
22,659 | int main()
{
int array[100][100];
int row,col,i,j,k,n;
scanf("%d%d",&row,&col);
if(row>col){
n=(col+1)/2;
}
else{
n=(row+1)/2;
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&(array[i][j]));
}
}
for(k=1;k<=n;k++){
for(i=k-1,j=k-1;j<=col-k;j++){
printf("%d\n",array[i][j]);
}
for(j=col-k,i=k;i<=row-k;i++){
printf("%d\n",array[i][j]);
}
if(row-k>k-1){
for(i=row-k,j=col-k-1;j>=k-1;j--){
printf("%d\n",array[i][j]);
}
}
if(k-1<col-k){
for(j=k-1,i=row-k-1;i>=k;i--){
printf("%d\n",array[i][j]);
}
}
}
return 0;
} | 46 |
22,660 | int main()
{
int a[100][100]= {0}, r, c, i, j, n = 0;
cin >> r >> c ;
for (i = 1; i <= r; i++)
{
for (j = 1; j <= c; j++)
{
cin >> a[i][j];
}
}
j = 1;
i = 0;
while ((2 * n < c - 1) && (2 * n < r - 1))
{
for (i = 1 + n; i <= c - n; i++)
{
cout << a[j][i] << endl;
}
i--;
for (j = j + 1; j <= r - n; j++)
{
cout << a[j][i] << endl;
}
j--;
for (i = i - 1; i >= 1 + n; i--)
{
cout << a[j][i] << endl;
}
i++;
for (j = j - 1; j > 1 + n; j--)
{
cout << a[j][i] << endl;
}
j++;
n++;
}
if(2 * n == r - 1)
for (i = 1 + n; i <= c - n; i++)
{
cout << a[j][i] << endl;
}
else if(2 * n == c - 1)
for (j = j; j <= r - n; j++)
{
cout << a[j][i + 1] << endl;
}
return 0;
}
| 46 |
22,661 |
int main()
{
int array[110][110], row, col; //????array???row???col
int x = 0, y = 0; //x???????????????y?????
int m = 0, n = 0; //m???????n??????
cin >> row >> col; //???????
for ( int i = 0; i < row; i++ )
{
for ( int j = 0; j < col; j++ )
{
cin >> array[i][j]; //??????
}
}
while ( n < col && m < row )
{
if ( y >= col - n )
break;
while ( y < col - n )
{
cout << array[x][y] << endl;
y++;
}
y--;
x++;
if ( x >= row - m )
break;
while ( x < row - m )
{
cout << array[x][y] << endl;
x++;
}
x--;
y--;
if ( y < n )
break;
while ( y >= n )
{
cout << array[x][y] << endl;
y--;
}
y++;
x--;
m++;
if ( x < m )
break;
while ( x >= m )
{
cout << array[x][y] << endl;
x--;
}
x++;
y++;
n++;
}
return 0;
}
| 46 |
22,662 | int main()
{
int a[100][100],h,l,i,j,e,b,c,d,t=0;
scanf("%d %d",&h,&l);
for(i=0;i<h;i++)
{
for(j=0;j<l;j++)
scanf("%d",&a[i][j]);
}
for(e=0,b=0,c=l,d=h;e<h,b<l,c>=0,d>=0;e++,b++,c--,d--)
{
for(i=e,j=b;j<c;j++)
printf("%d\n",a[i][j]);
t+=c-b;
if(t>=h*l)
break;
for(j=c-1,i=e+1;i<d;i++)
printf("%d\n",a[i][j]);
if(t>=h*l)
break;
t+=d-e-1;
for(i=d-1,j=c-2;j>b-1;j--)
printf("%d\n",a[i][j]);
if(t>=h*l)
break;
t+=c-b-1;
for(j=b,i=d-2;i>e;i--)
printf("%d\n",a[i][j]);
t+=d-e-2;
if(t>=h*l)
break;
}
return 0;
} | 46 |
22,663 | int main()
{
int a[100][100];
int m,n,i,j,k;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
for(k=0;2*k<m&&2*k<n;k++)
{
for(i=k,j=k;j<n-k-1;j++)
{
printf("%d\n",a[i][j]);
}
for(;i<m-k-1;i++)
{
printf("%d\n",a[i][j]);
}
if(i==k||j==k)
{
printf("%d\n",a[i][j]);
break;
}
for(;j>k;j--)
{
printf("%d\n",a[i][j]);
}
for(;i>k;i--)
{
printf("%d\n",a[i][j]);
}
}
return 0;
} | 46 |
22,664 | int main()
{
int row,col;
cin>>row>>col;
int shuzu[100][100];
int p=0,q=0,count=0;
for(p=0;p<row;p++)
for(q=0;q<col;q++){cin>>shuzu[p][q];}
for(;row-count>0&&col-count>0;)
{
p=count;for(q=count;q<col;q++){cout<<shuzu[p][q]<<endl;}
if(row==count+1)return 0;
q=col-1;for(p=count+1;p<row;p++){cout<<shuzu[p][q]<<endl;}
if(col==1+count)return 0;
p=row-1;for(q=col-2;q>=count;q--){cout<<shuzu[p][q]<<endl;}
q=count;for(p=row-2;p>count;p--){cout<<shuzu[p][q]<<endl;}
row--;col--;count++;
}
return 0;
} | 46 |
22,665 | int judge(int a[101][101],int m,int n,int i,int j){
if(i==0&&j<n-1) return 2;
if(j==n-1&&i<m-1) return 3;
if(i==m-1&&j>0) return 4;
if(j==0&&i>1) return 1;
if(a[i-1][j]!=-1&&a[i][j-1]==-1) return 1;
if(a[i][j+1]!=-1) return 2;
if(a[i+1][j]!=-1) return 3;
if(a[i][j-1]!=-1) return 4;
return 0;
}
void main(){
int m,n,i,j,a[101][101];
int judge(int a[101][101],int n,int m,int i,int j);
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++) scanf("%d",&a[i][j]);
i=j=0;
if(m==1&&n==1) printf("%d\n",a[0][0]);
else{
while(judge(a,m,n,i,j)!=0){
if(a[i][j]>0) printf("%d\n",a[i][j]);
else break;
a[i][j]=-1;
switch (judge(a,m,n,i,j)){
case 1:i--;break;
case 2:j++;break;
case 3:i++;break;
case 4:j--;break;
}
};
if(a[i][j]>0) printf("%d\n",a[i][j]);
}
}
| 46 |
22,666 | 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]);}
}
}
scanf("%d %d",&m,&n);
return 0;
} | 46 |
22,667 | //*********************************************
//** ??: ???????? **
//** ??: ??? 1300012722 **
//** ??: 2013.11.1 **
//*********************************************
int main()
{
int row, col, n, i, j, count = 0, sum; //??????row,???col, ??????????????????n????????count
int array[120][120],times; //??????,????times
cin >> row >> col; //?????????
sum = row * col; //???????????sum
for (i = 1; i <= row; i++)
for (j = 1; j <= col; j++)
cin >> array[i][j]; //???????row??col????????????
i = 1;
j = 1; //?i?j????????????array[1][1]
while (1)
{
n = i;
for (j = n; j <= col - n + 1; j++)
{
cout << array[i][j] << endl; //???????????
count++;
}
j--;
i++;
if (count >= sum)
break; //???????????????
for ( ; i <= row - n + 1; i++)
{
cout << array[i][j] << endl; //????????????
count++;
}
if (count >= sum)
break; //???????????????
i--;
j--;
for ( ; j >= n; j--)
{
cout << array[i][j] << endl; //????????????
count++;
}
if (count >= sum)
break; //???????????????
j++;
i--;
for ( ; i > n; i--)
{
cout << array[i][j] << endl; //???????????
count++;
}
if (count >= sum)
break; //???????????????
i++;
j++;
}
return 0;
} | 46 |
22,668 | int main(){
int col,row,i,k,a,e,x;
int sz[100][100];
scanf("%d%d",&row,&col);
for(k=0;k<row;k++){
for(i=0;i<col;i++){
scanf("%d",&sz[k][i]);
}
}
k=0;i=-1;e=0;
for(x=0;;x=x+2){a=0;
for(i=i+1;i<col;i++){
printf("%d\n",sz[k][i]);a++;e++;
if(a==col-x){break;}
}
if(e==row*col){break;}
a=0;
for(k=k+1;k<row;k++){
printf("%d\n",sz[k][i]);a++;e++;
if(a==row-1-x){break;}
}
if(e==row*col){break;}
a=0;
for(i=i-1;i>=0;i--){
printf("%d\n",sz[k][i]);a++;e++;
if(a==col-1-x){break;}
}
if(e==row*col){break;}
a=0;
for(k=k-1;k>=0;k--){
printf("%d\n",sz[k][i]);a++;e++;
if(a==row-2-x){break;}
}
if(e==row*col){break;}
}
return 0;
}
| 46 |
22,669 | int main(){
int a,b,i,j,k;
int s[100][100];
scanf("%d %d",&a,&b);
for(i=0;i<a;i++){
for(j=0;j<b;j++){
scanf("%d",&s[i][j]);
}
}
for(k=0;k<a*1.0/2&&k<b*1.0/2;k++){
if(b<=a&&k*2==b-1){
for(i=k;i<=a-k-1;i++){
printf("%d\n",s[i][k]);
}
}else if(a<b&&k*2==a-1){
for(j=k;j<=b-k-1;j++){
printf("%d\n",s[k][j]);
}
}else{
for(j=k;j<=b-k-1;j++){
printf("%d\n",s[k][j]);
}
for(i=k+1;i<=a-k-1;i++){
printf("%d\n",s[i][b-k-1]);
}
for(j=b-k-2;j>=k;j--){
printf("%d\n",s[a-k-1][j]);
}
for(i=a-k-2;i>=k+1;i--){
printf("%d\n",s[i][k]);
}
}
}
return 0;
} | 46 |
22,670 | int main()
{
int row,col,i,j,a,b,c,k,temp;
int sz[100][100];
scanf("%d%d",&row,&col);
if(row>col)
temp=col;
else
temp=row;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);}}
for(a=0;a<((temp+1)/2);a++){
for(i=a;i<col;i++){
printf("%d\n",sz[a][i]);}
col-=1;
for(j=a+1;j<row;j++){
printf("%d\n",sz[j][col]);}
row-=1;
if(row==a)
break;
for((k=col-1);k>=a;k--){
printf("%d\n",sz[row][k]);}
b=k+1;
if(col==a)
break;
for((c=row-1);c>=a+1;c--){
printf("%d\n",sz[c][b]);}
}
return 0;
} | 46 |
22,671 | int main()
{
int a,b;
cin>>a>>b;
int n[a][b];
int s=0,e=b-1,p=0,q=a-1;
for(int i=0;i<a;i++)
for(int j=0;j<b;j++)
cin>>n[i][j];
if(s==e)
for(int i=p;i<=q;i++)
cout<<n[i][0]<<endl;
else if(p==q) for(int i=s;i<=e;i++)
cout<<n[0][i]<<endl;
while(s<e&&p<q)
{
for(int i=s;i<e;i++){
cout<<n[p][i]<<endl;
}
for(int i=p;i<q;i++)
{cout<<n[i][e]<<endl;}
for(int i=e;i>s;i--)
{cout<<n[q][i]<<endl;}
for(int i=q;i>p;i--)
{cout<<n[i][s]<<endl;}
s++;
e--;
p++;
q--;
if(s==e){for(int i=p;i<=q;i++)
{cout<<n[i][s]<<endl;}
break;
}
if(p==q){for(int i=s;i<=e;i++)
{cout<<n[p][i]<<endl;}
break;
}
}
return 0;
}
| 46 |
22,672 | void main()
{
int array[200][200]={0};
int r,c;
int i,j;
int k=0,l=0;
scanf("%d %d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
{
scanf("%d",&array[i][j]);
}
if (r%2==0&&c%2==0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
printf("%d\n",array[i][k]);
}
}
else if (r%2!=0&&c%2==0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
printf("%d\n",array[i][k]);
}
for(j=k;j<=c-1-k;j++)
printf("%d\n",array[r/2][j]);
}
else if (r%2==0&&c%2!=0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
{
printf("%d\n",array[i][k]);
l=k+1;
}
}
for(i=c-1-l;i<=r-1-l;i++)
printf("%d\n",array[i][c/2]);
}
else //if (r%2!=0&&c%2!=0)
{
for(k=0;k<r/2;k++)
{
for(j=k;j<c-1-k;j++)
printf("%d\n",array[k][j]);
for(i=k;i<r-1-k&&k<c-1-k;i++)
printf("%d\n",array[i][c-1-k]);
for(j=c-1-k;j>k;j--)
printf("%d\n",array[r-1-k][j]);
for(i=r-1-k;i>k&&c-1-k>k;i--)
{
printf("%d\n",array[i][k]);
l=k+1;
}
}
if(r>=c)
{
for(i=l;i<=r-1-l;i++)
printf("%d\n",array[i][c/2]);
}
else
{
for(j=k;j<=c-1-k;j++)
printf("%d\n",array[r/2][j]);
}
}
}
| 46 |
22,673 |
int main()
{
int m, n, a[100][100], visit[100][100] = {0};
int i, j;
int count = 0;
int type; //1??????????2??????????3????4???
cin >> m >> n;
for (i = 1; i <= m; i++)
for (j = 1; j <= n; j++)
cin >> a[i][j];
i = 1, j = 1, type = 1; //?(1,1)???,??????
while (count < m * n) //????????
{
cout << a[i][j] << endl;
visit[i][j] = 1;
count++;
if (type == 1) //???????????????(i,j)?
{
if (j < n && visit[i][j + 1] == 0) //???????
j++;
else //??????
{
type = 2;
i++;
}
continue;
}
if (type == 2)
{
if (i < m && visit[i + 1][j] == 0)
i++;
else
{
type = 3;
j--;
}
continue;
}
if (type == 3)
{
if (j > 1 && visit[i][j - 1] == 0)
j--;
else
{
type = 4;
i--;
}
continue;
}
if (type == 4)
{
if (i > 1 && visit[i - 1][j] == 0)
i--;
else
{
type = 1;
j++;
}
continue;
}
}
return 0;
} | 46 |
22,674 | int main()
{
int a[100][100]={0},i,j,m,n,s,t,u,v;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
i=0;
j=0;
s=0;
t=0;
u=0;
v=0;
for(;;)
{
do
{
printf("%d\n",a[i][j]);
j=j+1;
}
while (j!=n-s);
j=j-1;
s=s+1;
i=i+1;
if (v+t+1==m) break;
do
{
printf("%d\n",a[i][j]);
i=i+1;
}
while (i!=m-t);
i=i-1;
t=t+1;
j=j-1;
if (u+s==n) break;
do
{
printf("%d\n",a[i][j]);
j=j-1;
}
while (j!=u-1);
u=u+1;
j=j+1;
i=i-1;
if (v+t+1==m) break;
do
{
printf("%d\n",a[i][j]);
i=i-1;
}
while (i!=v);
v=v+1;
i=i+1;
j=j+1;
if (u+s==n) break;
}
return 0;
}
| 46 |
22,675 |
int main(){
int m[100][100],h,l,i,j,sxh,xxh,zxl,yxl;
scanf("%d%d",&h,&l);
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d",&m[i][j]);
}
}
sxh=0;
xxh=h-1;
zxl=0;
yxl=l-1;
if(h%2==0&&l%2==0){
while(sxh<xxh&&zxl<yxl){
for(i=zxl;i<yxl;i++)
printf("%d\n",m[sxh][i]);
for(i=sxh;i<xxh;i++)
printf("%d\n",m[i][yxl]);
for(i=yxl;i>zxl;i--)
printf("%d\n",m[xxh][i]);
for(i=xxh;i>sxh;i--)
printf("%d\n",m[i][zxl]);
sxh++;
xxh--;
zxl++;
yxl--;
}
}
else if((h%2==1||l%2==1)&&h>l){
while(sxh<xxh&&zxl<yxl){
for(i=zxl;i<yxl;i++)
printf("%d\n",m[sxh][i]);
for(i=sxh;i<xxh;i++)
printf("%d\n",m[i][yxl]);
for(i=yxl;i>zxl;i--)
printf("%d\n",m[xxh][i]);
for(i=xxh;i>sxh;i--)
printf("%d\n",m[i][zxl]);
sxh++;
xxh--;
zxl++;
yxl--;
}
for(i=sxh;i<=xxh;i++)
printf("%d\n",m[i][zxl]);
}
else if((h%2==1||l%2==1)&&h<=l){
while(sxh<xxh&&zxl<yxl){
for(i=zxl;i<yxl;i++)
printf("%d\n",m[sxh][i]);
for(i=sxh;i<xxh;i++)
printf("%d\n",m[i][yxl]);
for(i=yxl;i>zxl;i--)
printf("%d\n",m[xxh][i]);
for(i=xxh;i>sxh;i--)
printf("%d\n",m[i][zxl]);
sxh++;
xxh--;
zxl++;
yxl--;
}
for(i=zxl;i<=yxl;i++)
printf("%d\n",m[sxh][i]);
}
return 0;
}
| 46 |
22,676 | /*
* 6.cpp
*
* Created on: 2012-11-9
* Author: AK
*/
int main(){
int row,col,i,j,head,bottom,left,right;
cin>>row>>col;
int a[100][100];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
{cin>>a[i][j];}
head=0,bottom=row-1,left=0,right=col-1;i=0;
for(;head<=bottom&&left<=right;){
if(head>bottom||left>right) break;
for(j=left;j<=right;j++)
cout<<a[i][j]<<endl;
j--;
head++;
if(head>bottom||left>right) break;
for(i=head;i<=bottom;i++)
cout<<a[i][j]<<endl;
i--;
right--;
if(head>bottom||left>right) break;
for(j=right;j>=left;j--)
cout<<a[i][j]<<endl;
j++;
bottom--;
if(head>bottom||left>right) break;
for(i=bottom;i>=head;i--)
cout<<a[i][j]<<endl;
i++;
left++;
}
return 0;
} | 46 |
22,677 | 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;
}
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;
}
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;
}
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;
}
if(num==k)
break;
}
} | 46 |
22,678 |
int main()
{
int n,m;
int sz[100][100],i,j,a=0,b=0,c=0,d=0,k,kk,kkk,kkkk;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
scanf("%d",&sz[i][j]);
}
}
while(1)
{
k=0;
kk=0;
kkk=0;
kkkk=0;
for(i=a+1;i<=m-c;i++)
{
printf("%d\n",sz[b+1-1][i-1]);
k=1;
}
if(k==0)
{
break;
}
c++;
for(i=b+2;i<=n-d;i++)
{
printf("%d\n",sz[i-1][m-(c-1)-1]);
kk=1;
}
if(kk==0)
{
break;
}
d++;
for(i=m-c;i>=a+1;i--)
{
printf("%d\n",sz[n-(d-1)-1][i-1]);
kkk=1;
}
if(kkk==0)
{
break;
}
a++;
for(i=n-d;i>=b+2;i--)
{
printf("%d\n",sz[i-1][a-1]);
kkkk=1;
}
b++;
if(kkkk==0)
{
break;
}
}
return 0;
} | 46 |
22,679 | int main()
{
int a,b,i,j,matrix[100][100];
scanf("%d%d",&a,&b);
for(i=0;i<a;i++)
{
for(j=0;j<b;j++)
{
scanf("%d",&matrix[i][j]);
getchar();
}
}
while(a>0&&b>0)
{
for(i=0;i<b;i++)
printf("%d\n",matrix[0][i]);
for(i=1;i<a;i++)
printf("%d\n",matrix[i][b-1]);
if(b>1&&a>1)
{
for(i=b-2;i>=0;i--)
printf("%d\n",matrix[a-1][i]);
for(i=a-2;i>=1;i--)
printf("%d\n",matrix[i][0]);
}
for(i=0;i<a-2;i++)
{
for(j=0;j<b-2;j++)
matrix[i][j]=matrix[i+1][j+1];
}
a=a-2;
b=b-2;
}
return 0;
} | 46 |
22,680 | int main()
{
int n,m;
scanf("%d %d",&n,&m);
int sz[100][100];
int x=0,y;
while(x<n){
for(y=0;y<m;y++){
scanf("%d",&(sz[x][y]));
}
x++;
}
int xx_row,xx_col,sx_row,sx_col;
int i,j;
xx_row=xx_col=0;
sx_row=n-1;
sx_col=m-1;
while(xx_row<sx_row && xx_col<sx_col){
for(j=xx_col;j<sx_col;j++){
printf("%d\n",sz[xx_row][j]);
}
for(i=xx_row;i<sx_row;i++){
printf("%d\n",sz[i][sx_col]);
}
for(j=sx_col;j>xx_col;j--){
printf("%d\n",sz[sx_row][j]);
}
for(i=sx_row;i>xx_row;i--){
printf("%d\n",sz[i][xx_col]);
}
xx_row++;
xx_col++;
sx_row--;
sx_col--;
}
if(xx_row==sx_row){
for(j=xx_col;j<=sx_col;j++){
printf("%d\n",sz[sx_row][j]);
}
}else{
if(xx_col==sx_col){
for(i=xx_row;i<=sx_row;i++){
printf("%d\n",sz[i][sx_col]);
}
}
}
return 0;
}
| 46 |
22,681 | //*******************************
// ???? ??????????
// ?? ? ??? 1300012972
// ?? ? 2013.11.6
//*******************************
int main()
{
int step = 0, row, col, x[4] = {0, 1, 0, -1}, y[4] = {1, 0, -1, 0}, array[100][100], i, j, acc[100][100] = {0}, d = 0;
cin >> row >> col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> array[i][j];
i = 0;
j = -1;
while (step < row * col)
{
i += x[d];
j += y[d];
if (i >= 0 && i < row && j >= 0 && j < col && acc[i][j] == 0)
{
cout << array[i][j] << endl;
acc[i][j] = 1;
step++;
}
else
{
i -= x[d];
j -= y[d];
d = (d + 1) % 4;
}
}
return 0;
}
| 46 |
22,682 | int main()
{
int row, col, u, v, w, x, y;
cin >> row >> col;
int a = 0, b;
int c = 1, d;
int num[150][150] = {0};
for (u = 0; u <= row - 1; u++)
{
for (v = 0; v <= col - 1; v++)
{
scanf("%d", &num[u][v]);
}
}
b = col - 1;
d = row - 1;
for (u = 0; u <= (row - 1) / 2; u++)
{
if (u>b) break;
for (v = u; v <= b; v++)
{
cout << num[u][v] << endl;
}
for (w = u + 1; w <= d; w++)
{
cout << num[w][b] << endl;
}
for (x = b - 1; x >= u; x--)
{
if (u < d)
cout << num[d][x] << endl;
}
for (y = d - 1; y >= u + 1; y--)
{
if (u < b)
cout << num[y][u] << endl;
}
b--;
d--;
}
return 0;
}
/*
a=0;b=m-1;c=0;d=n-1;
while (a<=b && c<=d)
{
print(..);
a++;b--;c++;d--;
}
*/ | 46 |
22,683 | int main()
{
int n, m, i, j, a[101][101], round, count;
cin >> n >> m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
cin >> a[i][j];
i=1;
j=1;
round=0;
count=0; //??????
while (count<n*m) //????????
{
while (j<=m-round)
{
cout << a[i][j] << endl;
count++;
j++;
}
if (count>=n*m) break;
j--;
i++; //????
while (i<=n-round)
{
cout << a[i][j] << endl;
count++;
i++;
}
if (count>=n*m) break;
i--;
j--; //????
while (j>=round+1)
{
cout << a[i][j] << endl;
count++;
j--;
}
if (count>=n*m) break;
j++;
i--; //????
while (i>=round+2)
{
cout << a[i][j] << endl;
count++;
i--;
}
if (count>=n*m) break;
i++;
j++; //????
round++; //???????
}
return 0; //main???????0
} | 46 |
22,684 | int main()
{
int row,col,a[100][100],i,j,k,b[100][100];
cin>>row>>col;
for(i=0;i<=row-1;i++)
for(j=0;j<=col-1;j++)
{cin>>a[i][j];
b[i][j]=0;}
if(row==1)
{for(i=0;i<=col-1;i++) cout<<a[0][i]<<endl;}
else{
for(i=0;i<=(col-1)/2;i++)
{for(k=i;k<=col-i-1;k++)
{if(b[i][k]==0) {cout<<a[i][k]<<endl;b[i][k]=1;}}
for(k=i+1;k<=row-2-i;k++)
{if(b[k][col-1-i]==0) {cout<<a[k][col-1-i]<<endl;b[k][col-1-i]=1;}}
for(k=col-1-i;k>=i;k--)
{if(b[row-1-i][k]==0) {cout<<a[row-1-i][k]<<endl;b[row-1-i][k]=1;}}
for(k=row-2-i;k>=i+1;k--)
{if(b[k][i]==0) {cout<<a[k][i]<<endl;b[k][i]=1;}}
}}
return 0;} | 46 |
22,685 | int main()
{
int a[101][101],r,c,b[10000];//??a??????????b????????????
cin>>r>>c;
for(int i=0;i<=r-1;i++)//????
for(int j=0;j<=c-1;j++)
{
cin>>a[i][j];
}
int e=1,w1=0,w2=0,w3=0,w4=0,p=1;;
for(int k=1;k<=100000;k++)//?????????????b?
{
if(e==1)//??????
{
for(int i=w4;i<=c-1-w2;i++)
{
b[p]=a[w1][i];
p=p+1;
}
w1++;
e=2;
if(w2+w4==c||w1+w3>r)
{
for(int j=1;j<=p-1;j++)
cout<<b[j]<<endl;
break;
}
}
if(e==2)//??????
{
for(int i=w1;i<=r-1-w3;i++)
{
b[p]=a[i][c-1-w2];
p++;
}
w2++;
e=3;
if(w2+w4>c||w1+w3==r)
{
for(int j=1;j<=p-1;j++)
cout<<b[j]<<endl;
break;
}
}
if(e==3)//??????
{
for(int i=c-w2-1;i>=w4;i--)
{
b[p]=a[r-w3-1][i];
p++;
}
w3++;
e=4;
if(w2+w4==c||w1+w3>r)
{
for(int j=1;j<=p-1;j++)
cout<<b[j]<<endl;
break;
}
}
if(e==4)//??????
{
for(int i=r-w3-1;i>=w1;i--)
{
b[p]=a[i][w4];
p++;
}
w4++;
e=1;
if(w2+w4>c||w1+w3==r)
{
for(int j=1;j<=p-1;j++)
cout<<b[j]<<endl;
break;
}
}
}
return 0;
} | 46 |
22,686 | int main()
{
int i,j,k,l,row,col,shuzu[100][100],n=0,m=0,b=1;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&shuzu[i][j]);
}
}
for(i=0;;i++){
for(j=m;j<col-i;j++){
printf("%d\n",shuzu[i][j]);
n++;
}
m++;
if(n==row*col){
break;
}
for(j=b;j<row-i;j++){
k=col-1-i;
printf("%d\n",shuzu[j][k]);
n++;
}
b++;
if(n==row*col){
break;
}
for(j=k-1;j>=i;j--){
l=row-1-i;
printf("%d\n",shuzu[l][j]);
n++;
}
if(n==row*col){
break;
}
for(j=l-1;j>i;j--){
printf("%d\n",shuzu[j][i]);
n++;
}
if(n==row*col){
break;
}
}
return 0;
}
| 46 |
22,687 | int main(){
int i,j,k=1,n,m;
int sz[100][100];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=1;k<=n/2&&k<=m/2;k++){
for(i=k-1,j=k-1;j<m-k;j++){
printf("%d\n",sz[i][j]);
}
for(i=k-1,j=m-k;i<n-k;i++){
printf("%d\n",sz[i][j]);
}
for(i=n-k,j=m-k;j>k-1;j--){
printf("%d\n",sz[i][j]);
}
for(i=n-k,j=k-1;i>k-1;i--){
printf("%d\n",sz[i][j]);
}
}
if(n%2!=0&&n<=m){
for(j=k-1;j<=m-k;j++){
printf("%d\n",sz[n/2][j]);
}
}
else if(m%2!=0){
for(i=k-1;i<=n-k;i++){
printf("%d\n",sz[i][m/2]);
}
}
return 0;
}
| 46 |
22,688 | int main()
{
int array[100][100], row, col, i, j, l, k, m, t, f[100][100]={0};
cin >> row >> col;
for ( i = 0; i < row; i ++)
{
for ( j = 0; j < col; j ++)
{
cin >> array[i][j];
}
}
i = 0;
m = -1;
k = row * col;
while ( k > 0 )
{
for ( j = m + 1; j < col; j ++)
{
if ( f[i][j] == 0 )
{
cout << array[i][j] <<'\n';
k --;
f[i][j] = 1;
}
else
break;
}
for ( t = i + 1; t < row; t ++)
{
if ( f[t][j - 1] == 0 )
{
cout << array[t][j - 1] <<'\n';
k --;
f[t][j - 1] = 1;
}
else
break;
}
for ( l = j - 2; l >= 0; l --)
{
if ( f[t - 1][l] == 0 )
{
cout << array[t - 1][l] <<'\n';
k --;
f[t - 1][l] = 1;
}
else
break;
}
for ( m = t - 2; m >= 0; m --)
{
if ( f[m][l + 1] == 0 )
{
cout << array[m][l + 1] <<'\n';
k --;
f[m][l + 1] = 1;
}
else
break;
}
i ++;
}
return 0;
}
| 46 |
22,689 | //============================================================================
// Name : ex4.6.cpp
// Author : Zhang Yu
// Version :
// Copyright : Your copyright notice
// Description : ????????
//============================================================================
int array[100][100];
int main() {
int row;
cin >>row;
int col;
cin >>col;
for (int i=0;i<=row-1;++i)
for (int j=0;j<=col-1;++j)
cin >>array[i][j];
int row0=0;
int col0=0;
int row1=row;
int col1=col;
for (;;)
{
for (int j=col0;j<=col1-1;++j)//????????
cout <<array[row0][j]<<endl;
++row0;//?????????
for (int k=row0;k<=row1-1;++k)//????????
cout <<array[k][col1-1]<<endl;
--col1;//?????????
for (int p=col1-1;row1-1>=row0 && p>=col0;--p)//????????
cout <<array[row1-1][p]<<endl;
--row1;//?????????
for (int q=row1-1;col0<=col1-1 &&q>=row0;--q)//????????
cout <<array[q][col0]<<endl;
++col0;//?????????
if (row0>=row1||col0>=col1)
break;
}
return 0;
} | 46 |
22,690 | void main()
{
int m,n;
scanf("%d %d",&m,&n);
int a[100][100];
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
int hd/*?????*/,hu/*?????*/,lr/*?????*/,ll/*?????*/;
if(m%2==0 && m<=n) //???????? ??????????
{
for(i=0,j=0;i<=(m/2-1);i++,j++) //????????? ???????? ????????
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
}
if(n%2==0 && m>n)
{
for(i=0,j=0;j<=(n/2-1);i++,j++)
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
}
if(m>n && n%2!=0)
{
for(i=0,j=0;j<=((n-1)/2-1);i++,j++)
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
for(j=(n-1)/2;j<m-(n-1)/2;j++)
printf("%d\n",a[j][(n-1)/2]);
}
if(m<=n && m%2!=0)
{
for(i=0,j=0;i<=((m-1)/2-1);i++,j++)
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
for(i=(m-1)/2;i<n-(m-1)/2;i++)
printf("%d\n",a[(m-1)/2][i]);
}
}
| 46 |
22,691 | int main(int argc, char* argv[])
{
int row,col,i=0,j=0,array[100][100],n=0,t=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
i=0;
j=0;
while(1)
{
for(j=n;j<=col-1-n;j++)
{
printf("%d\n",array[i][j]);
t++;
}
j=j-1;
if(t==row*col)
{
break;
}
for(i=1+n;i<=row-1-n;i++)
{
printf("%d\n",array[i][j]);
t++;
}
i=i-1;
if(t==row*col)
{
break;
}
for(j=col-2-n;j>=n;j--)
{
printf("%d\n",array[i][j]);
t++;
}
j=j+1;
if(t==row*col)
{
break;
}
for(i=row-2-n;i>=1+n;i--)
{
printf("%d\n",array[i][j]);
t++;
}
i=i+1;
if(t==row*col)
{
break;
}
n++;
}
return 0;
} | 46 |
22,692 |
int main()
{
int a[102][102],b[102][102];
int m,n,x,y,i,j;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
int k=1;
x=0;y=0;
printf("%d\n",a[0][0]);
b[0][0]=1;
while(k<m*n)
{
while((y+1<m)&&(b[x][y+1]==0))
{
y++;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
while((x+1<n)&&(b[x+1][y]==0))
{
x++;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
while((y-1>=0)&&(b[x][y-1]==0))
{
y--;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
while((x-1>=0)&&(b[x-1][y]==0))
{
x--;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
}
return 1;
}
| 46 |
22,693 | int main()
{
int i,j,row,col,row0=0,col0=0;
int a[200][200];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
while(row0>=0)
{
if(row0+1==row)
{
for(i=col0;i<col;i++)
printf("%d\n",a[row0][i]);
break;
}
if(col0+1==col)
{
for(i=row0;i<row;i++)
printf("%d\n",a[i][col0]);
break;
}
if(row0+1==row&&col0+1==col)
{
printf("%d\n",a[row0][col0]);
break;
}
for(i=col0;i<col;i++)
printf("%d\n",a[row0][i]);
for(i=row0+1;i<row;i++)
printf("%d\n",a[i][col-1]);
for(i=col-2;i>=col0;i--)
printf("%d\n",a[row-1][i]);
for(i=row-2;i>=row0+1;i--)
printf("%d\n",a[i][col0]);
row0++;
col0++;
row--;
col--;
if(row0>row-1||col0>col-1)
break;
}
return 0;
}
| 46 |
22,694 | void main()
{
int m,n,i,j,a[100][100],l=0,p,q;
scanf("%d%d",&m,&n);
p=m,q=n;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
while(p>2&&q>2)
{
for(j=l;j<n-l;j++)
printf("%d\n",a[l][j]);
for(i=l+1;i<m-l;i++)
printf("%d\n",a[i][n-l-1]);
for(j=n-l-2;j>l;j--)
printf("%d\n",a[m-l-1][j]);
for(i=m-l-1;i>l;i--)
printf("%d\n",a[i][l]);
l++;
p=m-2*l;
q=n-2*l;
}
if(p==1)
for(j=l;j<n-l;j++)
printf("%d\n",a[l][j]);
else if(q==1)
for(i=l;i<m-l;i++)
printf("%d\n",a[i][l]);
else if(p==2)
{
for(j=l;j<n-l;j++)
printf("%d\n",a[l][j]);
for(j=n-l-1;j>=l;j--)
printf("%d\n",a[l+1][j]);
}
else if(q==2)
{
printf("%d\n",a[l][l]);
for(i=l;i<m-l;i++)
printf("%d\n",a[i][l+1]);
for(i=m-l-1;i>l;i--)
printf("%d\n",a[i][l]);
}
} | 46 |
22,695 | int main()
{
int m,n,i,j,num[100][100];
int flag = -1;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0; j<n; j++)
{
scanf("%d", &num[i][j]);
}
//num[i][n] = -10;
}
//for(j = 0; j<=n; j++)
//{
//num[m][j] = -10;
//}
i = 0;
j = 0;
flag = 1;
while(1)
{
if(num[i][j] != -10)
{
printf("%d\n", num[i][j]);
num[i][j] = -10;
}
else
{
break;
}
if(flag == 1)
{
if(j+1<n && num[i][j+1] != -10)
{
j++;
}
else if(i+1 <m )
{
i++;
flag = 2;
}
}
else if(flag == 2)
{
if(i+1<m && num[i+1][j] != -10)
{
i++;
}
else if(j-1 >=0)
{
j--;
flag = 3;
}
}
else if(flag == 3)
{
if(j-1>=0 && num[i][j-1] != -10)
{
j--;
}
else if(i-1 >=0 )
{
i--;
flag = 4;
}
}
else if (flag ==4)
{
if( i-1>=0 && num[i-1][j] != -10)
{
i--;
}
else if(j+1 <n)
{
j++;
flag = 1;
}
}
}
return 0;
}
| 46 |
22,696 | int main()
{
int i,j,n,m,k,N=0;
scanf("%d%d",&n,&m);
int a[100][100];
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&a[i][j]);
}
}
for(k=0;;k++){
for(j=k;j<=m-1-k;j++){
printf("%d\n",a[k][j]);
N++;
}
printf("\n");
if(N==n*m)break;
for(i=k+1;i<=n-1-k;i++){
printf("%d\n",a[i][m-1-k]);
N++;
}
printf("\n");
if(N==n*m)break;
for(j=m-2-k;j>=k;j--){
printf("%d\n",a[n-1-k][j]);
N++;
}
printf("\n");
if(N==n*m)break;
for(i=n-2-k;i>=k+1;i--){
printf("%d\n",a[i][k]);
N++;
}
printf("\n");
if(N==n*m)
break;
}
return 0;
}
| 46 |
22,697 | int x,y,x1,y1;
void next()
{
if((x1==0)&&(y1==1))
{
x1=1;
y1=0;
}
else if((x1==1)&&(y1==0))
{
x1=0;
y1=-1;
}
else if ((x1==0)&&(y1==-1))
{
x1=-1;
y1=0;
}
else if((x1==-1)&&(y1==0))
{
x1=0;
y1=1;
}
}
void main()
{
int a[200][200]={0},row,col,i,j,count;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}
}
x1=0;
y1=1;
for(x=1,y=0,count=1;count<=row*col;)
{
x=x+x1;
y=y+y1;
if(a[x][y]==0)
{
x=x-x1;
y=y-y1;
next();
}
else
{
printf("%d\n",a[x][y]);
a[x][y]=0;
count++;
}
}
} | 46 |
22,698 | int main()
{
int m1[100][100],i,j,k,a,b,c=0,d,e,x=-1;
scanf("%d %d\n",&a,&b);
e=a;d=b;
for(i=0;i<a;i++)
{
for(j=0;j<b;j++){
scanf("%d",&m1[i][j]);}
scanf("\n");
}
for(k=1;k<100000;k++){
x=x+1;
for(j=x;j<b-x;j++)
{
printf("%d\n",m1[x][j]);
c+=1;
}
if(c==d*e)break;
for(i=x+1;i<a-x;i++)
{
printf("%d\n",m1[i][b-x-1]);
c+=1;
}
if(c==d*e)break;
for(j=2+x;j<b+1-x;j++)
{
printf("%d\n",m1[a-1-x][b-j]);
c+=1;
}
if(c==d*e)break;
for(i=2+x;i<a-x;i++)
{
printf("%d\n",m1[a-i][x]);
c+=1;
}
if(c==e*d)break;
}
return 0;
}
| 46 |
22,699 |
int main(){
int sz[100][100],col,row,i,k,count=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(k=0;k<col;k++){
scanf("%d",&sz[i][k]);
}
}
i=0;
k=0;
for(1;1;1){
for(k=k;k<col;k++){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i][k+1]==0||k+1==col){
i=i+1;
break;
}
}
if(count>=col*row){
break;
}
for(i=i;i<row;i++){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i+1][k]==0||i+1==row){
k=k-1;
break;
}
}
if(count>=col*row){
break;
}
for(k=k;k>=0;k--){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i][k-1]==0||k==0){
i=i-1;
break;
}
}
if(count>=col*row){
break;
}
for(i=i;i>=0;i--){
printf("%d\n",sz[i][k]);
sz[i][k]=0;
count++;
if(sz[i-1][k]==0||i==0){
k=k+1;
break;
}
}
if(count>=col*row){
break;
}
}
return 0;
} | 46 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.