id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
22,700 | int main()
{
int flag = 0;
int time = 0;
int i, j, k = 0;
int row, col;
int a[100][100];
cin >> row >> col;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
cin >> a[i][j];
}
}
for (k = 0; k <= row * col; )
{
for (j = time; j < col - time ;j++)
{
cout << a[time][j] << endl;
k ++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
for (i = 1 + time; i < row - time; i++)
{
cout << a[i][col - 1 - time] << endl;
k++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
for (j = col - 2 - time ; j > time; j--)
{
cout << a[row - 1 - time][j] << endl;
k ++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
for (i = row - 1 - time; i > time;i--)
{
cout << a[i][time] << endl;
k ++;
if (k == row * col)
{
flag = 1;
break;
}
}
if (flag)
break;
time ++;
}
return 0;
} | 46 |
22,701 | void main()
{
int row,col,i,j;
int a[100][100];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{for(j=0;j<col;j++)
scanf("%d",&a[i][j]);}
for(;row>1&&col>1;)
{for(j=0;j<col;j++)
printf("%d\n",a[0][j]);
for(i=1;i<row;i++)
printf("%d\n",a[i][col-1]);
for(j=col-2;j>=0;j--)
printf("%d\n",a[row-1][j]);
for(i=row-2;i>=1;i--)
printf("%d\n",a[i][0]);
for(i=0;i<row-2;i++)
{for(j=0;j<col-2;j++)
a[i][j]=a[i+1][j+1];}
row=row-2;
col=col-2;
}
if(row==1)
{for(i=0;i<col;i++)
printf("%d\n",a[0][i]);
}
else
{for(i=0;i<row;i++)
printf("%d\n",a[i][0]);
}
} | 46 |
22,702 | int main()
{
int a[100][100],row,col,i,j,m,k,n,x,y,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=row-1;
j=col-1;
for(k=0;k<100;k++)
{x=k;
y=k;
m=k;
n=k;
for(x=k;x<=j-k;x++)
{printf("%d\n",a[k][x]);
s++;}
if(s==(i+1)*(j+1))
{break;}
for(y=k+1;y<=i-k;y++)
{printf("%d\n",a[y][j-k]);
s++;}
if(s==(i+1)*(j+1))
{ break;}
for(m=j-k-1;m>=k;m--)
{printf("%d\n",a[i-k][m]);
s++;}
if(s==(i+1)*(j+1))
{break;}
for(n=i-k-1;n>=k+1;n--)
{printf("%d\n",a[n][k]);
s++;}
if(s==(i+1)*(j+1))
{break;}}
return 0;} | 46 |
22,703 | int main()
{
int k,i,j,row,col;
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<=row/2 && k<=col/2;k++)
{
for(j=k;j<=col-1-k;j++)
{
printf("%d\n",array[k][j]);
}
for(i=k+1;i<=row-k-1;i++)
{
printf("%d\n",array[i][col-1-k]);
}
if(row-1-k<=k)
break;
for(j=col-k-2;j>=k;j--)
{
printf("%d\n",array[row-1-k][j]);
}
if (col-k-1<=k)
break;
for(i=row-2-k;i>k;i--)
{
printf("%d\n",array[i][k]);
}
}
return 0;
}
| 46 |
22,704 | int rp,re,lp,le;
int a[300][300];
int print(int rp,int re,int lp,int le,int r,int l)
{
int i,j;
if(rp>re||lp>le) return 0;
if(l==lp&&r==rp)
{
for(i=rp,j=lp;j<=le;j++)
printf("%d\n",a[i][j]);
print(rp+1,re,lp,le,rp+1,le);
return 0;
}
if(l==le&&r==rp)
{
for(i=rp,j=le;i<=re;i++)
printf("%d\n",a[i][j]);
print(rp,re,lp,le-1,re,le-1);
return 0;
}
if(l==le&&r==re)
{
for(i=re,j=le;j>=lp;j--)
printf("%d\n",a[i][j]);
print(rp,re-1,lp,le,re-1,lp);
return 0;
}
if(l==lp&&r==re)
{
for(i=re,j=lp;i>=rp;i--)
printf("%d\n",a[i][j]);
print(rp,re,lp+1,le,rp,lp+1);
return 0;
}
}
int main()
{
int r,l;
scanf("%d %d",&r,&l);
int i,j;
for(i=1;i<=r;i++)
for(j=1;j<=l;j++)
scanf("%d",&a[i][j]);
rp=1;
lp=1;
re=r;
le=l;
print(rp,re,lp,le,1,1);
return 0;
} | 46 |
22,705 | void main()
{
int r,c,i,j,a[100][100],n,t=0;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
for(n=0;;n++)
{
for(j=n;j<c-n;j++,t++)
printf("%d\n",a[n][j]);
if(t>=r*c)break;
for(i=n+1;i<r-n;i++,t++)
printf("%d\n",a[i][c-1-n]);
if(t>=r*c)break;
for(j=c-2-n;j>=n;j--,t++)
printf("%d\n",a[r-n-1][j]);
if(t>=r*c)break;
for(i=r-2-n;i>n;i--,t++)
printf("%d\n",a[i][n]);
if(t>=r*c)break;
}
} | 46 |
22,706 | int main(){
int n,ROW,COL,a,b;
int sz[100][100];
scanf("%d%d",&ROW,&COL);
for(a=0;a<ROW;a++){
for(b=0;b<COL;b++){
scanf("%d",&sz[a][b]);
}
}
if(ROW>COL)
n=COL;
else
n=ROW;
int i,s,t,p,q;
if(n%2==0){
for(i=0;i<(n+1)/2;i++){
for(s=i;s<COL-i;s++){
printf("%d\n",sz[i][s]);
}
for(t=i+1;t<ROW-i;t++){
printf("%d\n",sz[t][COL-i-1]);
}
for(p=COL-i-2;p>=i;p--){
printf("%d\n",sz[ROW-i-1][p]);
}
for(q=ROW-i-2;q>i;q--){
printf("%d\n",sz[q][i]);
}
}
}
else if(n%2==1){
for(i=0;i<(n-1)/2;i++){
for(s=i;s<COL-i;s++){
printf("%d\n",sz[i][s]);
}
for(t=i+1;t<ROW-i;t++){
printf("%d\n",sz[t][COL-i-1]);
}
for(p=COL-i-2;p>=i;p--){
printf("%d\n",sz[ROW-i-1][p]);
}
for(q=ROW-i-2;q>i;q--){
printf("%d\n",sz[q][i]);
}
}
for(i=(n-1)/2;i<=(n-1)/2;i++){
for(s=i;s<COL-i;s++){
printf("%d\n",sz[i][s]);
}
for(t=i+1;t<ROW-i;t++){
printf("%d\n",sz[t][COL-i-1]);
}
}
}
return 0;
}
| 46 |
22,707 | int main() {
int row,col,xxrow,sxrow,xxcol,sxcol,i,j,sz[100][100];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
i=0;
j=0;
xxrow=0;
sxrow=row-1;
xxcol=0;
sxcol=col-1;
while(xxrow<sxrow&&xxcol<sxcol){
for(j=xxcol;j<sxcol;j++)
printf("%d\n",sz[xxrow][j]);
for(i=xxrow;i<sxrow;i++)
printf("%d\n",sz[i][sxcol]);
for(j=sxcol;j>xxrow;j--)
printf("%d\n",sz[sxrow][j]);
for(i=sxrow;i>xxrow;i--)
printf("%d\n",sz[i][xxcol]);
xxrow++;
sxrow--;
xxcol++;
sxcol--;
}
if(xxrow==sxrow||xxcol==sxcol){
if(xxrow==sxrow&&xxcol!=sxcol){
for(j=xxcol;j<=sxcol;j++)
printf("%d\n",sz[xxrow][j]);
}
if(xxrow!=sxrow&&xxcol==sxcol){
for(i=xxrow;i<=sxrow;i++)
printf("%d\n",sz[i][xxcol]);
}
if(xxrow==sxrow&&xxcol==sxcol)
printf("%d\n",sz[xxrow][xxcol]);
}
return 0;
}
| 46 |
22,708 | int main(){
int h,l,i,j,k=0,n,m=0;
scanf("%d%d",&h,&l);
int p[h][l];
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d", &p[i][j]);
}
}
i=0;j=0;
for(n=0;;){
while(j<l-k){
if(n==h*l-1){printf("%d",p[i][j]);m=1;break;}else{printf("%d\n",p[i][j]);n++;}
j++;
}j--;i++;if(m==1){break;}
while(i<h-k){
if(n!=h*l-1){printf("%d\n",p[i][j]);n++;}else{printf("%d",p[i][j]);m=1;break;}
i++;
}i--;j--;if(m==1){break;}
while(j-k>=0){
if(n!=h*l-1){printf("%d\n",p[i][j]);n++;}else{printf("%d",p[i][j]);m=1;break;}
j--;
}j++;i--;k++;if(m==1){break;}
while(i-k>=0){
if(n!=h*l-1){printf("%d\n",p[i][j]);n++;}else{printf("%d",p[i][j]);m=1;break;}
i--;
}i++;j++;if(m==1){break;}
}
return 0;
}
| 46 |
22,709 | void main()
{
int a[105][105];
int flag=1,loci=0,locj=0,row,col,upwall=0,downwall,rightwall,leftwall=-1,i,j;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
rightwall=col;
downwall=row;
for(i=1;i<row*col;){
if(locj+1<rightwall&&flag==1){printf("%d\n",a[loci][locj++]);i++;}
else if(locj-1>leftwall&&flag==2){printf("%d\n",a[loci][locj--]);i++;}
else if(loci+1<downwall&&flag==3){printf("%d\n",a[loci++][locj]);i++;}
else if(loci-1>upwall&&flag==4){printf("%d\n",a[loci--][locj]);i++;}
else if(locj+1==rightwall&&flag==1){
rightwall--;
flag=3;
}
else if(locj-1==leftwall&&flag==2){
leftwall++;
flag=4;
}
else if(loci+1==downwall&&flag==3){
downwall--;
flag=2;
}
else if(loci-1==upwall&&flag==4){
upwall++;
flag=1;
}
}
printf("%d\n",a[loci][locj]);
} | 46 |
22,710 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int a[100][100];
int i,t;
int count=0;
for(i=0;i<row;i++)
{
for(t=0;t<col;t++)
{
scanf("%d",&a[i][t]);
}
}
int k=0,j=0,m=0;
if(row%2==0)
{
for(k=0;k<=(row/2-1);k++)
{
for(j=k;j<=(col-1-k);j++)
{
printf("%d\n",a[k][j]);
count++;
}
if(count==row*col)
break;
for(m=k+1;m<=row-2-k;m++)
{
printf("%d\n",a[m][col-1-k]);
count++;
}
if(count==row*col)
break;
for(j=col-1-k;j>=k;j--)
{
printf("%d\n",a[row-1-k][j]);
count++;
}
if(count==row*col)
break;
for(m=row-2-k;m>=k+1;m--)
{
printf("%d\n",a[m][k]);
count++;
}
if(count==row*col)
break;
}
}
else
{
row=row-1;
for(k=0;k<=row/2;k++)
{
for(j=k;j<=col-1-k;j++)
{
printf("%d\n",a[k][j]);
count++;
}
if(count==(row+1)*col)
{
break;
}
for(m=k+1;m<=row-k-1;m++)
{
printf("%d\n",a[m][col-1-k]);
count++;
}
if(count==(row+1)*col)
{
break;
}
for(j=col-1-k;j>=k;j--)
{
printf("%d\n",a[row-k][j]);
count++;
}
if(count==(row+1)*col)
{
break;
}
for(m=row-1-k;m>=k+1;m--)
{
printf("%d\n",a[m][k]);
count++;
}
if(count==(row+1)*col)
{
break;
}
}
}
return 0;
}
| 46 |
22,711 | int main()
{
int a[101][101];
int m,n,i,j,s,t;
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)
{
s=n;
}
else
{
s=m;
}
i=1;
if(s%2==0)
{ for(t=1;t<=s/2;t++)
{
for(j=t;j<=n-t+1;j++)
{
printf("%d\n",a[i][j]);
}
for(i=1+t;i<=m+1-t;i++)
{
printf("%d\n",a[i][j-1]);
}
i=i-1;
for(j=n-t;j>=t;j--)
{
printf("%d\n",a[i][j]);
}
j=j+1;
for(i=m-t;i>=t+1;i--)
{
printf("%d\n",a[i][j]);
}
i=i+1;
}
}
else
{
i=1;
for(t=1;t<=(s-1)/2;t++)
{
for(j=t;j<=n-t+1;j++)
{
printf("%d\n",a[i][j]);
}
for(i=1+t;i<=m+1-t;i++)
{
printf("%d\n",a[i][j-1]);
}
i=i-1;
for(j=n-t;j>=t;j--)
{
printf("%d\n",a[i][j]);
}
j=j+1;
for(i=m-t;i>=t+1;i--)
{
printf("%d\n",a[i][j]);
}
i=i+1;
}
if(m<n)
{
for(j=(s+1)/2;j<=(n-(s-1)/2);j++)
{
printf("%d\n",a[(s+1)/2][j]);
}
}
else
{
for(i=(s+1)/2;i<=(m-(s-1)/2);i++)
{
printf("%d\n",a[i][(s+1)/2]);
}
}
}
return 0;
}
| 46 |
22,712 | int main()
{
int a[4][2]={0,1,1,0,0,-1,-1,0};
int i,n,m,j,p;
int map[200][200];
int x,y;
scanf("%d%d",&n,&m);
for(i=0;i<=n+1;i++)
for(j=0;j<=m+1;j++)
map[i][j]=-1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&map[i][j]);
x=1;y=1;p=0;
printf("%d",map[1][1]);
map[1][1]=-1;
while(1)
{
if(map[x+a[p][0]][y+a[p][1]]!=-1)
{
x+=a[p][0];
y+=a[p][1];
printf("\n%d",map[x][y]);
map[x][y]=-1;
}
else
{
p=(p+1)%4;
if(map[x+a[p][0]][y+a[p][1]]!=-1)
{
x+=a[p][0];
y+=a[p][1];
printf("\n%d",map[x][y]);
map[x][y]=-1;
}
else
break;
}
}
//getch();
return 0;
}
| 46 |
22,713 | int main()
{
int n,m;
int i,j,a,c,b;
int sz[100][100];
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
scanf("%d",&sz[i][j]);
}
}
if(m>n)
{
b=n;
}
else
{
b=m;
}
if(b%2==1)
{
c=(b+1)/2;
}
else
{
c=b/2;
}
for(a=0;a<c;a++)
{
if(a<m-a)
{
for(j=a;j<m-a;j++)
{
printf("%d\n",sz[a][j]);
}
if(1+a<n-a)
{
for(i=1+a;i<n-a;i++)
{
printf("%d\n",sz[i][m-a-1]);
}
if(m-a-2>=a)
{
for(j=m-a-2;j>=a;j--)
{
printf("%d\n",sz[n-a-1][j]);
}
if(n-a-2>a)
{
for(i=n-a-2;i>a;i--)
{
printf("%d\n",sz[i][a]);
}
}
}
}
}
}
return 0;
}
| 46 |
22,714 |
int main()
{
int row,col;
int sz[100][100];
int k,i,j;
int a,b,c,d;
scanf("%d %d",&row,&col);
for(k=0;k<row;k++)
{
for(i=0;i<col;i++)
{
scanf("%d",&sz[k][i]);
}
}
a=0;
b=col-1;
c=row-1;
d=0;
while(a<c&&d<b)//????????\n
{
for(i=d; i<b; i++)
printf("%d\n",sz[a][i]);
for(j=a; j<c; j++)
printf("%d\n",sz[j][b]);
for(i=b; i>d; i--)
printf("%d\n",sz[c][i]);
for(j=c; j>a; j--)
printf("%d\n",sz[j][d]);
a++;
b--;
c--;
d++;
}
/*
* ????????????????
* ????????????????????????????????
*/
if(a==c && b==d)
{
printf("%d\n",sz[a][b]);
}
if(b==d && a!=c)
{
for(i=a; i<=c; i++)
printf("%d\n",sz[i][b]);
}
if(a==c && b!=d)
{
for(i=d; i<=b; i++)
printf("%d\n",sz[a][i]);
}
return 0;
} | 46 |
22,715 | int rt1(int x,int y);
int rt2(int x,int y);
int rt3(int x,int y);
int rt4(int x,int y);
int sz[100][100];
int sr[100][100];
int sc[10000];
int p=0,q=0;
int count=0;
int flag=1;
int main()
{
int m,n;
scanf("%d%d",&m,&n);
int i,j;
for (i=0;i<100;i++)
{
for (j=0;j<100;j++)
{
sz[i][j]=1;
}
}
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
sz[i][j]=-2;
}
}
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
scanf("%d",&sr[i][j]);
}
}
sz[0][0]=1;
int limit=m*n;
while (count<=limit-1)
{
switch (flag%4)
{
case 1:
{
(p,q)=rt1(p,q);
count=count+1;
break;
}
case 2:
{
(p,q)=rt2(p,q);
count=count+1;
break;
}
case 3:
{
(p,q)=rt3(p,q);
count=count+1;
break;
}
case 0:
{
(p,q)=rt4(p,q);
count=count+1;
break;
}
}
}
for (i=0;i<m*n;i++)
{
printf("%d\n",sc[i]);
}
return 0;
}
int rt1(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x+1;
q=y;
if (sz[q][p]>0)
{
flag=flag+1;
p=p-1;
q=q+1;
}
return (p,q);
}
int rt2(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x;
q=y+1;
if (sz[q][p]>0)
{
flag=flag+1;
q=q-1;
p=p-1;
}
return (p,q);
}
int rt3(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x-1;
q=y;
if (sz[q][p]>0)
{
flag=flag+1;
p=p+1;
q=q-1;
}
return (p,q);
}
int rt4(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x;
q=y-1;
if (sz[q][p]>0)
{
flag=flag+1;
q=q+1;
p=p+1;
}
return (p,q);
}
| 46 |
22,716 | int main(){
int sz[100][100];
int m,n,b=0;
int i,j,c=0;
scanf("%d%d",&m,&n);
b=m*n;
for(i=0;i<m;i++){
for(int j=0;j<n;j++)
scanf("%d",&sz[i][j]);
}
for(int h=0;;h++)
{
for(j=0+h;j<n-h;j++){
printf("%d\n",sz[h][j]);c++;}
if (b==c) break;
for(i=1+h;i<m-h;i++){
printf("%d\n",sz[i][n-1-h]);c++;}
if (b==c) break;
for(j=n-2-h;j>=0+h;j--){
printf("%d\n",sz[m-1-h][j]);c++;}
if (b==c) break;
for(i=m-2-h;i>h;i--){
printf("%d\n",sz[i][h]);c++;}
if (b==c) break;
}
return 0;
} | 46 |
22,717 | int main()
{
int row,col,a[100][100],i,j,sum,m=0;
scanf("%d%d",&row,&col);
sum=row*col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<row;i++)
{
for(j=i;j<col-i;j++)
{
printf("%d\n",a[i][j]);
m++;
}
if(m==sum)
break;
i++;
j--;
for(;i<row-(col-j-1);i++)
{
printf("%d\n",a[i][j]);
m++;
}
if(m==sum)
break;
j--;
i--;
for(;j>=row-i-1;j--)
{
printf("%d\n",a[i][j]);
m++;
}
if(m==sum)
break;
i--;
j++;
for(;i>j;i--)
{
printf("%d\n",a[i][j]);
m++;
}
if(m==sum)
break;
}
} | 46 |
22,718 |
int main(){
int row,col,i,j,d=1,count=0,f[110][110],vis[110][110];
memset(vis,0,sizeof(vis));
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++){
scanf("%d",&f[i][j]);
}
}
/*for(i=0;i<row;i++){
for(j=0;j<col;j++){
printf("f=%d\n",f[i][j]);
}
}*/
i=1;j=1;
for(;;){
printf("%d\n",f[i][j]);
count++;
if(count>=row*col)break;
vis[i][j]=1;
if(d==1){
if((j+1>col)||vis[i][j+1]){
d=2;i++;
continue;
}
else{j++;}
}
if(d==2){
if((i+1>row)||vis[i+1][j]){
d=3;j--;
continue;
}
else{i++;}
}
if(d==3){
if((j<2)||vis[i][j-1]){
d=4;i--;
continue;
}
else{j--;}
}
if(d==4){
if((i<1)||vis[i-1][j]){
d=1;j++;
continue;
}
else{i--;}
}
}
scanf("%d",&i);
return 0;
} | 46 |
22,719 |
int main()
{
int row,col,i,j,array[100][100];
scanf("%d %d\n",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
}
}
int x_row=0,s_row=row-1,x_col=0,s_col=col-1;
while(x_row<s_row&&x_col<s_col){
for(j=x_col;j<s_col;j++){
if(x_row==0&&j==0){
printf("%d",array[x_row][j]);
}else{
printf("\n%d",array[x_row][j]);
}
}
for(i=x_row;i<s_row;i++){
printf("\n%d",array[i][s_col]);
}
for(j=s_col;j>x_col;j--){
printf("\n%d",array[s_row][j]);
}
for(i=s_row;i>x_row;i--){
printf("\n%d",array[i][x_col]);
}
x_row+=1;
s_row-=1;
x_col+=1;
s_col-=1;
}
if(row<=col&&row%2==1){
for(j=(row-1)/2;j<=col-1-(row-1)/2;j++){
if(row==1&&j==0){
printf("%d",array[(row-1)/2][j]);
}else{
printf("\n%d",array[(row-1)/2][j]);
}
}
}
if(col<row&&col%2==1){
for(i=(col-1)/2;i<=row-1-(col-1)/2;i++){
printf("\n%d",array[i][(col-1)/2]);
}
}
return 0;
} | 46 |
22,720 | int main()
{
int number[100][100],row=0,col=0,aleft=0,aright=0,bup=0,bdown=0,count=0; //????
cin >>row >>col;
for (int i=0;i<row;i++) //????
{
for (int j=0;j<col;j++)
cin >>number[i][j];
}
aright=col-1;
bdown=row-1;
while(1) //??????????????
{
if (count==row*col) break;
for (int i=aleft;i<=aright;i++)
{cout <<number[bup][i]<<endl;count++;}
bup++;
if (count==row*col) break;
for (int i=bup;i<=bdown;i++)
{cout <<number[i][aright]<<endl;count++;}
aright--;
if (count==row*col) break;
for (int i=aright;i>=aleft;i--)
{cout <<number[bdown][i]<<endl;count++;}
bdown--;
if (count==row*col) break;
for (int i=bdown;i>=bup;i--)
{cout <<number[i][aleft]<<endl;count++;}
aleft++;
}
return 0;
} | 46 |
22,721 | int main(){
int a,b,c,d,m,n,i,j,k;
int e[MAX][MAX];
int q[4]={1,0,-1,0};
int w[4]={0,1,0,-1};
scanf("%d%d",&m,&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&e[i][j]);
}
}
for(i=0,a=q[0],b=w[0],j=0,k=0;i<m*n;i++,j+=b,k+=a){
printf("%d\n",e[j][k]);
if(a==q[0]&&b==w[0]&&j+k==n-1){
a=q[1];
b=w[1];
}
else if(a==q[1]&&b==w[1]&&j-k==m-n){
a=q[2];
b=w[2];
}
else if(a==q[2]&&b==w[2]&&j+k==m-1){
a=q[3];
b=w[3];
}
else if(a==q[3]&&b==w[3]&&j==k+1){
a=q[0];
b=w[0];
}
}
return 0;
}
| 46 |
22,722 | int main(){
int row,col,Row,Col,sum;
int array[100][100];
scanf("%d%d",&row,&col);
sum=row*col;
//sum??
for(Row=0;Row<row;Row++){
for(Col=0;Col<col;Col++){
scanf("%d",&array[Row][Col]);
}
}
//??????
Row=0;Col=-1;
int r,c;
row--;
while(1){
for(c=0;c<col;c++){
Col++;
printf("%d\n",array[Row][Col]);
sum--;
}
if(sum==0)
break;
col--;
//??
for(r=0;r<row;r++){
Row++;
printf("%d\n",array[Row][Col]);
sum--;
}
if(sum==0)
break;
row--;
//??
for(c=0;c<col;c++){
Col--;
printf("%d\n",array[Row][Col]);
sum--;
}
if(sum==0)
break;
col--;
//??
for(r=0;r<row;r++){
Row--;
printf("%d\n",array[Row][Col]);
sum--;
}
if(sum==0)
break;
row--;
//??
}
return 0;
}
| 46 |
22,723 | int main(){
int row,cow;
scanf("%d%d",&row,&cow);
int array[row][cow];
for(int i=0;i<row;i++){
for(int k=0;k<cow;k++){
scanf("%d",&array[i][k]);
}
}
int time=0;
for(int i=0;i<100;i++){
for(int m=i;m<cow-i;m++){
printf("%d\n",array[i][m]);
time++;
}
if(time==row*cow){
break;
}
for(int n=i+1;n<row-i;n++){
printf("%d\n",array[n][cow-i-1]);
time++;
}
if(time==row*cow){
break;
}
for(int j=cow-2-i;j>=i;j--){
printf("%d\n",array[row-i-1][j]);
time++;
}
if(time==row*cow){
break;
}
for(int l=row-2-i;l>=i+1;l--){
printf("%d\n",array[l][i]);
time++;
}
if(time==row*cow){
break;
}
}
return 0;
}
| 46 |
22,724 | int main()
{
int M,N,m,n,i,j=0,a[100][100],s=0,k;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
M=m;
N=n;
k=m*n;
for(;;)
{
for(i=M-m,j=N-n;j<n;j++)
{
printf("%d\n",a[i][j]);
s=s+1;
}
m=m-1;
j=j-1;
if(s==k)
break;
for(i=M-m;i<=m;i++)
{
printf("%d\n",a[i][j]);
s=s+1;
}
n=n-1;
i=i-1;
if(s==k)
break;
for(j=n-1;j>=N-n-1;j--)
{
printf("%d\n",a[i][j]);
s=s+1;
}
j=j+1;
if(s==k)
break;
for(i=m-1;i>=M-m;i--)
{
printf("%d\n",a[i][j]);
s=s+1;
}
i=i+1;
if(s==k)
break;
}
} | 46 |
22,725 | int main()
{
int row,col,k=1,num=0,i,j;
int sz[100][100]={0};
scanf("%d%d",&i,&j);
for(row=0;row<i;row++)
{
for(col=0;col<j;col++)
{
scanf("%d",&sz[row][col]);
}
}
row=-1;
for(num=0;num<i*j;)
{
row+=1;
for(col=k-1;col<=j-k;col++)
{
printf("%d\n",sz[row][col]);
num+=1;
}
col-=1;
if(num>=i*j)
break;
for(row=k;row<=i-k;row++)
{
printf("%d\n",sz[row][col]);
num+=1;
}
row-=1;
if(num>=i*j)
break;
k=k+1;
for(col=j-k;col>=k-2;col--)
{
printf("%d\n",sz[row][col]);
num+=1;
}
col+=1;
if(num>=i*j)
break;
for(row=i-k;row>=k-1;row--)
{
printf("%d\n",sz[row][col]);
num+=1;
}
if(num>=i*j)
break;
}
return 0;
}
| 46 |
22,726 | int main(){
int i,j,row,col,rowmin,rowmax,colmin,colmax;
int a[100][100];
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++){
scanf("%d",&a[i][j]);
}
}
rowmax=row;
rowmin=1;
colmax=col;
colmin=1;
while(1){
if(rowmax<rowmin||colmax<colmin){break;}
else if(rowmax==rowmin){for(j=colmin;j<=colmax;j++){printf("%d\n",a[rowmin][j]);}}
else if(colmax==colmin){for(i=rowmin;i<=rowmax;i++){printf("%d\n",a[i][colmin]);}}
else{
for(j=colmin;j<=colmax;j++){printf("%d\n",a[rowmin][j]);}
for(i=rowmin+1;i<=rowmax;i++){printf("%d\n",a[i][colmax]);}
for(j=colmax-1;j>=colmin;j--){printf("%d\n",a[rowmax][j]);}
for(i=rowmax-1;i>rowmin;i--){printf("%d\n",a[i][colmin]);}
}
rowmax-=1;
rowmin+=1;
colmax-=1;
colmin+=1;
}
return 0;
}
| 46 |
22,727 | inline void T(int N,int M,int row,int col,int array[][100])
{
if (N>row||M>col)
{
return;
}
for (int j=M;j<=col;j++)
{
if (array[N][j]!= INT_MAX)
{
cout<<array[N][j]<<endl;
array[N][j] = INT_MAX;
}
}
for (int i=N+1;i<=row;i++)
{
if (array[i][col]!=INT_MAX)
{
cout<<array[i][col]<<endl;
array[i][col] = INT_MAX;
}
}
for(int j=col-1;j>=M;j--)
{
if (array[row][j]!=INT_MAX)
{
cout<<array[row][j]<<endl;
array[row][j] = INT_MAX;
}
}
for (int i=row-1;i>=N+1;i--)
{
if (array[i][M]!=INT_MAX)
{
cout<<array[i][M]<<endl;
array[i][M] = INT_MAX;
}
}
T(N+1,M+1,row-1,col-1,array);
}
int main()
{
int array[100][100] = {0};
int row , col;
cin>>row>>col;
for (int i=0;i<row;i++)
{
for (int j=0;j<col;j++)
{
cin>>array[i][j];
}
}
T(0,0,row-1,col-1,array);
return 0;
} | 46 |
22,728 | int a[999][999];
int f1(int x,int y);
int f2(int x,int y);
int f3(int x,int y);
int f4(int x,int y);
int main()
{
int n,m,i,j;
for (i=0;i<=998;i++) for (j=0;j<=998;j++) a[i][j]=-9876;
cin>>n>>m;
for (i=1;i<=n;i++) for (j=1;j<=m;j++) cin >>a[i][j];
f1(1,1);
return 0;
}
int f1(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x][y+1]!=-9876)
{
y++;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x+1][y]!=-9876) return (f2(x+1,y));
else return 0;
}
}
int f2(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x+1][y]!=-9876)
{
x++;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x][y-1]!=-9876) return (f3(x,y-1));
else return 0;
}
}
int f3(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x][y-1]!=-9876)
{
y--;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x-1][y]!=-9876) return (f4(x-1,y));
else return 0;
}
}
int f4(int x,int y)
{
cout<<a[x][y]<<endl;
a[x][y]=-9876;
while (1)
{
if (a[x-1][y]!=-9876)
{
x--;
cout <<a[x][y]<<endl;
a[x][y]=-9876;
}
else if (a[x][y+1]!=-9876) return (f1(x,y+1));
else return 0;
}
}
| 46 |
22,729 | int main()
{
int sz[100][100],m,n,row,col,e,p,k,q;
scanf("%d%d\n",&row,&col);
for (p=0;p<row;p++)
{
for (q=0;q<col;q++)
{
scanf ("%d",&sz[p][q]);
}
}
if (col<row) e=col/2+1;
else e=row/2+1;
for (k=0;k<e;k++)
{
if (k==(col-k)) break;
for (m=k,n=k;n<col-k;n++)
{
printf("%d\n",sz[m][n]);
}
if ((1+k)==(row-k)) break;
for (n=col-1-k,m=1+k;m<row-k;m++)
{
printf("%d\n",sz[m][n]);
}
if ((col-2-k)==(k-1)) break;
for (m=row-1-k,n=col-2-k;n>=k;n--)
{
printf("%d\n",sz[m][n]);
}
if ((row-2-k)==k) break;
for (n=k,m=row-2-k;m>=1+k;m--)
{
if (m<0) break;
printf("%d\n",sz[m][n]);
}
}
return 0;
} | 46 |
22,730 | int main()
{
int row,col,a[100][100]={0},k,i,j;
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;
k=1;
printf("%d\n",a[0][0]);
a[0][0]=0;
while(1)
{
while(1)
{
if(a[i][j+1]!=0)
{
j++;
printf("%d\n",a[i][j]);
k++;
a[i][j]=0;
}
else
break;
}
if(k==row*col)
{
break;
}
while(1)
{
if(a[i+1][j]!=0)
{
i++;
printf("%d\n",a[i][j]);
k++;
a[i][j]=0;
}
else
break;
}
if(k==row*col)
{
break;
}
while(1)
{
if(j==0)
break;
else if(a[i][j-1]!=0)
{
j--;
printf("%d\n",a[i][j]);
k++;
a[i][j]=0;
}
else
break;
}
if(k==row*col)
break;
while(1)
{
if(a[i-1][j]!=0)
{
i--;
printf("%d\n",a[i][j]);
k++;
a[i][j]=0;
}
else
break;
}
if(k==row*col)
{
break;
}
}
return 0;
}
| 46 |
22,731 | int main()
{
int n,k,i=0,j=0,m=0,h=0,g=0,s=0,t=0;
int an[100][100];
scanf("%d %d",&n,&k);
for(i=0;i<n;i++){
for(j=0;j<k;j++){
scanf("%d",&an[i][j]);
}
}
if(n>k) s=k;
else s=n;
for(m=0;m<((s+2)/2);m++){
for(i=m,j=m;j<k-m-1;j++){
printf("%d\n",an[m][j]);
}
for(i=m;i<n-m-1;i++){
printf("%d\n",an[i][k-m-1]);
}
for(h=k-m-1;h>m;h--){
printf("%d\n",an[n-m-1][h]);
if(m==s/2&&s%2!=0){
break;
}
}
for(g=n-m-1;g>m;g--){
printf("%d\n",an[g][m]);
if(m==s/2&&s%2!=0){
break;
}
}
}
if(n==k&&n%2!=0){
t=(n-1)/2;
printf("%d",an[t][t]);
}
return 0;
} | 46 |
22,732 | int main()
{
int s[100][100]={0},re[100][100]={0},h=0,l=0,dh=0,dl=0,i=0,j=0,k=0,x[4]={0,1,0,-1},y[4]={1,0,-1,0};//hêÇDDêy lêÇáDêy ij¶¼êÇÑ-»·¿ØÖƱäá¿ sêÇ?æ·ÅÕaD©êy×Ö?Äêy×é reêǼǼÕaD©êy×ÖóDûóD±»×ß?½?Äêy×é x[4]êÇ?ãòƶ??Äê±oòDDêy?ıä»??ÄÏòá¿y[4]êÇ?ãòƶ??Äê±oòáDêy±ä»??ÄÏòá¿
cin>>h>>l;
for(i=1;i<=h;i++)
for(j=1;j<=l;j++)
{cin>>s[i][j];re[i][j]=1;}
dh=1;
dl=1;
k=0;
cout<<s[1][1]<<endl;
re[1][1]=0;
for(i=1;i<=h*l-1;i++)//¿aê¼±éàú
{
if(re[dh+x[k]][dl+y[k]]==1)
{
re[dh+x[k]][dl+y[k]]=0;
dh+=x[k];
dl+=y[k];
cout<<s[dh][dl]<<endl;
continue;
}
if(re[dh+x[k]][dl+y[k]]==0)
{
k=(k+1)%4;//»»·½Ïò
re[dh+x[k]][dl+y[k]]=0;
dh+=x[k];
dl+=y[k];
cout<<s[dh][dl]<<endl;
continue;
}
}
return 0;
} | 46 |
22,733 | int main()
{
int m , n , i , j , x , t , num ;
cin>>m>>n;
num = m*n;
int a[m][n];
for ( i=0;i<=m-1;i++ )
{
for ( j=0;j<=n-1;j++ )
{
cin>>x;
a[i][j]=x;
}
}
t=0;
while (num!=0)
{
if ((t%4==0)&&(num!=0))
{
for( j=0;j<=n-1;j++ )
{
num--;
if ( num!=0)
{
cout<<a[0][j]<<endl;
}
else
{
cout<<a[0][j];
}
}
for (i=0;i<=m-2;i++)
{
for (j=0;j<=n-1;j++)
{
a[i][j]=a[i+1][j];
}
}
m--;
t++;
}
if ((t%4==1)&&(num!=0))
{
for ( i=0;i<=m-1;i++ )
{
num--;
if (num!=0)
{
cout<<a[i][n-1]<<endl;
}
else
{
cout<<a[i][n-1];
}
}
n--;
t++;
}
if ((t%4==2)&&(num!=0))
{
for (j=n-1;j>=0;j-- )
{
num--;
if (num!=0)
{
cout<<a[m-1][j]<<endl;
}
else
{
cout<<a[m-1][j];
}
}
m--;
t++;
}
if ((t%4==3)&&(num!=0))
{
for( i=m-1;i>=0;i--)
{
num--;
if (num!=0)
{
cout<<a[i][0]<<endl;
}
else
{
cout<<a[i][0];
}
}
for (j=0;j<=n-2;j++)
{
for ( i=0;i<=m-1;i++ )
{
a[i][j]=a[i][j+1];
}
}
n--;
t++;
}
}
return 0;
} | 46 |
22,734 | int main()
{
int a[110][110],row,col,i,j,k,l=0,s=0;;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++)scanf("%d",&a[i][j]);}
for(i=1;l<row*col;i++){
k=i%4;
if(k==1){
if(s<col-s-1)
for(j=s;j<col-s-1;j++){printf("%d\n",a[s][j]);l++; if(l==row*col)break;}
if(s==col-s-1)continue;
}
if(k==2){
if(s<row-s-1)
for(j=s;j<row-s-1;j++){printf("%d\n",a[j][col-s-1]);l++;if(l==row*col)break;}
if(s==row-s-1)continue;
}
if(k==3){
if(s<col-s-1)
for(j=col-s-1;j>s;j--){printf("%d\n",a[row-s-1][j]);l++;if(l==row*col)break;}
if(s==col-s-1)continue;
}
if(k==0){
if(s<row-s-1)
for(j=row-s-1;j>s;j--){printf("%d\n",a[j][s]);l++;if(l==row*col)break;}
if(s==row-s-1&&l==row*col-1){printf("%d\n",a[s][s]);l++;}
if(s==row-s-1&&l!=row*col-1)continue;
}
if(k==0)s++;
}
return 0;
} | 46 |
22,735 | int main ()
{
int a[110][110];
int row, col, i, j, k, h, l, count, hzz, lzz; // h ?row l? col
cin >> row >> col;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
cin >> a[i][j];
}
}
// ??? ???i? ? i ??? lzz?? ??i????? row - i + 1 ? col - ?i - 1?
// ?lzz?i ? ????i??? col - i + 1?
// ?hzz?j ? ????j++??? row - j + 1?
// ?lzz?col - i + 1??lzz-- ??? col - hzz + 1?
// ?hzz?j? ? hzz??? row - hzz + 2 ?
// ?????????????
count = 0;
h = row;
l = col;
hzz = 1;
lzz = 1;
i = 1;
j = 1;
while (count <= row * col)
{
for (lzz = j; lzz <= col - (j - 1); lzz++) //???????
{
cout << a[i][lzz] << endl;
count++;
if (count == row * col) return 0;
}
j = lzz - 1; //?????????lzz+1
for (hzz = i + 1; hzz <= row - i + 1; hzz++) // ?????
{
cout << a[hzz][j] << endl;
count++;
if (count == row * col) return 0;
}
i = hzz - 1;
for (lzz = j - 1; lzz >= col - j + 1; lzz--)
{
cout << a[i][lzz] << endl;
count++;
if (count == row * col) return 0;
}
j = lzz + 1;
for (hzz = i - 1; hzz >= row - i + 2; hzz--)
{
cout << a[hzz][j] << endl;
count++;
if (count == row * col) return 0;
}
j = j + 1;
i = hzz + 1;
}
return 0;
}
| 46 |
22,736 | int main()
{
int row,col,m,n,i,b,c;
int a[100][100];
scanf("%d%d",&row,&col);
for(m=0;m<row;m++){
for(n=0;n<col;n++){
scanf("%d",&a[m][n]);
}
}
int p[4]={0,1,0,-1},q[4]={1,0,-1,0};
for(i=0,c=p[0],b=q[0],m=0,n=0;i<row*col;m=m+c,n=n+b,i++){
printf("%d\n",a[m][n]);
if(c==p[0]&&b==q[0]&&m+n==col-1){
c=p[1];
b=q[1];
}
else if(c==p[1]&&b==q[1]&&m-n==row-col){
c=p[2];
b=q[2];
}
else if(c==p[2]&&b==q[2]&&m+n==row-1){
c=p[3];
b=q[3];
}
else if(c==p[3]&&b==q[3]&&m==n+1){
c=p[0];
b=q[0];
}
}
return 0;
} | 46 |
22,737 | int main()
{
int i,h,l,j,hb=0,lb=0,lans=0,hs,ls,n=0,ans[10000],a[100][100],z=0;
scanf("%d%d",&h,&l);
for(i=0;i<h;i++)
for(j=0;j<l;j++)
scanf("%d",&a[i][j]);
hs=h-1;
ls=l-1;
while(1)
{
for(i=lb;i<=ls;i++){
ans[lans++]=a[hb][i];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
for(i=hb+1;i<=hs;i++){
ans[lans++]=a[i][ls];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
for(i=ls-1;i>=lb;i--){
ans[lans++]=a[hs][i];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
for(i=hs-1;i>=hb+1;i--){
ans[lans++]=a[i][lb];
n++;
if(n==h*l)
{z=1;
break;
}
}
if(z==1)break;
hb++;
hs--;
lb++;
ls--;
}
for(i=0;i<lans;i++)
printf("%d\n",ans[i]);
return 0;
}
| 46 |
22,738 | //********************************
//*??????????? **
//*?????? 1300012713 **
//*???2013.11.01 **
//********************************
int main()
{
int row, col, a[100][100];
int time = 0;
cin >> row >> col;
for(int x = 1; x <= row; x++)
{
for(int y = 1; y <= col; y++)
{
cin >> a[x-1][y-1];
}
}
for(int i = 0;time< row*col;i++)
{
for(int j = i; j <= col-i-1 && time < row*col; j++)
{ cout << a[i][j];
if(time < row*col-1) cout << "\n";
time++;}
for(int k = i + 1; k <= row-i-1 && time < row*col; k++)
{ cout << a[k][col-i-1];
if(time < row*col-1) cout << "\n";
time++;}
for(int l = col-i-2; l>=i && time < row*col; l--)
{ cout << a[row-i-1][l];
if(time < row*col-1) cout << "\n";
time++;}
for(int m = row-i-2; m>i && time < row*col; m--)
{ cout << a[m][i];
if(time < row*col-1) cout << "\n";
time++;}
}
return 0;
}
| 46 |
22,739 |
int main()
{
int n , m , i , j , n0 , m0 , p , q , a[102][102] ;
cin >> n >> m ;
for (i = 1 ; i <= n ; i ++ )
for (j = 1 ; j <= m ; j ++ )
cin >> a[i][j] ;
n0 = n / 2 + n % 2 ;
m0 = m / 2 + m % 2 ;
if (n0 > m0)
q = m0 ;
else
q = n0 ;
for (p = 1 , n0 = 1 , m0 = 1 ; p <= q ; p ++ , n0 ++ , m0 ++ , n -- , m -- )
{
if (m == m0)
{
for (i = n0 ; i <= n ; i ++ )
cout << a[i][m] << endl ;
break ;
}
if (n == n0)
{
for (j = m0 ; j <= m ; j ++ )
cout << a[n][j] << endl ;
break ;
}
for (j = m0 ; j <= m - 1 ; j ++ )
cout << a[n0][j] << endl ;
for (i = n0 ; i <= n - 1 ; i ++ )
cout << a[i][m] << endl ;
for (j = m ; j >= m0 + 1 ; j -- )
cout << a[n][j] << endl ;
for (i = n ; i >= n0 + 1 ; i -- )
cout << a[i][m0] << endl ;
}
return 0 ;
}
| 46 |
22,740 | int main ()
{
int row , col ;
cin >> row >> col ;
int N = row * col ;
//???????
int array[100][100] ;
for ( int r = 0 ; r < row ; r++ )
for ( int c = 0 ; c < col ; c++ )
cin >> array[r][c] ;
//????????????
int r = 0 , c = 0 ;
int K = 0 ;
while ( 1 )//????????????
{
//????
for ( int j = c ; j <= col - 1 ; j++ )
{
cout << array[r][j] << endl ;
K++ ;
}
if ( r < row - 1 )
r++ ;//????????
if ( K == N ) break ; //??????????
//????
for ( int i = r ; i <= row - 1 ; i++ )
{
cout << array[i][col-1] << endl ;
K++ ;
}
if ( c < col - 1 )
col-- ;//?????????
if ( K == N ) break ; //??????????
//????
for ( int j = col - 1 ; j >= c ; j-- )
{
cout << array[row-1][j] << endl ;
K++ ;
}
if ( r < row - 1 )
row-- ;//?????????
if ( K == N ) break ; //??????????
//????
for ( int i = row - 1 ; i >= r ; i-- )
{
cout << array[i][c] << endl ;
K++ ;
}
if ( c < col - 1 )
c++ ;
if ( K == N ) break ; //??????????
}
return 0 ;
}
// ( > w < ) finished~ | 46 |
22,741 | int main(){
int row, col, matrix[ROW][COL];
int i, j;
int xxrow,sxrow,xxcol,sxcol;
scanf("%d %d", &row, &col);
for(i = 0; i < row; i++){
for(j = 0; j < col; j++){
scanf("%d", &(matrix[i][j]));
}
}
xxrow= 0;
sxrow= row-1;
xxcol=0;
sxcol=col-1;
while( (xxrow<sxrow) && (xxcol<sxcol) ){
for(j =xxcol; j <sxcol; j++){
printf("%d\n", matrix[xxrow][j]);
}
for(i = xxrow; i < sxrow; i++){
printf("%d\n", matrix[i][sxcol]);
}
for(j = sxcol; j > xxcol; j--){
printf("%d\n", matrix[sxrow][j]);
}
for(i = sxrow; i > xxrow; i--){
printf("%d\n", matrix[i][xxcol]);
}
xxrow++;
sxrow--;
xxcol ++;
sxcol --;
}
if((xxrow==sxrow)&&(xxcol<sxcol)){
for(j=xxcol;j<sxcol+1;j++){
printf("%d\n",matrix[xxrow][j]);
}
}
else if(xxrow<sxrow&&xxcol==sxcol){
for(i=xxrow;i<sxrow+1;i++){
printf("%d\n",matrix[i][xxcol]);
}
}
else if((xxrow==sxrow)&&(xxcol==sxcol)){
printf("%d\n",matrix[xxrow][xxcol]);
}
return 0;
}
| 46 |
22,742 | int main()
{
int array[100][100], flag[100][100] = {{0}, {0}}, row, col, i, j, rowstart, colstart;
cin >> row >> col;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
cin >> array[i][j];
flag[i][j] = 1;
}
}
rowstart = colstart = 1;
do
{
for (i = colstart; i <= col; i++)
{
if (flag[rowstart][i] == 0 || array[rowstart][i] == 0)
{
break;
}
cout << array[rowstart][i] << endl;
flag[rowstart][i] = 0;
}
rowstart++;
for (i = rowstart; i <= row; i++)
{
if (flag[i][col] == 0 || array[i][col] == 0)
{
break;
}
cout << array[i][col] << endl;
flag[i][col] = 0;
}
col--;
for (i = col; i >= colstart; i--)
{
if (flag[row][i] == 0 || array[row][i] == 0)
{
break;
}
cout << array[row][i] << endl;
flag[row][i] = 0;
}
row--;
for (i = row; i >= rowstart; i--)
{
if (flag[i][colstart] == 0 || array[i][colstart] == 0)
{
break;
}
cout << array[i][colstart] << endl;
flag[i][colstart] = 0;
}
colstart++;
if (row == rowstart && col == colstart)
{
cout << array[row][col];
}
}while (row > rowstart || col > colstart);
return 0;
} | 46 |
22,743 | int main(){
int row,col;
int array[100][100];
int i,j,a,b,c,d=0;
scanf("%d%d",&row,&col);
for(i=0;i<=row-1;i++){
for(j=0;j<=col-1;j++){
scanf("%d",&array[i][j]);}
}
c=0;
for(a=0;2*a<=row&&2*a<=col;a++){
for(b=a;b<=col-1-a;b++){
printf("%d\n",array[c][b]);
d++;}
if(d==row*col)
break;
b=b-1;
for(c=a+1;c<=row-1-a;c++){
printf("%d\n",array[c][b]);
d++;}
if(d==row*col)
break;
c=c-1;
for(b=col-2-a;b>=a;b--){
printf("%d\n",array[c][b]);
d++;}
if(d==row*col)
break;
b=b+1;
for(c=row-2-a;c>=a+1;c--){
printf("%d\n",array[c][b]);
d++;}
if(d==row*col)
break;
c=c+1;
}
return 0;
} | 46 |
22,744 | //********************************
//*??????????? **
//*?????? 1300012861 **
//*???2013.11.01 **
//********************************
int main()
{
int a[102][102], i, j, k, row, col;
cin >> row >> col;
for ( i = 0; i < row; i++ )
{
for ( j = 0; j < col; j++ )
{
cin >> a[i][j];
}
}
if ( row <= col )
{
if ( row < 2 )
{
for ( j = 0; j < col; j++ )
cout << a[0][j] << endl;
}
if ( row >= 2 )
{
for ( i = 0; i < row / 2; i++ )
{
for ( j = i; j < col - i; j++ )
{
cout << a[i][j] << endl;
}
j--;
for ( k = i + 1; k < row - i; k++ )
{
cout << a[k][j] << endl;
}
k--;
for ( j = j - 1; j >= i; j-- )
{
cout << a[k][j] << endl;
}
j++;
for ( k = k - 1; k > i; k-- )
{
cout << a[k][j] << endl;
}
}
if ( row % 2 != 0 )
{
for ( j = i; j < col - i; j++ )
{
cout << a[i][j] << endl;
}
}
}
}
if ( col < row )
{
if ( col < 2 )
{
for ( i = 0; i < row; i++ )
cout << a[i][0] << endl;
}
if ( col >= 2 )
{
for ( i = 0; i < col / 2; i++ )
{
for ( j = i; j < col - i; j++ )
{
cout << a[i][j] << endl;
}
j--;
for ( k = i + 1; k < row - i; k++ )
{
cout << a[k][j] << endl;
}
k--;
for ( j = j - 1; j >= i; j-- )
{
cout << a[k][j] << endl;
}
j++;
for ( k = k - 1; k > i; k-- )
{
cout << a[k][j] << endl;
}
}
if ( col % 2 != 0 )
{
for ( k = i; k < row - i; k++ )
{
cout << a[k][j+1] << endl;
}
}
}
}
return 0;
}
| 46 |
22,745 | int dat[102][102];
_Bool use[102][102];
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int main()
{
int n,m;
int l1,l2,i,j,d;
scanf("%d%d",&m,&n);
for (l1=1;l1<=m;l1++)
for (l2=1;l2<=n;l2++)
scanf("%d",&dat[l1][l2]);
for (l1=1;l1<=m;l1++)
use[l1][0]=use[l1][n+1]=1;
for (l1=1;l1<=n;l1++)
use[0][l1]=use[m+1][l1]=1;
i=1;
j=1;
d=0;
while (1)
{
printf("%d\n",dat[i][j]);
use[i][j]=1;
for (l1=1;l1<=4;l1++)
if (use[i+dir[d][0]][j+dir[d][1]]==1)
d=(d+1)%4;
else
{
i+=dir[d][0];
j+=dir[d][1];
break;
}
if (l1==5)
break;
}
return 0;
}
| 46 |
22,746 | int main()
{
int row,col,i,j,a[100][100],b,c=0,n;
scanf("%d%d",&row,&col);
b=col*row;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
for(n=0;n<103;n++){
for(i=n;i<col-n;i++){
printf("%d\n",a[n][i]);
c=c+1;
}
if(c==b){
break;
}
for(i=n+1;i<row-n;i++){
printf("%d\n",a[i][col-n-1]);
c=c+1;
}
if(c==b){
break;
}
for(i=col-n-2;i>=n;i--){
printf("%d\n",a[row-1-n][i]);
c=c+1;
}
if(c==b){
break;
}
for(i=row-n-2;i>n;i--){
printf("%d\n",a[i][n]);
c=c+1;
}
if(c==b){
break;
}
}
return 0;
}
| 46 |
22,747 | int main(){
int row,col,i,j,k,l,x,p,r,q,a,b=1;
int sz[100][100];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&(sz[i][j]));
}
}
if(row>=col){
if(col%2==0){
a=col/2;
for(k=0;k<a;k++){
for(l=k;l<(col-1-k);l++){
printf("%d\n",sz[k][l]);
}
for(p=k;p<(row-1-k);p++){
printf("%d\n",sz[p][col-k-1]);
}
for(q=(col-k-1);q>k;q--){
printf("%d\n",sz[row-k-1][q]);
}
for(r=(row-k-1);r>k;r--){
printf("%d\n",sz[r][k]);
}
}
}
else{
a=col/2;
for(k=0;k<a;k++){
for(l=k;l<(col-1-k);l++){
printf("%d\n",sz[k][l]);
}
for(p=k;p<(row-1-k);p++){
printf("%d\n",sz[p][col-k-1]);
}
for(q=(col-k-1);q>k;q--){
printf("%d\n",sz[row-k-1][q]);
}
for(r=(row-k-1);r>k;r--){
printf("%d\n",sz[r][k]);
}
}
for(x=a;x<(row-a);x++){
printf("%d\n",sz[x][a]);
}
}
}
else{
if(row%2==0){
a=row/2;
for(k=0;k<a;k++){
for(l=k;l<(col-1-k);l++){
printf("%d\n",sz[k][l]);
}
for(p=k;p<(row-1-k);p++){
printf("%d\n",sz[p][col-k-1]);
}
for(q=(col-k-1);q>k;q--){
printf("%d\n",sz[row-k-1][q]);
}
for(r=(row-k-1);r>k;r--){
printf("%d\n",sz[r][k]);
}
}
}
else{
a=row/2;
for(k=0;k<a;k++){
for(l=k;l<(col-1-k);l++){
printf("%d\n",sz[k][l]);
}
for(p=k;p<(row-1-k);p++){
printf("%d\n",sz[p][col-k-1]);
}
for(q=(col-k-1);q>k;q--){
printf("%d\n",sz[row-k-1][q]);
}
for(r=(row-k-1);r>k;r--){
printf("%d\n",sz[r][k]);
}
}
for(x=a;x<(col-a);x++){
printf("%d\n",sz[a][x]);
}
}
}
return 0;
}
| 46 |
22,748 | int main()
{
int sz[100][100];
int row,col,i,j,a=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
while(a<row-1&&a<col-1)
{
for(i=a,j=a;j<col-1;j++)
{
printf("%d\n",sz[i][j]);
}
for(j=col-1,i=a;i<row-1;i++)
{
printf("%d\n",sz[i][j]);
}
for(i=row-1,j=col-1;j>a;j--)
{
printf("%d\n",sz[i][j]);
}
for(j=a,i=row-1;i>a;i--)
{
printf("%d\n",sz[i][j]);
}
col--;
row--;
a++;
}
if(a==row-1)
{
for(i=a,j=a;j<col;j++)
printf("%d\n",sz[i][j]);
}
else if(a==col-1)
{
for(j=a,i=a;i<row;i++)
printf("%d\n",sz[i][j]);
}
return 0;
} | 46 |
22,749 | int main()
{
int m,n,i,j,k,a[100][100],x1,x2,y1,y2,s=0,t=0;
scanf("%d",&m);
scanf("%d",&n);
x1=0;x2=n-1;
y1=0;y2=m-1;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
i=0;j=0;
for(k=0;k<m*n;k++)
{
printf("%d\n",a[i][j]);
if((i==y1)&&(j<x2))
{
j++;
}
else if((j==x2)&&(i<y2))
{
i++;
}
else if((i==y2)&&(j>x1))
{
j--;
}
else if((j==x1)&&(i==y1+1))
{
j++;
x1++;
x2--;
y1++;
y2--;
}
else
{
i--;
}
}
return 0;
}
| 46 |
22,750 | int main(int argc, char* argv[])
{
int a[100][100],b[10000],c[4];
int m,n,e,i,j,t,k,l,p;
scanf ("%d%d\n",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf ("%d",&a[i][j]);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
c[0]=i;
c[1]=j;
c[2]=m-i-1;
c[3]=n-j-1;
t=c[0];
for (k=0;k<4;k++)
if (c[k]<t)
t=c[k];
if (i==t)
p=j-t+1;
else if (j==n-t-1)
p=n-t-1-t+i-t+1;
else if (i==m-t-1)
p=n-t-1-t+m-t-1-t+n-t-1-j+1;
else if (j==t)
p=n-t-1-t+m-t-1-t+n-t-1-t+m-t-1-i+1;
for (l=0,e=0;l<t;l++)
e=e+2*(m-2*l-1)+2*(n-2*l-1);
if (t==0)
e=0;
b[e+p-1]=a[c[0]][c[1]];
}
for (i=0;i<m*n;i++)
printf ("%d\n",b[i]);
return 0;
}
| 46 |
22,751 | int main ()
{
int a[100][100];
int row, col, i=0, j=0, left=0, right=0, up=0, down=0;
int x=0;
scanf("%d%d",&row,&col);
down=row;
right=col;
for (; i<row; i++)
{
for (j=0; j<col; j++)
{
scanf("%d",&a[i][j]);
}
}
i=0,j=0;
for (; ; )
{
for (; j<right; j++)
{
printf("%d\n",a[i][j]);
x++;
}
j--;
if (x>=col*row)
{
break;
}
i++;
for (; i<down; i++)
{
printf("%d\n",a[i][j]);
x++;
}
i--;
if (x>=col*row)
{
break;
}
j--;
for (; j>=left; j--)
{
printf("%d\n",a[i][j]);
x++;
}
j++;
if (x>=col*row)
{
break;
}
i--;
for (; i>up; i--)
{
printf("%d\n",a[i][j]);
x++;
}
if (x>=col*row)
{
break;
}
i++;
j++;
right--;
left++;
up++;
down--;
}
return 0;
} | 46 |
22,752 | int main()
{
int a[101][101],i,j;
int b[101][101]={1};
int col,row;
int x=0,y=0;
scanf("%d %d",&row,&col);
for(i=0;i<row;++i)
for(j=0;j<col;++j)
scanf("%d",a[i]+j);
printf("%d\n",a[0][0]);
while(1)
{
if(b[x][++y]!=0)
break;
while((b[x][y]==0) && (y<col))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
++y;
}
--y;
if(b[++x][y]!=0)
break;
while((b[x][y]==0) && (x<row))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
++x;
}
--x;
if(b[x][--y]!=0)
break;
while((b[x][y]==0) && (y>=0))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
--y;
}
++y;
if(b[--x][y]!=0)
break;
while((b[x][y]==0) && (x>=0))
{
printf("%d\n",a[x][y]);
b[x][y]=1;
--x;
}
++x;
}
return 0;
}
| 46 |
22,753 | int a[100][100];
int main()
{
int row,c,i,j,d,x,l,r,s,t,y;
scanf("%d%d",&row,&c);
for(i=0;i<row;i++)
{
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
}
d=1;
r=c-1;
x=0;
l=row-1;
s=1;
y=0;
t=0;
printf("%d\n",a[0][0]);
for(i=1;i<row*c;i++)
{
if(d==1)
{
if(t==r)
{
r=r-1;
d=-1;
}
}
else if(d==-1)
{
if(y==l)
{
l=l-1;
d=2;
}
}
else if(d==2)
{
if(t==x)
{
x=x+1;
d=-2;
}
}
else if(d==-2)
{
if(y==s)
{
s=s+1;
d=1;
}
}
if(d==1)
t=t+1;
else if(d==-1)
y=y+1;
else if(d==2)
t=t-1;
else if(d==-2)
y=y-1;
printf("%d\n",a[y][t]);
}
}
| 46 |
22,754 | void main(){
int i,j,xr,sr,xc,sc,row,col,matrix[ROW][COL];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&matrix[i][j]);
xr=0;
sr=row-1;
xc=0;
sc=col-1;
while(xr<sr&&xc<sc){
for(j=xc;j<sc;j++)
printf("%d\n",matrix[xr][j]);
for(i=xr;i<sr;i++)
printf("%d\n",matrix[i][sc]);
for(j=sc;j>xc;j--)
printf("%d\n",matrix[sr][j]);
for(i=sr;i>xr;i--)
printf("%d\n",matrix[i][xc]);
xr++;
sr--;
xc++;
sc--;
}
if(xr==sr&&xc==sc)
printf("%d",matrix[xr][xc]);
else {
if(xr==sr)
for(j=xc;j<=sc;j++)
printf("%d\n",matrix[xr][j]);
if(xc==sc)
for(i=xr;i<=sr;i++)
printf("%d\n",matrix[i][sc]);
}
} | 46 |
22,755 |
int main()
{
int a[100][100];
int m,n,i,j;
int mini,maxi,minj,maxj;
int time,count=0;;
scanf("%d %d",&m,&n);
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
mini=0;
maxi=m-1;
minj=0;
maxj=n-1;
for (time=1;count<m*n;time++)
{
switch (time%4)
{
case 1:
{
for (i=mini,j=minj;j<=maxj;j++)
{
printf("%d\n",a[i][j]);
count++;
}
mini++;
break;
}
case 2:
{
for (j=maxj,i=mini;i<=maxi;i++)
{
printf("%d\n",a[i][j]);
count++;
}
maxj--;
break;
}
case 3:
{
for (i=maxi,j=maxj;j>=minj;j--)
{
printf("%d\n",a[i][j]);
count++;
}
maxi--;
break;
}
case 0:
{
for (j=minj,i=maxi;i>=mini;i--)
{
printf("%d\n",a[i][j]);
count++;
}
minj++;
break;
}
}
}
return 0;
} | 46 |
22,756 |
int main()
{
int row,col;
int i,j,n,time=0;
scanf("%d%d",&row,&col);
int array[100][100];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[ i ][ j ]);
for (n=0;;n++)
{
for (i=n;i<col-n;i++)
{
cout << array[ n ][ i ] << endl;
time++;//??????????time?????
}
printf("\n");
if(time==row*col)break;
for (j=n+1;j<row-n;j++)
{
cout << array[ j ][col-n-1] << endl;
time++;
}
printf("\n");
if(time==row*col)break;
for (i=col-2-n;i>=n;i--)
{
cout << array[row-n-1][ i ] << endl;
time++;
}
printf("\n");
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
cout << array[ j ][ n ] << endl;
time++;
}
printf("\n");
if(time==row*col)break;
}
return 0;
} | 46 |
22,757 | int main(){
int a[100][100];
int row,col,i,j,rowsx,rowxx,colsx,colxx;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
rowsx=row-1;
rowxx=0;
colsx=col-1;
colxx=0;
while(rowsx>rowxx && colsx>colxx){
for (j=colxx; j <colsx;j++){
printf("%d\n",a[rowxx][j]);
}
for (i=rowxx; i <rowsx;i++){
printf("%d\n",a[i][colsx]);
}
for (j=colsx; j >colxx;j--){
printf("%d\n",a[rowsx][j]);
}
for (i=rowsx; i >rowxx;i--){
printf("%d\n",a[i][colxx]);
}
rowsx--;
rowxx++;
colsx--;
colxx++;
}
if(row%2==1||col%2==1){
if(rowxx==rowsx){
for (j=colxx; j <=colsx;j++){
printf("%d\n",a[rowxx][j]);
}
}
else{
for (i=rowxx; i <=rowsx;i++){
printf("%d\n",a[i][colsx]);
}
}
}
return 0;
}
| 46 |
22,758 | int main(int argc, char* argv[])
{
int row,col,k,e,i,j,min;
int sz[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
if(col>row){
min=row;
}else{
min=col;
}
for(e=0;e<min/2+1;e++){
for(j=e;j<col-e;j++){
printf("%d\n",sz[e][j]);
}if(row%2==1&&e+1>row-2-e){
break;
}
for(i=e+1;i<row-e;i++){
printf("%d\n",sz[i][col-1-e]);
}
if(col%2==1&&e>col-2-e){
break;
}
for(j=col-2-e;j>=e;j--){
printf("%d\n",sz[row-1-e][j]);
}
for(i=row-2-e;i>e;i--){
printf("%d\n",sz[i][e]);
}}
return 0;
} | 46 |
22,759 | int main()
{
int row,col;
int i,j,n,time=0;
scanf("%d %d",&row,&col);
int array[100][100];
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
}
}
for (n=0;;n++)
{
for (i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
time++;
}
printf("\n");
if(time==row*col)break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
time++;
}
if(time==row*col)break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
time++;
}
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
time++;
}
if(time==row*col)break;
}
return 0;
}
| 46 |
22,760 | int main()
{
int row,col,i,j;
cin>>row>>col;
int a[row+2][col+2];
for(i=0;i<row+2;i++) { for(j=0;j<col+2;j++) { a[i][j]=0; } }
//memset(a,0,sizeof(a));
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
}
i=1;j=1;
while(1)
{
if(a[i][j+1]!=0&&a[i][j-1]==0&&a[i-1][j]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;
j++;
continue;
}
if(a[i+1][j]!=0&&a[i-1][j]==0&&a[i][j+1]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;i++;continue;
}
if(a[i][j-1]!=0&&a[i][j+1]==0&&a[i+1][j]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;j--;continue;
}
if(a[i-1][j]!=0&&a[i+1][j]==0&&a[i][j-1]==0)
{
cout<<a[i][j]<<endl;
a[i][j]=0;i--;continue;
}
else
{cout<<a[i][j]<<endl;
break;}
}
return 0;
}
| 46 |
22,761 | int main()
{
/* Read data */
int col, row, a[100][100];
cin >> row >> col;
for(int i=0; i<row; ++i)
for(int j=0; j<col; ++j)
cin >> a[i][j];
/* Const direction */
const int dir[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
/* Parameter Initialization */
/* State records current direction index, step records step size for 4 directions, curstep is current step size, pos records current position */
int state=0, step[4] = {col, row-1, col-1, row-2}, curstep=step[state], pos[2] = {0,0}, flag=1;
/* Main Solver */
while(curstep > 0)
{
for(int i=0+flag; i<curstep; ++i)
{
cout << a[pos[0]][pos[1]] << endl;
pos[0] += dir[state][0];
pos[1] += dir[state][1];
}
step[state] = step[state]-2;
state = (state+1)%4;
curstep = step[state];
flag = 0;
}
cout << a[pos[0]][pos[1]] << endl;
return 0;
} | 46 |
22,762 | int sz[100][100];
int main(){
int n,m,i,j,k,a1,a2,b1,b2;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=0;;k++){
a1=k;
a2=m-1-k;
b1=k;
b2=n-1-k;
if(a1>a2||b1>b2){
break;
}
if(a1==a2&&b1!=b2){
for(i=b1;i<=b2;i++){
printf("%d\n",sz[i][a1]);
}
}else if(b1==b2){
for(j=a1;j<=a2;j++){
printf("%d\n",sz[b1][j]);
}
}else if(b1==b2&&a1==a2){
printf("%d\n",sz[b1][a1]);
}else{
for(j=a1;j<=a2;j++){
printf("%d\n",sz[b1][j]);
}
for(i=b1+1;i<=b2;i++){
printf("%d\n",sz[i][a2]);
}
for(j=a2-1;j>=a1;j--){
printf("%d\n",sz[b2][j]);
}
for(i=b2-1;i>=b1+1;i--){
printf("%d\n",sz[i][a1]);
}
}
}
return 0;
}
| 46 |
22,763 | int main()
{
int i,j,a,b,t[100][100],q=0,s;
scanf("%d%d",&a,&b);
s=a*b;
for(i=0;i<a;i++)
for(j=0;j<b;j++)
scanf("%d",&t[i][j]);
i=q;
while(s!=0)
{
for(j=q;j<b;j++)
{
if(s==0)break;
printf("%d\n",t[i][j]);
s--;
}
j--;
for(i=i+1;i<a;i++)
{
if(s==0)break;
printf("%d\n",t[i][j]);
s--;
}
i--;
for(j=b-2;j>=q;j--)
{
if(s==0)break;
printf("%d\n",t[i][j]);
s--;
}
j++;
for(i=a-2;i>=q+1;i--)
{
if(s==0)break;
printf("%d\n",t[i][j]);
s--;
}
i++;
q++;
a--;
b--;
}
getchar();
getchar();
} | 46 |
22,764 | int main(){
int r,c,i,j,e,k,m,n,l;
int s[101][101];
scanf("%d%d",&r,&c);
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&s[i][j]);
}
}
e=r*c;
for(i=0;;i++){
for(k=i;k<c-i;k++){
printf("%d\n",s[i][k]);
e--;
if(e==0)
return 0;
}
for(m=i+1;m<r-i;m++){
printf("%d\n",s[m][c-1-i]);
e--;
if(e==0)
return 0;
}
for(n=c-2-i;n>=i;n--){
printf("%d\n",s[r-1-i][n]);
e--;
if(e==0)
return 0;
}
for(l=r-2-i;l>i;l--){
printf("%d\n",s[l][i]);
e--;
if(e==0)
return 0;
}
}
return 0;
} | 46 |
22,765 | int main()
{
int x,y,p=1,q=1;
double a[200][200];
scanf("%d %d",&x,&y);
for(p=1;p<=x;p++)
for(q=1;q<=y;q++)
scanf("%lf",&a[p][q]);
for(q=0;q<=y;q++)
a[0][q]=0.5;
for(q=0;q<=y;q++)
a[x+1][q]=0.5;
for(p=1;p<=x;p++)
a[p][0]=0.5;
for(p=1;p<=x;p++)
a[p][y+1]=0.5;
int i=1,j=1;
while(a[i][j]-floor(a[i][j])==0)
{
printf("%.0lf\n",a[i][j]);
a[i][j]=0.5;
if(a[i][j+1]-floor(a[i][j+1])==0&&a[i+1][j]-floor(a[i+1][j])==0||a[i][j+1]-floor(a[i][j+1])==0&&a[i+1][j]-floor(a[i+1][j])!=0&&a[i-1][j]-floor(a[i-1][j])!=0)
j=j+1;
else if(a[i+1][j]-floor(a[i+1][j])==0)
i=i+1;
else if(a[i][j-1]-floor(a[i][j-1])==0)
j=j-1;
else if(a[i-1][j]-floor(a[i-1][j])==0)
i=i-1;
else break;
}
getchar();
getchar();
return 0;
} | 46 |
22,766 |
int main()
{
int row , col ;
cin >> row >> col ;
int a[row][col] ;
for( int i = 0 ; i < row ; i ++ )
for( int j = 0 ; j < col ; j ++ )
cin >> a[i][j] ;
int minrow = 0 , maxrow = row - 1 ,
mincol = 0 , maxcol = col - 1 , n = 0 , i = 0 , j = 0 , count = 0 ;
for( ; n > -1 ; n ++ )
{
/*for( ; minrow <= i && i <= maxrow && mincol <= j && j <= maxcol ;
n % 2 == 0 ? n % 4 == 0 ? j ++ : j -- : n % 4 == 1 ? i ++ : i -- )
cout << a[i][j] << endl ;*/
if( n % 2 == 0 )
{
if( n % 4 == 0 ) {
for( ; j <= maxcol ; j ++ )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
minrow ++ ; j -- ; i ++ ; }
else {
for( ; j >= mincol ; j -- )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
maxrow -- ; j ++ ; i -- ; }
}
else
{
if( n % 4 == 1 ){
for( ; i <= maxrow ; i ++ )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
maxcol -- ; i -- ; j -- ; }
else {
for( ; i >= minrow ; i -- )
{
cout << a[i][j] << "\n" ;
count ++ ;
}
mincol ++ ; i ++ ; j ++ ;}
}
if( count == row * col ) break ;
}
return 0 ;
} | 46 |
22,767 | int main()
{
int r[4]={0,1,0,-1};
int c[4]={1,0,-1,0};
int row,col,i=0,j=0,k=0,x=r[0],y=c[0];
scanf("%d%d",&row,&col);
int array[row][col];
for(int a=0;a<row;a++){
for(int b=0;b<col;b++){
scanf("%d",&(array[a][b]));
}
}
for(i=0;i<row*col;i++,j+=x,k+=y){
printf("%d\n",array[j][k]);
if(x==r[0]&&y==c[0]&&j+k==col-1){
x=r[1];
y=c[1];
}else if(x==r[1]&&y==c[1]&&j-k==row-col){
x=r[2];
y=c[2];
}else if(x==r[2]&&y==c[2]&&j+k==row-1){
x=r[3];
y=c[3];
}else if(x==r[3]&&y==c[3]&&j==k+1){
x=r[0];
y=c[0];
}
}
return 0;
}
| 46 |
22,768 | int main(){
int array[100][100];
int row,col,c;
int i=0,j=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&(array[i][j]));
}
}
if(col==1&&row!=1){
i=0;
for(i=0;i<row;i++){
printf("%d\n",array[i][0]);
}
}
if(row==1&&col!=1){
j=0;
for(j=0;j<col;j++){
printf("%d\n",array[0][j]);
}
}
if(col==1&&row==1){
printf("%d\n",array[0][0]);
}
if(row>1&&col>1){
if((col/2)>=(row/2)){
c=row/2;
}
else{
c=col/2;
}
int k=1;
for(k=1;k<=c;k++){
j=k-1;
for(j=k-1;j<=col-k;j++){
printf("%d\n",array[k-1][j]);
}
i=k;
for(i=k;i<=row-k;i++){
printf("%d\n",array[i][col-k]);
}
j=col-k-1;
for(j=col-k-1;j>=k-1;j--){
printf("%d\n",array[row-k][j]);
}
if(k-1==row-k-1){
break;
}
i=row-k-1;
for(i=row-k-1;i>=k;i--){
printf("%d\n",array[i][k-1]);
}
}
if((row%2!=0&&col%2==0)||(row%2!=0&&col%2!=0)){
i=c;
for(i=c;i<col-c;i++){
printf("%d\n",array[(row-1)/2][i]);
}
}
i=c;
if(col%2!=0&&row%2==0){
i=c;
for(i=c;i<row-c;i++){
printf("%d\n",array[i][(col-1)/2]);
}
}
}
return 0;
} | 46 |
22,769 |
int main() {
int row ,col,a[100][100];
int i,j,k;
int n=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i=i+1){
for(j=0;j<col;j=j+1){
scanf("%d",&a[i][j]);
}
}
for(k=0;k<=100;k=k+1){
for(i=k;i<col-k;i=i+1){
if(n!=row*col){
printf("%d\n",a[k][i]);
n=n+1;
}
}
for(i=k+1;i<row-k;i=i+1){ if(n!=row*col){
printf("%d\n",a[i][col-1-k]);
n=n+1;}
}
for(i=col-2-k;i>=k;i=i-1){ if(n!=row*col){
printf("%d\n",a[row-1-k][i]);
n=n+1;}
}
for(i=row-2-k;i>=1+k;i=i-1){ if(n!=row*col){
printf("%d\n",a[i][k]);
n=n+1;}
}
}
return 0;
} | 46 |
22,770 | int main(){
int array[110][110],result[10000],ROW,COL,n=0,i=0,k=0,j=0,s=0;
scanf("%d %d",&ROW,&COL);
for(i=0;i<ROW;i++){
for(j=0;j<COL;j++){
scanf("%d",&array[i][j]);
s++;
}
}
for(k=0,n=0;n<s;k++){
if (k%4==0){
for(j=k/4;j<COL-k/4;j++,n++){
result[n]=array[k/4][j];
}
}else if(k%4==1){
for(j=k/4+1;j<ROW-k/4;j++,n++){
result[n]=array[j][COL-k/4-1];
}
}else if(k%4==2){
for(j=COL-k/4-2;j>=k/4;j--,n++){
result[n]=array[ROW-k/4-1][j];
}
}else if(k%4==3){
for(j=ROW-k/4-2;j>k/4;j--,n++){
result[n]=array[j][k/4];
}
}
}
for(n=0;n<s;n++){
printf("%d\n",result[n]);
}
return 0;
} | 46 |
22,771 | int main(){
int m,n,i,k,s,q,w,e,r;
scanf("%d%d",&n,&m);
int a[n][m];
for(i=0;i<n;i++){
for(k=0;k<m;k++){
scanf("%d",&(a[i][k]));
}
}
s=0;
for(k=0;s<=m*n;k++){
for(q=k;q<=m-k-1;q++){
printf("%d\n",a[k][q]);
s=s+1;
}
if(s==m*n){
break;
}
for(w=k+1;w<=n-k-1;w++){
printf("%d\n",a[w][m-k-1]);
s=s+1;
}
if(s==m*n){
break;
}
for(e=m-k-2;e>=k;e--){
printf("%d\n",a[n-k-1][e]);
s=s+1;
}
if(s==m*n){
break;
}
for(r=n-k-2;r>=k+1;r--){
printf("%d\n",a[r][k]);
s=s+1;
}
if(s==m*n){
break;
}
}
return 0;
} | 46 |
22,772 | int main() {
int row,col;
int sz[100][100];
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int xx_row=0;
int sx_row=row-1;
int xx_col=0;
int sx_col=col-1;
while((xx_row<sx_row)&&(xx_col<sx_col)){
for(int i=xx_col;i<sx_col;i++){
printf("%d\n",sz[xx_row][i]);
}
for(int j=xx_row;j<sx_row;j++){
printf("%d\n",sz[j][sx_col]);
}
for(int k=sx_col;k>xx_col;k--){
printf("%d\n",sz[sx_row][k]);
}
for(int p=sx_row;p>xx_row;p--){
printf("%d\n",sz[p][xx_col]);
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;}
if((xx_row==sx_row)&&(xx_col!=sx_col)){
for(int i=xx_row;i<=sx_col;i++){printf("%d\n",sz[xx_row][i]);}}
if((xx_col==sx_col)&&(xx_row!=sx_row)){
for(int i=xx_col;i<=sx_row;i++){printf("%d\n",sz[i][xx_col]);}}
if((xx_row==sx_row)&&(xx_col==sx_col)){
printf("%d\n",sz[xx_row][sx_col]);}
return 0;
}
| 46 |
22,773 | int main()
{
int r, c, *a, l, m, n, i, up, dn, le, ri,k=1,end=0;
scanf("%d%d", &r, &c);
l = r*c;
up = 1;
dn = r;
le = 1;
ri = c;
a = (int*)malloc(sizeof(int)*(l + 1));
for (i = 1; i <= l; i++)
{
scanf("%d", &*(a + i));
}
printf("%d", *(a + 1));
do
{
for (n = le; n <= ri; n++)
{
if (up == 1 && n == 1)
continue;
printf("\n%d", *(a + (up - 1)*c + n));
k++;
if (k == l)
end = 1;
}
up++;
if (end == 1)
break;
for (m = up; m <= dn; m++)
{
printf("\n%d", *(a + (m - 1)*c + ri));
k++;
if (k == l)
end = 1;
}
ri--;
if (end == 1)
break;
for (n = ri; n >= le; n--)
{
printf("\n%d", *(a + (dn - 1)*c + n));
k++;
if (k == l)
end = 1;
}
dn--;
if (end == 1)
break;
for (m = dn; m >= up; m--)
{
printf("\n%d", *(a + (m - 1)*c + le));
k++;
if (k == l)
end = 1;
}
le++;
if (end == 1)
break;
} while(k!=l);
} | 46 |
22,774 | int main()
{
int row,col;
int i,j,n,time=0,x;
scanf("%d%d",&row,&col);
int array[100][100];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
for (n=0;;n++)
{
for (i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
time++;
}
if(time==row*col)break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
time++;
}
if(time==row*col)break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
time++;
}
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
time++;
}
if(time==row*col)break;
}
return 0;
} | 46 |
22,775 | //********************************
//*??????????? **
//*?????? 1300012957 **
//*???2013.11.12 **
//********************************
int main ( )
{
int array[100][100]; //????????????????
int row, col; //row?????col????
cin >> row >> col;
int i,j,k,a,b,c,d; //k?????ij???????a,b,c,d??????????
int A=0,B=0,C=0; //A?B?C?????????????????
int sum=0; //sum ???????????????
for( i = 0 ; i <= row - 1 ; i++ )
{
for( j = 0 ; j <= col - 1 ; j++ )
{
cin >> array[i][j] ; //??????
}
}
for( k = 0 ; ; k++ ) //?k?????
{
for( a = k ; a <= col - k - 1 ; a++ )
{
cout << array[k][a] << endl ; //???k+1? ?a+1???
sum++ ; //sum????
if( a == col - k - 1 )
A = array[k][a] ; //?????????????????????
}
if( sum == row * col )
break ; //?????????????????????????????
for( b = k ; b <= row - k - 1 ; b++ )
{
if( array[b][col-k-1] == A )
continue ; //???????????
cout << array[b][col-k-1] << endl ; //???k+1??b+1???
sum++ ; //sum??????????
if(b == row - k - 1 )
B = array[b][col-k-1] ; //????????????????????
}
if( sum == row * col )
break; //?????????????????????????????
for( c = col - k - 1 ; c >= k ; c-- )
{
if( array[row-k-1][c] == B )
continue ; //???????????
cout << array[row-k-1][c] << endl ;
sum++ ; //sum??????????
if( c == k )
C = array[row-k-1][c] ; //????????????????????
}
if( sum == row * col )
break ; //?????????????????????????????
for( d = row - k - 1 ; d >= k+1 ; d-- )
{
if( array[d][k] == C )
continue ; //???????????
cout << array[d][k] << endl ;
sum++ ; //sum??????????
}
if( sum == row*col )
break ; //?????????????????????????????
}
return 0 ;
} | 46 |
22,776 | int main(){
int matrix[100][100],i,j,m,n,row,col,counter=0,sum,flag;
scanf("%d %d",&row,&col);
sum=row*col;
for(i=0;i<row;i++){
for(j=0;j<col;j++)
scanf("%d",&matrix[i][j]);
}
for(flag=0;;flag++){
for(j=flag;j<col-flag;j++){
printf("%d\n",matrix[flag][j]);
counter++;
}
if(counter==sum)
break;
for(i=flag+1;i<row-flag;i++){
printf("%d\n",matrix[i][col-1-flag]);
counter++;
}
if(counter==sum)
break;
for(j=col-2-flag;j>=flag;j--){
printf("%d\n",matrix[row-1-flag][j]);
counter++;
}
if(counter==sum)
break;
for(i=row-2-flag;i>flag;i--){
printf("%d\n",matrix[i][flag]);
counter++;
}
if(counter==sum)
break;
}
return 0;
} | 46 |
22,777 |
int main()
{
int shuzu[100][100];
int i,j,row,col;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&shuzu[i][j]);
}
}
int row_xx=0,row_sx=row-1,col_xx=0,col_sx=col-1;
while(row_sx>row_xx&&col_sx>col_xx){
for(j=col_xx;j<col_sx;j++)
printf("%d\n",shuzu[row_xx][j]);
for(i=row_xx;i<row_sx;i++)
printf("%d\n",shuzu[i][col_sx]);
for(j=col_sx;j>col_xx;j--)
printf("%d\n",shuzu[row_sx][j]);
for(i=row_sx;i>row_xx;i--)
printf("%d\n",shuzu[i][col_xx]);
col_xx++;
row_xx++;
col_sx--;
row_sx--;
}
if(row_xx==row_sx&&col_xx<col_sx){
for(j=col_xx;j<=col_sx;j++){
printf("%d\n",shuzu[row_xx][j]);
}
}
else if(col_xx==col_sx&&row_xx<row_sx){
for(i=row_xx;i<=row_sx;i++){
printf("%d\n",shuzu[i][col_xx]);
}
}
if(row%2!=0&&col%2!=0&&((row>1&&col>1)||(row==1&&col==1))){
printf("%d\n",shuzu[(row-1)/2][(col-1)/2]);
}
return 0;
}
| 46 |
22,778 | //????????
int main()
{
int a[100][100],row ,col;
cin>>row>>col;
for(int i=0;i<row;i++) //????
for(int j=0;j<col;j++)
cin>>a[i][j];
int flag=0; //??
for(int i=0;;i++)
{
for(int j=i;j<=col-i-1;j++) //??
{
cout<<a[i][j]<<endl;
flag+=1;
if(flag==row*col)
break;
}
if(flag==row*col)
break;
for(int j=i+1;j<=row-i-1;j++) //??
{
cout<<a[j][col-i-1]<<endl;
flag+=1;
if(flag==row*col)
break;
}
if(flag==row*col)
break;
for(int j=col-i-2;j>=i+1;j--) //??
{
cout<<a[row-i-1][j]<<endl;
flag+=1;
if(flag==row*col)
break;
}
if(flag==row*col)
break;
for(int j=row-i-1;j>=i+1;j--) //??
{
cout<<a[j][i]<<endl;
flag+=1;
if(flag==row*col)
break;
}
if(flag==row*col)
break;
}
return 0;
} | 46 |
22,779 |
int main()
{
int a[100][100], vis[100][100] = {0};
int row, col, n, x = -1, y = 0;
cin >> row >> col;
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
{
cin >> a[j][i];
}
n = row * col;
while (n)
{
while (!vis[x + 1][y] && x + 1 < col)
{
x++;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
while (!vis[x][y + 1] && y + 1 < row)
{
y++;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
while (!vis[x - 1][y] && x > 0)
{
x--;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
while (!vis[x][y - 1] && y > 0)
{
y--;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
}
return 0;
} | 46 |
22,780 | /**
* @file ????????
* @auth zmj
* @date 2013-12-30
* @desc ?????????
*/
int main()
{
int map[MAX_N][MAX_N];
int n, m, count;
int i, j, k;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
scanf("%d", &map[i][j]);
}
}
count = n*m;
for (k = 0;; k++)
{
for (j = k; j < m - k; j++)
{
printf("%d\n", map[k][j]);
count--;
if (count == 0) return 0;
}
for (i = k + 1; i < n - k; i++)
{
printf("%d\n", map[i][j-1]);
count--;
if (count == 0) return 0;
}
for (j = j -2; j > k-1; j--)
{
printf("%d\n", map[i - 1][j]);
count--;
if (count == 0) return 0;
}
for (i = i - 2; i > k; i--)
{
printf("%d\n", map[i][k]);
count--;
if (count == 0) return 0;
}
}
}
| 46 |
22,781 | int main()
{int n,m,v[100][100],z,d;
scanf("%d %d",&m,&n);
for(int i=0;i<=m-1;i++)
{for(int j=0;j<=n-1;j++)
{scanf("%d",&(v[i][j]));}
}
int p=0,u=n;
if(m>n){u=m;}
for(int i=0;i<=u;i++)
{
for(int d=i;d<=n-i-1;d++)
{
printf("%d\n",v[i][d]);
p++;if(p==m*n){break;}
}
if(p==m*n){break;}
for(int a=i+1;a<=m-i-1;a++)
{
printf("%d\n",v[a][n-1-i]);
p++;if(p==m*n){break;}
}
if(p==m*n){break;}
for(int b=n-i-2;b>=i;b--)
{
printf("%d\n",v[m-i-1][b]);
p++;if(p==m*n){break;}
}
if(p==m*n){break;}
for(int c=m-i-2;c>=i+1;c--)
{
printf("%d\n",v[c][i]);
p++;
if(p==m*n){break;}
}
if(p==m*n){break;}
}
return 0;
} | 46 |
22,782 | int main()
{
int col,row,ROW,COL,n[100][100],i,b=0,N;
scanf("%d %d",&ROW,&COL);
N=ROW*COL;
for(row=0;row<ROW;row++){
for(col=0;col<COL;col++){
scanf("%d",&n[row][col]);
}
}
for(i=0;;i++){
if(b<N){
for(col=i,row=i;col<(COL-i);col++){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
for(col=COL-1-i,row=i+1;row<ROW-i;row++){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
for(row=ROW-1-i,col=COL-2-i;col>=i;col--){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
for(col=i,row=ROW-2-i;row>=i+1;row--){
if(b<N){
printf("%d\n",n[row][col]);
b+=1;
}else break;
}
}else break;
}
return 0;
}
| 46 |
22,783 | int main()
{
int col,row,sz[100][100],i,j,m=0,k;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
if(col<=row)
{
for(k=1;2*k<col+1;k++)
{
for(j=k-1;j<col-k;j++)
{
printf("%d\n",sz[k-1][j]);
m++;
}
for(i=k-1;i<row-k;i++)
{
printf("%d\n",sz[i][col-k]);
m++;
}
for(j=col-k;j>k-1;j--)
{
printf("%d\n",sz[row-k][j]);
m++;
}
for(i=row-k;i>k-1;i--)
{
printf("%d\n",sz[i][k-1]);
m++;
}
}
for(i=k-1;i<row,m<row*col;i++,m++)
{
printf("%d\n",sz[i][k-1]);
}
}
else
{
for(k=1;2*k<row+1;k++)
{
for(j=k-1;j<col-k;j++)
{
printf("%d\n",sz[k-1][j]);
m++;
}
for(i=k-1;i<row-k;i++)
{
printf("%d\n",sz[i][col-k]);
m++;
}
for(j=col-k;j>k-1;j--)
{
printf("%d\n",sz[row-k][j]);
m++;
}
for(i=row-k;i>k-1;i--)
{
printf("%d\n",sz[i][k-1]);
m++;
}
}
for(j=k-1;j<col-k,m<row*col;j++,m++)
{
printf("%d\n",sz[k-1][j]);
}
}
return 0;
} | 46 |
22,784 |
int main()
{
int a[100][100],b[100][100],j,q,k,i,n,m,row,col;
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)
{
if(col%2==0){
k=col/2;
for(q=1;q<=k;q++){
i=0;
for(j=0;j<col-1;j++)
printf("%d\n",a[i][j]);
j=col-1;
for(i=0;i<row-1;i++)
printf("%d\n",a[i][j]);
i=row-1;
for(j=col-1;j>0;j--)
printf("%d\n",a[i][j]);
j=0;
for(i=row-1;i>0;i--)
printf("%d\n",a[i][j]);
for(i=1,n=0;i<row-1;i++,n++){
for(j=1,m=0;j<col-1;j++,m++){
b[n][m]=a[i][j];
}
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
a[i][j]=b[i][j];
}
}
col=col-2;
row=row-2;
}
}
else
{
k=col/2;
for(q=1;q<=k;q++){
i=0;
for(j=0;j<col-1;j++)
printf("%d\n",a[i][j]);
j=col-1;
for(i=0;i<row-1;i++)
printf("%d\n",a[i][j]);
i=row-1;
for(j=col-1;j>0;j--)
printf("%d\n",a[i][j]);
j=0;
for(i=row-1;i>0;i--)
printf("%d\n",a[i][j]);
for(i=1,n=0;i<row-1;i++,n++){
for(j=1,m=0;j<col-1;j++,m++){
b[n][m]=a[i][j];
}
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
a[i][j]=b[i][j];
}
}
col=col-2;
row=row-2;
}
for(i=0;i<row;i++)
printf("%d\n",a[i][0]) ;
}
}
else
{
if(row%2==0){
k=row/2;
for(q=1;q<=k;q++){
i=0;
for(j=0;j<col-1;j++)
printf("%d\n",a[i][j]);
j=col-1;
for(i=0;i<row-1;i++)
printf("%d\n",a[i][j]);
i=row-1;
for(j=col-1;j>0;j--)
printf("%d\n",a[i][j]);
j=0;
for(i=row-1;i>0;i--)
printf("%d\n",a[i][j]);
for(i=1,n=0;i<row-1;i++,n++){
for(j=1,m=0;j<col-1;j++,m++){
b[n][m]=a[i][j];
}
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
a[i][j]=b[i][j];
}
}
col=col-2;
row=row-2;
}
}
else
{
k=row/2;
for(q=1;q<=k;q++){
i=0;
for(j=0;j<col-1;j++)
printf("%d\n",a[i][j]);
j=col-1;
for(i=0;i<row-1;i++)
printf("%d\n",a[i][j]);
i=row-1;
for(j=col-1;j>0;j--)
printf("%d\n",a[i][j]);
j=0;
for(i=row-1;i>0;i--)
printf("%d\n",a[i][j]);
for(i=1,n=0;i<row-1;i++,n++){
for(j=1,m=0;j<col-1;j++,m++){
b[n][m]=a[i][j];
}
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
a[i][j]=b[i][j];
}
}
col=col-2;
row=row-2;
}
for(j=0;j<col;j++)
printf("%d\n",a[0][j]) ;
}
}
return 0;
}
| 46 |
22,785 | int main()
{
int i,j,n,m,k,q,p;
int a[100][100];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
}
for(i=0;i<((n+1)/2);i++)
{
for(j=i;j<m-i;j++)
printf("%d\n",a[i][j]);
for(k=i+1;k<(n-i)&&i<(m-i);k++)
printf("%d\n",a[k][m-1-i]);
for(p=(m-i-2);p>=i&&(i+1)<(n-i);p--)
printf("%d\n",a[n-i-1][p]);
for(q=n-i-2;q>i&&(m-i-2)>=i;q--)
printf("%d\n",a[q][i]);
}
return 0;
}
| 46 |
22,786 | int main()
{
int number[100][100];
int row,col,i,j,a=0,zongshu=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&number[i][j]);
}
}
for(a=0;a>=0;a++)
{
for(j=a;j<col-a;j++)
{
printf("%d\n",number[a][j]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
for(i=a+1;i<row-a;i++)
{
printf("%d\n",number[i][col-a-1]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
for(j=col-2-a;j>=a;j--)
{
printf("%d\n",number[row-a-1][j]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
for(i=row-2-a;i>a;i--)
{
printf("%d\n",number[i][a]);
zongshu++;
}
if(zongshu==row*col)
{
break;
}
}
return 0;
}
| 46 |
22,787 | int main ()
{
int m,n,i,j,g,h,k,l;
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]);
}
}
g=0;
j=0;
h=0;
l=0;
for(i=0;i<m;i++)
{
for(j=i;j<n-i;j++)
{
if(l==m*n)
{break;}
printf("%d\n",a[i][j]);
l++;
if(l==m*n)
{break;}
}
j=n-i-1;
for(g=i+1;g<m-i;g++)
{
if(l==m*n)
{break;}
printf("%d\n",a[g][j]);
l++;
if(l==m*n)
{break;}
}
k=m-i-1;
for(j=n-i-2;j>=i;j--)
{
if(l==m*n)
{break;}
printf("%d\n",a[k][j]);
l++;
if(l==m*n)
{break;}
}
for(h=m-i-2;h>i;h--)
{
if(l==m*n)
{break;}
printf("%d\n",a[h][i]);
l++;
if(l==m*n)
{break;}
}
if(l==m*n)
{break;}
}
return 0;
} | 46 |
22,788 | int array[99][99];
int x, y, row, col;
void out(int x0, int y0, int wid, int len)
{
x = x0;
y = y0;
for (; x < x0 + wid; x++)
{
cout << array[x][y] << endl;
}
x--;
for (y++; y < y0 + len; y++)
{
cout << array[x][y] << endl;
}
y--;
for (x--; x >= x0; x--)
{
if (wid == 1)
{
break;
}
if (len == 1)
{
break;
}
cout << array[x][y] << endl;
}
x++;
for (y--; y > y0; y--)
{
if (wid == 1)
{
break;
}
if (len == 1)
{
break;
}
cout << array[x][y] << endl;
}
y++;
if (wid <= 2 || len <= 2)
{
1;
}
else
{
out(x0 + 1, y0 + 1, wid - 2, len - 2);
}
}
int main()
{
cin >> row >> col;
for (y = 0; y < row; y++)
{
for (x = 0; x < col; x++)
{
cin >> array[x][y];
}
}
out(0, 0, col, row);
return 0;
} | 46 |
22,789 | /*
* 1204.cpp
*
* Created on: 2012-12-4
* Author: wangyinzhi
*/
int a[100][100],b[10000],x,y,k=0;
int cube(int c,int x,int y)
{
if(x<=0||y<=0) return 0;
for(int i=c;i<y;i++){
b[k]=a[c][i];
k++;
}
for(int j=c+1;j<x;j++){
b[k]=a[j][y-1];
k++;
}
for(int r=y-2;r>=c;r--){
b[k]=a[x-1][r];
k++;
}
for(int s=x-2;s>=c+1;s--){
b[k]=a[s][c];
k++;
}
cube(c+1,x-1,y-1);
}
int main(){
int row,col,i,j,n;
cin>>row>>col;
n=row*col;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
cin>>a[i][j];
}
}
cube(0,row,col);
for(i=0;i<n;i++){
cout<<b[i]<<endl;
}
return 0;
}
| 46 |
22,790 | main()
{int i,j,k,m,n,p,q,s;
scanf("%d %d",&m,&n);
struct{int k;int p;}shu[m+2][n+2];
for(i=1;i<=m;i++)
{for(j=1;j<=n;j++)
{scanf("%d",&shu[i][j].k);shu[i][j].p=1;}}
for(j=0;j<=(n+1);j++)
shu[0][j].p=0;
for(j=0;j<=(n+1);j++)
shu[m+1][j].p=0;
for(i=0;i<=(m+1);i++)
shu[i][n+1].p=0;
for(i=0;i<=(m+1);i++)
shu[i][0].p=0;
// for(i=0;i<(m+2);i++)
//{for(j=0;j<(n+2);j++)
//printf("%d\n",shu[i][j].p);}
for(i=1,j=1,s=1;;)
{
for(;;)
{if(shu[i][j].p==1)
{printf("%d\n",shu[i][j].k);shu[i][j].p=0;j++;}
else {if((shu[i][j].p==0)&&(shu[i][j-2].p==0)&&(shu[i-1][j-1].p==0)&&(shu[i+1][j-1].p==0))
{s=0;break;}
else {i=i+1;j=j-1;break;}
}
}
for(;;)
{ if(shu[i][j].p==1)
{printf("%d\n",shu[i][j]);shu[i][j].p=0;i++;}
else { if((shu[i][j].p==0)&&(shu[i-2][j].p==0)&&(shu[i-1][j+1].p==0)&&(shu[i-1][j-1].p==0))
{s=0;break;}
else {i=i-1;j=j-1;break;}
}
}
for(;;)
{ if(shu[i][j].p==1)
{printf("%d\n",shu[i][j]);shu[i][j].p=0;j--;}
else {if((shu[i][j].p==0)&&(shu[i][j+2].p==0)&&(shu[i-1][j+1].p==0)&&(shu[i+1][j+1].p==0))
{s=0;break;}
else {j++;i--;break;}
}
}
for(;;)
{ if(shu[i][j].p==1)
{printf("%d\n",shu[i][j]);shu[i][j].p=0;i--;}
else {if((shu[i+2][j].p==0)&&(shu[i][j].p==0)&&(shu[i+1][j+1].p==0)&&(shu[i+1][j-1].p==0))
{s=0;break;}
else {j++;i++;break;}
}
}
if(s==0) break;
}
}
| 46 |
22,791 |
int re(int a[100][100],int row,int col,int b[])
{
int i,j,k=0,p,mm,m;
for(i=0;i<=row/2;i++)
{
for(j=i;j<col-i&&k<row*col;j++)
{b[k]=a[i][j];
k++;}
for(p=i+1;p<row-i&&k<row*col;p++)
{
b[k]=a[p][j-1];
k++;
}
for(mm=(col-2-i);mm>=i&&k<row*col;)
{
b[k]=a[row-i-1][mm];
k++;
mm--;
}
for(m=row-2-i;m>i&&k<row*col;m--)
{
b[k]=a[m][i];
k++;
}
}
return k;
}
int main()
{
int a[100][100],b[10000];
int row,col,i,j,xx;
scanf("%d%d",&row, &col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
xx=re(a,row,col,b);
for(i=0;i<xx;i++)
printf("%d\n",b[i]);
return 0;
}
| 46 |
22,792 | int main(){
int s[100][100];
int i=0,j,r,R,C,c,q;
scanf("%d%d",&R,&C);
for(r=0;r<R;r++){
for(c=0;c<C;c++){
scanf("%d",&s[r][c]);
}
}
for(q=0;i<R*C;q++){
for(j=q;j<C-q;j++){
printf("%d\n",s[q][j]);
i++;
if(i==R*C)
return 0;
}
for(j=q+1;j<R-q;j++){
printf("%d\n",s[j][C-1-q]);
i++;
if(i==R*C)
return 0;
}
for(j=C-2-q;j>q-1;j--){
printf("%d\n",s[R-1-q][j]);
i++;
if(i==R*C)
return 0;
}
for(j=R-2-q;j>q;j--){
printf("%d\n",s[j][q]);
i++;
if(i==R*C)
return 0;
}
}
return 0;
}
| 46 |
22,793 |
int main(){
int i,j,t,row,col;
int a[100][100];
scanf("%d%d",&row,&col);
if(row>=col){
t=col/2;
}
else{
t=row/2;
}
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
int rmax=row-1,rmin=0,cmax=col-1,cmin=0;
// printf("%d",t);
for(i=0;i<t;i++){
for(j=cmin;j<cmax;j++){
printf("%d\n",a[rmin][j]);
}
for(j=rmin;j<rmax;j++){
printf("%d\n",a[j][cmax]);
}
for(j=cmax;j>cmin;j--){
printf("%d\n",a[rmax][j]);
}
for(j=rmax;j>rmin;j--){
printf("%d\n",a[j][cmin]);
}
rmax-=1;
rmin+=1;
cmax-=1;
cmin+=1;
}
if(col%2!=0&&row>=col){
for(i=t;i<row-t;i++){
printf("%d\n",a[i][col/2]);
}
}
else if(row%2!=0&&row<=col){
for(i=t;i<col-t;i++){
printf("%d\n",a[row/2][i]);
}
}
return 0;
} | 46 |
22,794 | int main()
{
int n[ROW][COL],row,col,i,j,begin;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++) scanf("%d",&n[i][j]);
}
for(begin=0;;begin++)
{
if(begin>=(col-begin)) break;
for(i=begin,j=begin;j<(col-begin);j++) printf("%d\n",n[i][j]);
if((begin+1)>=(row-begin)) break;
else for(i=(begin+1),j=(col-begin-1);i<(row-begin);i++) printf("%d\n",n[i][j]);
if((col-begin-2)<begin) break;
else for(i=(row-begin-1),j=(col-begin-2);j>(begin-1);j--) printf("%d\n",n[i][j]);
if((row-begin-2)<(begin+1)) break;
else for(i=(row-begin-2),j=begin;i>begin;i--) printf("%d\n",n[i][j]);
}
} | 46 |
22,795 | /**
* @file 2.cpp
* @author ???
* @date 2013-11-5
* @description
* ????????? - ????????
*/
int main()
{
int col, row, a[100][100], state=0, step[4], curstep, flag=1;
int dir[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};
int pos[2] = {0,0};
cin >> row >> col;
for(int i=0; i<row; ++i)
for(int j=0; j<col; ++j)
cin >> a[i][j];
step[0] = col;
step[1] = row-1;
step[2] = col-1;
step[3] = row-2;
curstep = step[state];
while(curstep > 0){
for(int i=0+flag; i<curstep; ++i){
cout << a[pos[0]][pos[1]] << endl;
pos[0] += dir[state][0];
pos[1] += dir[state][1];
}
step[state] = step[state]-2;
state = (state+1)%4;
curstep = step[state];
flag = 0;
}
cout << a[pos[0]][pos[1]] << endl;
return 0;
} | 46 |
22,796 | int main()
{ int i ,j ,k,row,col;
int t = 0 ;
cin >> row >> col;
int array[row][col];
for(i = 0; i <= row - 1;i ++)
{
for(j = 0; j <= col - 1; j ++)
{
cin >> array[i][j];
}
}
for( k = 0;;k ++ )
{
for(j = 0 + k; j <= col - 1 - k; j ++)
{
cout << array[k][j] << endl;
t ++;
if( t == row *col)
{ break ;
}
}
if ( t == row*col )
{
break;
}
for(i = 1 + k; i <= row - 1 - k; i ++)
{
cout << array[i][col - 1 - k] << endl;
t ++;
if( t == row *col)
{ break ;
}
}
if( t == row *col)
{ break ;
}
for(j = col - 2 - k; j >= 0 + k; j --)
{
cout << array[row - 1 -k][j] << endl;
t ++;
if( t == row *col)
{ break ;
}
}
if( t == row *col)
{ break ;
}
for(i = row - 2 - k; i >= 1 + k; i --)
{ cout << array[i][0+k] << endl;
t ++ ;
if( t == row *col)
{ break ;
}
}
if( t == row *col)
{ break ;
}
}
return 0 ;
} | 46 |
22,797 | int main()
{
int a[105][105];
int row,col,i,j,t=0,temp=0,count=0;
scanf("%d%d",&row,&col);
int sum=row*col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
while(1)
{
for(i=t;i<col-t;i++)
{
printf("%d\n",a[t][i]);
count++;
}
if(count==sum)
break;
for (i=t+1;i<row-t;i++)
{
printf("%d\n",a[i][col-t-1]);
count++;
}
if(count==sum)
break;
for (i=col-2-t;i>=t;i--)
{
printf("%d\n",a[row-t-1][i]);
count++;
}
if(count==sum)
break;
for (i=row-2-t;i>t;i--)
{
printf("%d\n",a[i][t]);
count++;
}
if(count==sum)
break;
t++;
}
return 0;
}
| 46 |
22,798 | int main()
{
int row,col,i,j,u[100][100],a,sum=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&u[i][j]);
}
}
for(a=0;a<row/2+1;a++)
{
for(i=a,j=a;j<col-a;j++)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
for(j=col-a-1,i=a+1;i<row-a;i++)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
for(i=row-a-1,j=col-a-2;j>=a;j--)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
for(j=a,i=row-a-2;i>a;i--)
{
printf("%d\n",u[i][j]);
sum++;
if(sum==row*col)
break;
}
if(sum==row*col)
break;
}
return 0;
}
| 46 |
22,799 | void main()
{
int a[100][100],i,j,k;
int x,y,row,col;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}
}
x=0; y=row*col;
for(k=0;;k++){
for(j=1+k;j<=(col-k);j++)
{
printf("%d\n",a[1+k][j]);
x++;
if(x==y) break;
}
if(x==y) break;
for(i=2+k;i<=(row-k);i++)
{
printf("%d\n",a[i][col-k]);//??
x++;
if(x==y) break;
}
if(x==y) break;
for(j=(col-1-k);j>k;)
{
printf("%d\n",a[row-k][j]);//??
j=j-1;
x++;
if(x==y) break;
}
if(x==y) break;
for(i=(row-1-k);i>(1+k);)
{
printf("%d\n",a[i][1+k]);//??
i=i-1;
x++;
if(x==y) break;
}
if(x==y) break;
}
}
| 46 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.