label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
46 | 22500 | 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 | 22501 | //********************************
//*???????????
//*??? ?? 1300012814 **
//*???2013.10,30 **
//********************************
int main()
{
int a[101][101], row, col, num = 0, m = 1, n = 0; //?????row????col????num????????????m?????????n????????
cin >> row >>col; //??????
for (int i = 0; i <= row + 1;i++)
{
for (int j = 0; j <= col + 1; j++)
{
if (i == 0||j == 0||i == row + 1||j == col +1)
a[i][j] = 0;
else cin >> a[i][j];
}
} //????????????????????????????0
int i = 1, j = 1;
while (num < col * row) //???????????????
{
cout << a[i][j] <<endl;
a[i][j] = 0;
num++; //??a[i][j]??????num++???????????0
if (a[i + n][m + j] == 0) //??????????0?????????
{
if (m != 0)
{
n = m;
m = 0;
} //m?????????????????????
else
{
m = -n;
n = 0;
} //n?????????????????????
}
i = i + n;
j = j + m; //???????????
}
return 0;
} |
46 | 22502 | int dir[4][2]={0,1, 1,0, 0,-1, -1,0};
int k,row,col,a[200][200];
int main(){
scanf("%d%d",&row,&col);
for (int i=0;i<row;++i)
for (int j=0;j<col;++j) scanf("%d",&a[i][j]);
int k=0,i=0,j=0,i1,j1;
while (1>0){
printf("%d\n",a[i][j]);
a[i][j]=-1;
i1=i+dir[k][0];
j1=j+dir[k][1];
if (i1>=0 && i1<row && j1>=0 && j1<col && a[i1][j1]!=-1){
i=i1;j=j1;
continue;
}
k=(k+1)%4;
i1=i+dir[k][0];
j1=j+dir[k][1];
if (i1>=0 && i1<row && j1>=0 && j1<col && a[i1][j1]!=-1){
i=i1;j=j1;
continue;
}
break;
}
}
|
46 | 22503 |
int main()
{
int a[100][100] = {0}, row, col, i, j, b[100][100] = {0}, num = 0;
cin >> row >> col;
for (i = 0; i <= row - 1; i++)
{
for (j = 0; j <= col - 1; j++)
cin >> a[i][j];
}
i = 0;
j = 0;
while (1)
{
while (j != col && b[i][j] == 0)
{
cout << a[i][j] << endl;
b[i][j] = 1;
num++;
j++;
}
j--;
i++;
while (i != row && b[i][j] == 0)
{
cout << a[i][j] << endl;
b[i][j] = 1;
num++;
i++;
}
i--;
j--;
while (j != -1 && b[i][j] == 0)
{
cout << a[i][j] << endl;
b[i][j] = 1;
num++;
j--;
}
j++;
i--;
while (i != -1 && b[i][j] == 0)
{
cout << a[i][j] << endl;
b[i][j] = 1;
num++;
i--;
}
i++;
j++;
if (num == row * col)
break;
}
return 0;
} |
46 | 22504 | 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 | 22505 | 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 | 22506 | /*
* bianli2.cpp
*
* Created on: 2011-11-5
* Author: 1100012857
*/
int main()
{
int row,col,i,j;
int a[100][100];
cin>>row>>col;
for (i=0;i<=row-1;i++)
{
for (j=0;j<=col-1;j++)
{
cin>>a[i][j];
}
}
int lu_x=0,lu_y=0,rd_x=row-1,rd_y=col-1;
while(lu_x<rd_x&&lu_y<rd_y)
{
for (j=lu_y;j<=rd_y;j++)
cout<<a[lu_x][j]<<endl;
for (i=lu_x+1;i<=rd_x;i++)
cout<<a[i][rd_y]<<endl;
for (j=rd_y-1;j>=lu_y;j--)
cout<<a[rd_x][j]<<endl;
for (i=rd_x-1;i>=lu_x+1;i--)
cout<<a[i][lu_y]<<endl;
lu_x++;lu_y++;rd_x--;rd_y--;
}
if(lu_x==rd_x)
{
for (j=lu_y;j<=rd_y;j++) cout<<a[lu_x][j]<<endl;
}
else
{
for (i=lu_x;i<=rd_x;i++) cout<<a[i][rd_y]<<endl;
}
return 0;
}
|
46 | 22507 |
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 | 22508 |
void main()
{
int n,m,i,j,x,y,pos;
int p[200][200]={0};
int a[200][200];
int f[10][2];
f[0][0]=0; f[0][1]=1;
f[1][0]=1; f[1][1]=0;
f[2][0]=0; f[2][1]=-1;
f[3][0]=-1; f[3][1]=0;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
p[i][j]=1;
scanf("%d",&a[i][j]);
}
x=1; y=1; pos=0;
for (i=1;i<=n*m;i++)
{
printf("%d\n",a[x][y]);
p[x][y]=0;
if (!p[x+f[pos][0]][y+f[pos][1]])
pos=(pos+1)%4;
x=x+f[pos][0];
y=y+f[pos][1];
}
} |
46 | 22509 |
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 | 22510 | int main()
{
int row,col;
int b,c,d,e,k,i;
int 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]);
}
}
b=0;
d=0;
c=col-1;
e=row-1;
for(;b<=c&&d<=e;b++,d++,c--,e--)
{
if(b!=c&&d!=e)
{
for(i=b;i<c;i++)
printf("%d\n",a[d][i]);
for(i=d;i<e;i++)
printf("%d\n",a[i][c]);
for(i=c;i>b;i--)
printf("%d\n",a[e][i]);
for(i=e;i>d;i--)
printf("%d\n",a[i][b]);
}
else if(b==c)
{
for(i=d;i<=e;i++)
printf("%d\n",a[i][b]);
}
else if(d==e)
{
for(i=b;i<=c;i++)
printf("%d\n",a[d][i]);
}
}
return 0;
}
|
46 | 22511 | int main()
{
int row,col,i,j;
cin>>row>>col;
int a[row][col];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>a[i][j];
int n=0;//n??????1
while((n<row/2)&&(n<col/2))//??????????
{
for(j=n;j<=col-2-n;j++)
cout<<a[n][j]<<endl;
for(i=n;i<=row-2-n;i++)
cout<<a[i][col-1-n]<<endl;
for(j=col-1-n;j>=1+n;j--)
cout<<a[row-1-n][j]<<endl;
for(i=row-1-n;i>=1+n;i--)
cout<<a[i][n]<<endl;
n++;
}
//??????????
for(j=n;j<=col-1-n;j++)
cout<<a[n][j]<<endl;
if(row-1-2*n>0)//???????????
{
for(i=n+1;i<=row-1-n;i++)
cout<<a[i][col-1-n]<<endl;
if(col-2-2*n>0)//??????????
{
for(j=col-2-n;j>=n;j--)
cout<<a[row-1-n][j];
}
}
}
|
46 | 22512 | int main(){
int r,c;
scanf("%d %d",&r,&c);
int sz[100][100];
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
scanf("%d",&sz[i][j]);
}
}
int i=0,j=0;
int p=0,q=0;
int n=0;
while(i<=r/2&&j<=c/2){
while(q<c-j){
printf("%d\n",sz[p][q]);
q++;
n++;
}
if(n>=r*c){
break;
}
q=q-1;
p=p+1;
while(p<r-i){
printf("%d\n",sz[p][q]);
p++;
n++;
}
if(n>=r*c){
break;
}
p=p-1;
q=q-1;
while(q>=j){
printf("%d\n",sz[p][q]);
q--;
n++;
}
if(n>=r*c){
break;
}
q=q+1;
p=p-1;
i=i+1;
while(p>=i){
printf("%d\n",sz[p][q]);
p--;
n++;
}
if(n>=r*c){
break;
}
p=p+1;
q=q+1;
j=j+1;
}
return 0;
} |
46 | 22513 | int main()
{
int m,n,h=1,v=0,i,j;
int array[100][100];
while(cin>>m>>n)
{
memset(array,0,sizeof(array));
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>array[i][j];
h=1;v=0;
while(m>0&&n>0)
{
if(m!=1&&n!=1)
{
for(i=1;i<=n;i++)
{
v++;
cout<<array[h][v]<<endl;
}
for(i=1;i<=m-1;i++)
{
h++;
cout<<array[h][v]<<endl;
}
for(i=1;i<=n-1;i++)
{
v--;
cout<<array[h][v]<<endl;
}
for(i=1;i<=m-2;i++)
{
h--;
cout<<array[h][v]<<endl;
}
m=m-2;
n=n-2;
}
else if(m==1)
{
for(i=1;i<=n;i++)
{
v++;
cout<<array[h][v]<<endl;
}
m=m-2;
n=n-2;
}
else
{
v++;
for(i=1;i<=m;i++)
{
cout<<array[h][v]<<endl;
h++;
}
m=m-2;
n=n-2;
}
}
}
return 0;
} |
46 | 22514 | int main()
{
int row,col,row1,row2,col1,col2,array[100][100],i,j,i1,i2,j1,j2;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&(array[i][j]));
}
}
col1=0;
col2=col-1;
row1=0;
row2=row-1;
while((row2-row1>0)&&(col2-col1>0))
{
for(i1=col1;i1<col2;i1++)
printf("%d\n",array[row1][i1]);
for(j1=row1;j1<row2;j1++)
printf("%d\n",array[j1][col2]);
for(i2=col2;i2>col1;i2--)
printf("%d\n",array[row2][i2]);
for(j2=row2;j2>row1;j2--)
printf("%d\n",array[j2][col1]);
col1++;
col2--;
row1++;
row2--;
}
if((row2-row1==0)&&(col2-col1!=0))
{
for(i=col1;i<=col2;i++)
{
printf("%d\n",array[row1][i]);
}
}
if((col2-col1==0)&&(row2-row1!=0))
{
for(j=row1;j<=row2;j++)
{
printf("%d\n",array[j][col1]);
}
}
if((col2-col1==0)&&(row2-row1==0))
printf("%d\n",array[row1][col1]);
return 0;
}
|
46 | 22515 | int main()
{
int i,j,row,col,state;
int sz[100][100],zt[100][100]={0};
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
state=0;
i=0;
j=0;
while(1)
{
if(zt[i][j]==1)
break;
else
{
if(state==0&&j+1<col&&zt[i][j+1]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j++;
}
else if(state==0)
{
if(row>1)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i++;
state=1;
}
else
{
printf("%d\n",sz[i][j]);
break;
}
}
else if(state==1&&i+1<row&&zt[i+1][j]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i++;
}
else if(state==1)
{
if(col>1)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j--;
state=2;
}
else
{
printf("%d\n",sz[i][j]);
break;
}
}
else if(state==2&&j-1>=0&&zt[i][j-1]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j--;
}
else if(state==2)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i--;
state=3;
}
else if(state==3&&i-1>=0&&zt[i-1][j]==0)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
i--;
}
else if(state==3)
{
printf("%d\n",sz[i][j]);
zt[i][j]=1;
j++;
state=0;
}
}
}
return 0;
}
|
46 | 22516 | /**
????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 | 22517 | void main()
{
int i,j,r,c,num=0,a[100][100],k;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
k=r*c;
for(i=0;;i++)
{
for(j=i;j<=c-1-i;j++)
{
printf("%d\n",a[i][j]);
num=num+1;
}
if(num==k)
break;
for(j=i+1;j<=r-1-i;j++)
{
printf("%d\n",a[j][c-i-1]);
num=num+1;
}
if(num==k)
break;
for(j=c-i-2;j>=i;j--)
{
printf("%d\n",a[r-1-i][j]);
num=num+1;
}
if(num==k)
break;
for(j=r-i-2;j>=(i+1);j--)
{
printf("%d\n",a[j][i]);
num=num+1;
}
if(num==k)
break;
}
}
|
46 | 22518 | int main()
{
int arrey [100][100];
int i, j, k, times, all;
int row, col;
cin >> row >> col;
for(i = 0; i < row; i ++)
for(j = 0; j < col ; j ++)
cin >> arrey[i][j];
k = 0;
times = 0;
all = row * col;
do{
i = k;
j = k;
for( ; j <= col - 1; j ++)
{
cout << arrey[i][j] << endl;
times ++;
}
--j;
if( times == all)
break;
for(++i ; i <= row - 1;i ++)
{
cout << arrey[i][j] << endl;
times ++;}
--i;
if( times == all)
break;
for( --j;j >= k; j --)
{
cout << arrey[i][j] << endl;
times ++;
}
if( times == all)
break;
++j;
for(--i ;i > k; i --)
{
cout << arrey[i][j] << endl;
times ++;
}
if( times == all)
break;
col --;
row --;
k ++;
}while(1);
return 0;
} |
46 | 22519 | 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 | 22520 | int a[2000][2000];
void print(int h,int l)
{
int i,j;
for(j=0;j<l;j++)
{printf("%d\n",a[0][j]);}
for(i=1;i<h;i++)
{printf("%d\n",a[i][l-1]);}
for(j=l-2;j>=0;j--)
{printf("%d\n",a[h-1][j]);}
for(i=h-2;i>0;i--)
{printf("%d\n",a[i][0]);}
}
void gai(int h,int l)
{
int i,j;
for(i=0;i<h-1;i++)
{
for(j=0;j<l-2;j++)
{
a[i][j]=a[i][j+1];
}
}
for(j=0;j<l-2;j++)
{
for(i=0;i<h-2;i++)
{
a[i][j]=a[i+1][j];
}
}
}
void main()
{
int i,j,h,l;
scanf("%d %d",&h,&l);
for(i=0;i<h;i++)
{
for(j=0;j<l;j++)
{
scanf("%d",&a[i][j]);
}
}
for( ;(h>1&&l>1);h=h-2,l=l-2)
{
print(h,l);
gai(h,l);
}
if(h==1&&l>1)
{
for(j=0;j<l;j++) printf("%d\n",a[0][j]);
}
else if(l==1&&h>1)
{
for(i=0;i<h;i++) printf("%d\n",a[i][0]);
}
else if(h==1&&l==1)
{
printf("%d\n",a[0][0]);
}
} |
46 | 22521 | int main(){
int sz[100][100];
int m,n;
scanf("%d %d",&m,&n);
int i,j,p,m1,n1;
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&sz[i][j]);
}
}
int a = m > n ? n : m;
for(p=0;p<a/2;p++){
for(m1=p,n1=p;n1<n-1-p;n1++){
printf("%d\n",sz[m1][n1]);
}
//printf("--> end\n");
for(n1=n-1-p,m1=p;m1<m-1-p;m1++){
printf("%d\n",sz[m1][n1]);
}
//printf("|v end\n");
if(m-1-p!=p)
{
for(m1=m-1-p,n1=n-1-p;n1>p;n1--){
printf("%d\n",sz[m1][n1]);
}
//printf("<--- end\n");
}
if(n-1-p!=p)
{
for(n1=p,m1=m-1-p;m1>=p+1;m1--){
printf("%d\n",sz[m1][n1]);
}
//printf("^| end\n");
}
}
//printf("p=%d\n", p);
if (m-1-p == p) {
for (int i = p; i <= n-1-p; i++)
printf("%d\n", sz[p][i]);
} else if (n-1-p == p) {
for (int i = p; i <= m-1-p; i++)
printf("%d\n", sz[i][p]);
}
return 0;
} |
46 | 22522 | //********************************
//*??????????? **
//*?????? 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 | 22523 | int main()
{
int row,col,i,j,a[100][100],xxrow,sxrow,xxcol,sxcol;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
xxrow=0;
sxrow=row-1;
xxcol=0;
sxcol=col-1;
for(;1;){
if(xxrow==sxrow&&xxcol<=sxcol){
for(i=xxcol;i<=sxcol;i++)
printf("%d\n",a[xxrow][i]);
break;
}
else if(xxcol==sxcol&&xxrow<sxrow){
for(i=xxrow;i<=sxrow;i++)
printf("%d\n",a[i][xxcol]);
break;
}
if(xxcol>sxcol||xxrow>sxrow)
break;
for(i=xxcol;i<=sxcol-1;i++)
printf("%d\n",a[xxrow][i]);
for(i=xxrow;i<=sxrow-1;i++)
printf("%d\n",a[i][sxcol]);
for(i=sxcol;i>=xxcol+1;i--)
printf("%d\n",a[sxrow][i]);
for(i=sxrow;i>=xxrow+1;i--)
printf("%d\n",a[i][xxcol]);
xxrow++;
xxcol++;
sxrow--;
sxcol--;
}
return 0;
} |
46 | 22524 | int main(){
int m,n,sz[100][100],x,y,z,f,g,w,k;
scanf("%d %d",&m,&n);
for(int p=0;p<m;p++){
for(int q=0;q<n;q++){
scanf("%d",&sz[p][q]);
}
}
for( x=0;x<m/2&&x<n/2;x++){
for( y=x;y<n-1-x;y++){
printf("%d\n",sz[x][y]);
}
for( z=x;z<m-1-x;z++){
printf("%d\n",sz[z][y]);
}
for( f=n-1-x;f>x;f--){
printf("%d\n",sz[z][f]);
}
for( g=m-1-x;g>x;g--){
printf("%d\n",sz[g][f]);
}
}
if(m%2==1&&n>=m){
w=m/2;
for(k=w;k<n-w;k++){
printf("%d\n",sz[w][k]);
}
}
else if(n%2==1&&m>n){
w=n/2;
for(k=w;k<m-w;k++){
printf("%d\n",sz[k][w]);
}
}
return 0;
} |
46 | 22525 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int array[100][100];
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
int k,r,sum;
sum=row*col;
r=-1;
while(r<10000)
{
if(sum==1)
{
printf("%d",array[r+1][r+1]);
sum--;
}
if(sum==0)
{
break;
}
r++;
if(col>1)
{
for(k=r;k<col-1;k++)
{
printf("%d\n",array[r][k]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
if(row>1)
{
for(k=r;k<row-1;k++)
{
printf("%d\n",array[k][col-1]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
if(col>1)
{
for(k=col-1;k>r;k--)
{
printf("%d\n",array[row-1][k]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
if(row>1)
{
for(k=row-1;k>r;k--)
{
printf("%d\n",array[k][r]);
sum--;
if(sum==0)
{
break;
}
}
}
if(sum==0)
{
break;
}
col--;
row--;
}
return 0;
}
|
46 | 22526 | int main()
{
int i,j,r,c,rs,cs;
int Shuzu[row][col];
scanf("%d %d",&r,&c);
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&Shuzu[i][j]);
}
}
/*printf("%d\n",Shuzu[0][0]);*/
for(i=rs=0,j=cs=0;;){
if(Shuzu[i][j]==0) break;
printf("%d\n",Shuzu[i][j]);
Shuzu[i][j]=0;
if(i==rs&&j<c-1&&j>cs-1){j++;}
else if(i==rs&&j==c-1){i++;r--;}
else if(i<r&&i>rs&&j==c-1){i++;}
else if(i==r&&j==c-1){j--;cs++;}
else if(i==r&&j>cs-1&&j<c-1){j--;}
else if(i==r&&j==cs-1){i--;rs++;}
else if(i>rs&&i<r&&j==cs-1){i--;}
else if(i==rs&&j==cs-1){j++;c--;}
}
return 0;
} |
46 | 22527 | int main()
{
int u[100][100];
int m,n,i,j,x,y,k;
scanf("%d",&m);scanf("%d",&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&(u[i][j]));
}
}
y=(m<n)?m:n;
x=y/2;
if(y%2==0){
for(k=0;k<x;k++){
for(j=k;j<=n-2-k;j++){
i=k;
printf("%d\n",u[i][j]);
}
for(i=k;i<=m-2-k;i++){
j=n-1-k;
printf("%d\n",u[i][j]);
}
for(j=n-1-k;j>=k+1;j--){
i=m-1-k;
printf("%d\n",u[i][j]);
}
for(i=m-1-k;i>=k+1;i--){
j=k;
printf("%d\n",u[i][j]);
}
}
}
else{
for(k=0;k<x;k++){
for(j=k;j<=n-2-k;j++){
i=k;
printf("%d\n",u[i][j]);
}
for(i=k;i<=m-2-k;i++){
j=n-1-k;
printf("%d\n",u[i][j]);
}
for(j=n-1-k;j>=k+1;j--){
i=m-1-k;
printf("%d\n",u[i][j]);
}
for(i=m-1-k;i>=k+1;i--){
j=k;
printf("%d\n",u[i][j]);
}
}
if(m<=n){
for(j=x;j<=n-1-x;j++){
printf("%d\n",u[x][j]);
}
}
if(m>n){
for(i=x;i<=m-1-x;i++){
printf("%d\n",u[i][x]);
}
}
}
return 0;
} |
46 | 22528 | 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 | 22529 | //????????
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 | 22530 | int main(){
int row,col;
scanf("%d %d",&row,&col);
int array[100][100];
int i,j;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d" ,&array[i][j]);
}
}
int n,N;
int time=0;
int m1,m2;
m1=(int)ceil(1.0*row/2);
m2=(int)ceil(1.0*col/2);
if(m1<m2){
N=m1;
}
else{
N=m2;
}
for(n=0;n<N;n++){
for(j=n;j<col-n;j++){
if(time<row*col){
printf("%d\n",array[n][j]);
time++;
}
}
for(i=n+1;i<row-n;i++){
if(time<row*col){
printf("%d\n",array[i][col-n-1]);
time++;
}
}
for(j=col-n-2;j>=n;j--){
if(time<row*col){
printf("%d\n",array[row-n-1][j]);
time++;
}
}
for(i=row-n-2;i>n;i--){
if(time<row*col){
printf("%d\n",array[i][n]);
time++;
}
}
}
return 0;
} |
46 | 22531 | int main(void)
{
int m,n,i,j,k,t=0,a[101][101]={0},x[4]={0,1,0,-1},y[4]={1,0,-1,0};
cin>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];
i=1,j=0,k=0;
while(a[i+x[k]][j+y[k]]!=0)
{
cout<<a[i+x[k]][j+y[k]];
t++;
a[i+x[k]][j+y[k]]=0;
if(t<m*n) cout<<endl;
i+=x[k],j+=y[k];
if(a[i+x[k]][j+y[k]]==0) k=(k+1)%4;
}
}
|
46 | 22532 | int main()
{
int array[200][200],row,col,i,j,cnt = 0,sum = 0;
cin >> row >> col;
for (i = 0;i < row;i++)
for (j = 0;j < col;j++)
{
cin >> array[i][j];
}
i = 0;
j = 0;
while (cnt < row * col)
{
for (;j <= col - 1 - sum;j++)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
j--;
i++;
for (;i <= row - 1 - sum;i++)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
i--;
j--;
for (;j >= sum;j--)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
i--;
j++;
for (;i > sum;i--)
{
cnt++;
if (cnt <= row * col)
cout << array[i][j] << endl;
else
break;
}
i++;
j++;
sum++;
}
return 0;
}
|
46 | 22533 | int main(){
int a,b=0,b1=0,c,d,e,f,g,i,k,t,raw,col,x,y;
int array[100][100];
scanf("%d %d",&raw,&col);
c=raw*col;
for(i=0;i<raw;i++){
for(t=0;t<col;t++){
scanf("%d",&a);
array[i][t]=a;
}
}
for(i=0;b<c;i++){
for(t=i;t<col-i;t++){
if(b<c){
printf("%d\n",array[i][t]);
}
b=b+1;
}
for(e=i+1;e<raw-i;e++){
if(b<c){
printf("%d\n",array[e][col-i-1]);
}
b=b+1;
}
for(f=col-2-i;f>=i;f--){
if(b<c){
printf("%d\n",array[raw-1-i][f]);
}
b=b+1;
}
for(g=raw-2-i;g>i;g--){
if(b<c){
printf("%d\n",array[g][i]);
}
b=b+1;
}
}
scanf("%d\n",&array[x][y]);
return 0;
}
|
46 | 22534 | void main()
{
int m,n,i,j,min=1;
int a[100][100];
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
if(m>n) min=n;
else min=m;
for(i=0;i<min;i++)
{
for(j=0;j<n;j++)
{
if(a[i][j]>-1000)
{
printf("%d\n",a[i][j]);
a[i][j]=-10000;
}
else continue;
}
for(j=0;j<m;j++)
{
if(a[j][n-1-i]>-1000)
{
printf("%d\n",a[j][n-1-i]);
a[j][n-1-i]=-10000;
}
else continue;
}
for(j=n-1;j>=0;j--)
{
if(a[m-1-i][j]>-1000)
{
printf("%d\n",a[m-1-i][j]);
a[m-1-i][j]=-10000;
}
else continue;
}
for(j=m-1;j>=0;j--)
{
if(a[j][i]>-1000)
{
printf("%d\n",a[j][i]);
a[j][i]=-10000;
}
else continue;
}
}
} |
46 | 22535 | 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 | 22536 | int a[102][102];
int flag[102][102];
int row;
int col;
int go(int f,int i,int j,int count)
{
if(count!=col*row)
{ cout<<a[i][j]<<endl;
flag[i][j]=1;
if(f==0)
{
if(flag[i][j+1]==0)
go(f,i,j+1,count+1);
else go((f+1)%4,i+1,j,count+1);
}
if(f==1)
{
if(flag[i+1][j]==0)
go(f,i+1,j,count+1);
else go((f+1)%4,i,j-1,count+1);
}
if(f==2)
{
if(flag[i][j-1]==0)
go(f,i,j-1,count+1);
else go((f+1)%4,i-1,j,count+1);
}
if(f==3)
{
if(flag[i-1][j]==0)
go(f,i-1,j,count+1);
else
go((f+1)%4,i,j+1,count+1);
}
}
return 0;
}
int main()
{
int i;
int j;
cin>>row>>col;
int turn=0;
for(i=1;i<=row;i++)
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
for(i=0;i<=col+1;i++)
{
flag[0][i]=1;
flag[row+1][i]=1;
}
for(i=0;i<=row+1;i++)
{
flag[i][0]=1;
flag[i][col+1]=1;
}
go(0,1,1,0);
} |
46 | 22537 | 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 | 22538 | void main()
{
int num=0,firh=0,lash,firl=0,lasl,i,j,row,col,a[105][105];
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
lash=row-1;lasl=col-1;
while(num<=(row*col))
{
for(i=firl;i<=lasl;i++)
{printf("%d\n",a[firh][i]);num++;}
if(num==row*col) break;
firh++;
for(i=firh;i<=lash;i++)
{printf("%d\n",a[i][lasl]);num++;}
if(num==row*col) break;
lasl--;
for(i=lasl;i>=firl;i--)
{printf("%d\n",a[lash][i]);num++;}
if(num==row*col) break;
lash--;
for(i=lash;i>=firh;i--)
{printf("%d\n",a[i][firl]);num++;}
if(num==row*col) break;
firl++;
}
} |
46 | 22539 |
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 | 22540 | int main(){
int row,col,m,n;
int sz[105][105],e[105][105];
scanf("%d %d",&m,&n);
for(row=0;row<m;row++){
for(col=0;col<n;col++){
scanf("%d",&sz[row][col]);
}
}
while(m>0&&n>0){
if(m>1&&n>1){
for(col=0;col<n;col++){
printf("%d\n",sz[0][col]);
}
for(row=1;row<m;row++){
printf("%d\n",sz[row][n-1]);
}
for(col=n-2;col>=0;col--){
printf("%d\n",sz[m-1][col]);
}
for(row=m-2;row>=1;row--){
printf("%d\n",sz[row][0]);
}
for(row=0;row<m;row++){
for(col=0;col<n;col++){
e[row][col]=sz[row][col];
}
}
}else if(m==1){
for(col=0;col<n;col++){
printf("%d\n",sz[0][col]);
}
}else{
for(row=0;row<m;row++){
printf("%d\n",sz[row][0]);
}
}
m-=2;
n-=2;
for(row=0;row<m;row++){
for(col=0;col<n;col++){
sz[row][col]=e[row+1][col+1];
}
}
}
return 0;
} |
46 | 22541 | int main()
{
int array[100][100],row,col,i,k,j,t=0;
scanf("%d%d",&row,&col);
int m=row*col;
for(i=0;i<row;i++)
{
for(k=0;k<col;k++)
{
scanf("%d",&array[i][k]);
}
}
for(j=0;;j++)
{
for(k=j;k<=col-1-j;k++)
{
printf("%d\n",array[j][k]);
t++;
}
if(t==m) break;
for(i=j+1;i<=row-1-j;i++)
{
printf("%d\n",array[i][col-j-1]);
t++;
}
if(t==m) break;
for(k=col-j-2;k>=j;k--)
{
printf("%d\n",array[row-j-1][k]);
t++;
}
if(t==m) break;
for(i=row-j-2;i>j;i--)
{
printf("%d\n",array[i][j]);
t++;
}
if(t==m) break;
}
return 0;
} |
46 | 22542 | 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 | 22543 | 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 | 22544 | int a[105][105];
int main()
{
int m,n;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int inow=1,jnow=1;
int f=0;
cin>>m>>n;
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
while(1){
cout<<a[inow][jnow]<<endl;
a[inow][jnow]=0;
if(a[inow+dx[f]][jnow+dy[f]]>0){
inow=inow+dx[f];
jnow=jnow+dy[f];
}
else{
f=(f+1)%4;
if(a[inow+dx[f]][jnow+dy[f]]==0)
break;
else{
inow=inow+dx[f];
jnow=jnow+dy[f];
}
}
}
return 0;
} |
46 | 22545 | 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 | 22546 | //============================================================================
// 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 | 22547 | int main()
{
int row,col,r,c;
int i,j,times;
int x,y;
int a[120][120];
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
for(j=1;j<=col;j++)
scanf("%d",&a[i][j]);
r=row;
c=col;
times=0;
x=1;
y=0;
while(times<r*c)
{
if(col!=0)
{
for(i=1;i<=col;i++)
{
printf("%d\n",a[x][y+i]);
times++;
}
y+=col;
row--;
if(times==r*c)
col=row=0;
}
if(row!=0)
{
for(i=1;i<=row;i++)
{
printf("%d\n",a[x+i][y]);
times++;
}
x+=row;
col--;
if(times==r*c)
col=row=0;
}
if(col!=0)
{
for(i=1;i<=col;i++)
{
printf("%d\n",a[x][y-i]);
times++;
}
y-=col;
row--;
if(times==r*c)
col=row=0;
}
if(row!=0)
{
for(i=1;i<=row;i++)
{
printf("%d\n",a[x-i][y]);
times++;
}
x-=row;
col--;
if(times==r*c)
col=row=0;
}
}
return 0;
}
|
46 | 22548 | int main()
{
int a[100][100],n,m,i,j,k,p,q,sum=0;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
scanf("%d",&a[i][j]);
}
}
p=(n-1)/2;
q=(m-1)/2;
for(k=0;k<=p&&k<=q;k++)
{
for(i=k,j=k;j<m-k;j++)
{
sum++;
printf("%d\n",a[i][j]);
if(sum==n*m)
{
goto end;
}
}
for(j=m-1-k,i=k+1;i<n-k;i++)
{
sum++;
printf("%d\n",a[i][j]);
if(sum==n*m)
{
goto end;
}
}
for(i=n-1-k,j=m-k-2;j>=k;j--)
{
sum++;
printf("%d\n",a[i][j]);
if(sum==n*m)
{
goto end;
}
}
for(j=k,i=n-k-2;i>=k+1;i--)
{
sum++;
printf("%d\n",a[i][j]);
if(sum==n*m)
{
goto end;
}
}
}
end:
return 0;
}
|
46 | 22549 |
int main(){
int row,col,r,c,a[100][100],s,n;
scanf("%d%d",&row,&col);
s=0;
for(r=0;r<row;r++){
for(c=0;c<col;c++){
scanf("%d",&a[r][c]);
}
}for(n=0;n<100;n++){
for(c=n;c<col-n;c++){
printf("%d\n",a[n][c]);
s++;
}
printf("\n");
if(s==row*col){
break;
}for(r=n+1;r<row-n;r++){
printf("%d\n",a[r][col-1-n]);
s++;
}printf("\n");
if(s==row*col)
break;
for(c=col-2-n;c>=n;c--){
printf("%d\n",a[row-1-n][c]);
s++;
}
printf("\n");
if(s==row*col)
break;
for(r=row-2-n;r>n;r--){
printf("%d\n",a[r][n]);
s++;
}printf("\n");
if(s==row*col){
break;
}
}
return 0;
} |
46 | 22550 | 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 | 22551 |
int main()
{
int i,j,h,l,x,y,k;
int a[hang][lie];
scanf("%d %d",&h,&l);
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d",&a[i][j]);
}
}
k=0;
x=0;
i=0;
while(k<(h*l)){
for(j=x;j<l;j++){
printf("%d\n",a[i][j]);
k++;
a[i][j]=-1;
y=j;
if(a[i][j+1]==-1){
break;
}
}
if(k==(h*l)){
break;
}
for(i=x+1;i<h;i++){
printf("%d\n",a[i][y]);
k++;
a[i][y]=-1;
x=i;
if(a[i+1][y]==-1){
break;
}
}
if(k==(h*l)){
break;
}
for(j=y-1;j>=0;j--){
printf("%d\n",a[x][j]);
k++;
a[x][j]=-1;
y=j;
if(a[x][j-1]==-1){
break;
}
}
if(k==(h*l)){
break;
}
for(i=x-1;i>=0;i--){
printf("%d\n",a[i][y]);
k++;
a[i][y]=-1;
x=i;
if(a[i-1][y]==-1){
break;
}
}
if(k==(h*l)){
break;
}
}
return 0;
}
|
46 | 22552 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int array[100][100];
for(int rr=0;rr<row;rr++){
for(int cc=0;cc<col;cc++){
scanf("%d",&array[rr][cc]);
}
}
for(int t=1;t<100;t++){
int leftc=t-1;
int rightc=col-t;
if(leftc<=rightc){
if(leftc==rightc){
}
for(int c=leftc;c<=rightc;c++){
if(c==0){
printf("%d",array[0][0]);
}else{
printf("\n%d",array[t-1][c]);
}
}
}else{
break;
}
int upr=t;
int downr=row-1-t;
if(upr<=downr){
for(int r=upr;r<=downr;r++){
printf("\n%d",array[r][col-t]);
}
}
if(upr-downr>=2){
break;
}
if(leftc<=rightc){
for(int c=rightc;c>=leftc;c--){
printf("\n%d",array[row-t][c]);
}
}
if(leftc==rightc){
break;
}
if(upr<=downr){
for(int r=downr;r>=upr;r--){
printf("\n%d",array[r][t-1]);
}
}
}
return 0;
} |
46 | 22553 | 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 | 22554 | int main(){
int a[100][100],n,m,i,j,m1,m2,n1,n2,k;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&a[i][j]);
}
}
k=0;
m1=0;
m2=m-1;
n1=0;
n2=n-1;
loop:
for(j=m1;j<=m2;j++){
printf("%d\n",a[n1][j]);
k=k+1;
if(k==n*m){
goto end;
}
}
m2=m2-1;
for(i=n1+1;i<=n2;i++){
printf("%d\n",a[i][m2+1]);
k=k+1;
if(k==n*m){
goto end;
}
}
n2=n2-1;
for(j=m2;j>=m1;j--){
printf("%d\n",a[n2+1][j]);
k=k+1;
if(k==n*m){
goto end;
}
}
m1=m1+1;
for(i=n2;i>n1;i--){
printf("%d\n",a[i][m1-1]);
k=k+1;
if(k==n*m){
goto end;
}
}
n1=n1+1;
goto loop;
end:
return 0;
} |
46 | 22555 |
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 | 22556 |
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 | 22557 | int main()
{
int row,col;
int time=0;
int i,j;
int a[100][100];
int x1,x2,y1,y2;
scanf("%d %d",&row,&col);
x1=y1=1;
x2=row;
y2=col;
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
scanf("%d",&a[i][j]);
}
while(time<row*col)
{
for(i=y1;i<=y2;i++)
{
if (time==row*col) break;
printf("%d\n",a[x1][i]);
time++;
}
for(i=x1+1;i<=x2;i++)
{
if(time==row*col) break;
printf("%d\n",a[i][y2]);
time++;
}
for(i=y2-1;i>=y1;i--)
{
if(time==row*col) break;
printf("%d\n",a[x2][i]);
time++;
}
for(i=x2-1;i>=x1+1;i--)
{
if(time==row*col) break;
printf("%d\n",a[i][y1]);
time++;
}
x1++;
x2--;
y2--;
y1++;
}
return 0;
} |
46 | 22558 | void spread(int A[100][100],int M,int N)
{
int i;
int j=0;
int t[400]={0};
if(M==1&&N==1)
printf("%d\n",A[0][0]);
else
{
if(M==1)
for(i=0;i<N;i++)
{
t[j]=A[0][i];
j=j+1;
}
else if(N==1)
for(i=0;i<M;i++)
{
t[j]=A[i][0];
j=j+1;
}
else
{
for(i=0;i<N-1;i++)
{
t[j]=A[0][i];
j=j+1;
}
for(i=0;i<M-1;i++)
{
t[j]=A[i][N-1];
j=j+1;
}
for(i=N-1;i>0;i--)
{
t[j]=A[M-1][i];
j=j+1;
}
for(i=M-1;i>0;i--)
{
t[j]=A[i][0];
j=j+1;
}
}
for(i=0;i<j;i++)
printf("%d\n",t[i]);
}
}
void main()
{
int i,j,s;
int r,c;
int k;
int a[100][100];
scanf("%d%d",&r,&c);
k=r<c?r:c;
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
for(i=1;((r>0)&&(c>0));i++)
{
spread(a,r,c);
r=r-2;
c=c-2;
for(s=0;s<r;s++)
for(j=0;j<c;j++)
a[s][j]=a[s+1][j+1];
}
} |
46 | 22559 |
int main()
{
int a[101][101];
int row, col, i, j, k, h, counter = 0, mul;
cin >> row >> col;
mul = row * col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
if (col % 2 == 0)
h = col / 2;
else
h = col / 2 + 1;
for (k = 0; k < h; k++)
{
for (i = k, j = k; j < col - k; j++)
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
j--;
for (i = 1 + k; i < row - k; i++)
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
i--;
for (j = col - 2 - k; j >= k; j--)
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
j++;
for (i = row - 2 - k; i > k; i-- )
{
if (counter < mul)
cout << a[i][j] << endl;
counter++;
}
i++;
}
return 0;
}
|
46 | 22560 | void main()
{
int row,col,i,j,a[100][100],t,k=0,m=1,c,u;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
i=0;
j=0;
if(col<row)t=2*col+1;
else t=2*row;
u=t;
for(;t!=1;t--)
{
if(t%4==u%4)
{
for(c=col-k;c!=0;j++)
{
printf("%d\n",a[i][j]);
c--;
}
k++;
j--;
i++;
}
else if(t%4==(u-1)%4)
{
for(c=row-m;c!=0;i++)
{
printf("%d\n",a[i][j]);
c--;
}
m++;
i--;
j--;
}
else if(t%4==(u-2)%4)
{
for(c=col-k;c!=0;j--)
{
printf("%d\n",a[i][j]);
c--;
}
k++;
j++;
i--;
}
else if(t%4==(u-3)%4)
{
for(c=row-m;c!=0;i--)
{
printf("%d\n",a[i][j]);
c--;
}
m++;
i++;
j++;
}
}
}
|
46 | 22561 | int a[100][100];
void shuchu(int e,int b,int row,int col,int c)
{
int i,j;
if(e==0||b==0) ;
else if(e==1&&b==1)
{
printf("%d\n",a[c][c]);
}
else if(e==1&&b!=1)
{
for(j=c;j<col-c;j++)
printf("%d\n",a[c][j]);
}
else if(e!=1&&b==1)
{
for(j=c;j<row-c;j++)
printf("%d\n",a[j][c]);
}
else
{
for(i=c;i<col-c;i++)
printf("%d\n",a[c][i]);
for(i=c+1;i<row-c;i++)
printf("%d\n",a[i][col-c-1]);
for(i=col-c-2;i>=c;i--)
printf("%d\n",a[row-c-1][i]);
for(i=row-c-2;i>c;i--)
printf("%d\n",a[i][c]);
shuchu(e-2,b-2,row,col,c+1);
}
}
int main()
{
int 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]);
}
}
shuchu(row,col,row,col,0);
return 0;
} |
46 | 22562 | /*
* CR.cpp
*
* Created on: 2012-11-15
* Author: sony
*/
int a,b;
int x[101][101];
int p;
int sum;
void read(int start,int a,int b)
{
int v,h;
int i;
v = start;h = start;
if (a == 0 || b == 0)return;
if (a == 1 && b == 1){cout <<x[v][h] <<endl;return;}
for (i = 1;i <= b-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
h ++;
}
for (i = 1;i <= a-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
v ++;
}
for (i = 1;i <= b-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
h --;
}
for (i = 1;i <= a-1;i ++)
{
cout <<x[v][h]<<endl;
sum ++;
if (sum == p)return;
v --;
}
read(v+1,a-2,b-2);
}
int main()
{
int j,r;
sum = 0;
cin >>a >>b;
p = a*b;
for (j = 1;j <= a;j ++)
for (r = 1;r <= b;r ++)
cin >>x[j][r];
read(1,a,b);
return 0;
} |
46 | 22563 | //???? ??? 12858
int main()
{
int i,j,c,dirx,diry,x,y,row,col,step; //dirx,diry???? x,y????? step????????
int a[101][101],b[101][101]; //a??????,b??????????
cin >> row >> col;
for (i = 1;i <= row; i++)
for (j = 1;j <= col; j++)
{
cin >> a[i][j];
b[i][j] = 1;
}
x = 1;y = 0;dirx = 0;diry = 1; //??????????
step = 0;
while (step < (col * row))
{
while (b[x + dirx][y + diry] == 1) //?????
{
x += dirx;y += diry;
b[x][y] = 0;
step++;
cout << a[x][y] << endl;
}
if ((dirx == 1) && (diry == 0)) //???????
{
dirx = 0;diry = -1;
}
else
if ((dirx == 0) && (diry == 1))
{
dirx = 1;diry = 0;
}
else
if ((dirx == -1) && (diry == 0))
{
dirx = 0;diry = 1;
}
else if ((dirx == 0) && (diry == -1))
{
dirx = -1;diry = 0;
}
}
return 0;
}
|
46 | 22564 | 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 | 22565 | /**
* @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 | 22566 | 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 | 22567 | 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 | 22568 | /**
* @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 | 22569 | int main(){
int tt[100][100];
int r,c;
scanf("%d%d",&r,&c);
for(int x=0;x<r;x++){
for(int y=0;y<c;y++){
scanf("%d",&tt[x][y]);
}
}
int i1=0,i2=c-1,i3=r-1,i4=0,m1=0,m2=1,m3=c-2,m4=r-2,n1=c-1,n2=r-1,n3=0,n4=1,j,s=0,a=1;
while(1){
for(j=m1;j<=n1&&a==1;j++){
printf("%d\n",tt[i1][j]);
s+=1;
if(s==r*c){a=0;}
}
m1++;n1--;i1++;
for(j=m2;j<=n2&&a==1;j++){
printf("%d\n",tt[j][i2]);
s+=1;
if(s==r*c){a=0;}
}
m2++;n2--;i2--;
for(j=m3;j>=n3&&a==1;j--){
printf("%d\n",tt[i3][j]);
s+=1;
if(s==r*c){a=0;}
}
m3--;n3++;i3--;
for(j=m4;j>=n4&&a==1;j--){
printf("%d\n",tt[j][i4]);
s+=1;
if(s==r*c){a=0;}
}
m4--;n4++;i4++;
if(a==0){break;}
}
return 0;
} |
46 | 22570 | 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 | 22571 | int main()
{
int sz[100][100],i,j,h,l,zs=0,ys,yx,n,k=0;
scanf("%d %d",&h,&l);
ys=l-1;
yx=h-1;
n=h*l;
for(i=0;i<h;i++)
for(j=0;j<l;j++)
scanf("%d",&sz[i][j]);
while(k!=-1)
{
for(i=zs,j=zs;j<=ys;j++)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
for(j=ys,i=zs+1;i<=yx;i++)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
for(i=yx,j=ys-1;j>=zs;j--)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
for(i=yx-1,j=zs;i>zs;i--)
{printf("%d\n",sz[i][j]);k++;if(k==n)return 0;}
zs++;ys--;yx--;
if(k==n)return 0;
}
return 0;
} |
46 | 22572 |
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 | 22573 | 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 | 22574 | 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 | 22575 | // *****************************************************************************
//*????????????.cpp
//*??;1300012725
//*?????2013.11
//*?????????????
//******************************************************************************
int main()
{
int a[200][200];
int r, c, i, j, p; //i,j?????????????????????p??????
cin >> r >> c;
for( i = 1; i <= r; i++ )
{
for( j = 1; j <= c; j++ )
{
cin >> a[i][j]; //??????
}
}
i = 1;
j = 1;
while( i <= r && j <= c )
{
for( p = j; p <= c; p++ )
{
cout << a[i][p] << endl; //??????????
}
for( p = i+1; p <= r;p++ )
{
cout << a[p][c] << endl; //??????????
}
for( p = c-1; p >= j && i != r && j != c; p-- )
{
cout << a[r][p] << endl; //??????????
}
for( p = r-1; p > i && i != r && j != c; p-- )
{
cout << a[p][j] << endl; //??????????
}
i++;
j++;
r--;
c--; //???????
}
return 0;
}
|
46 | 22576 | struct node
{
int over;
int data;
};
void main()
{
int row,col,i,j,point=1,heng=0,zong=0;
struct node x[102][102];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&x[i][j].data);
x[i][j].over=1;
}
}
printf("%d\n",x[0][0].data);
x[0][0].over=0;
for(i=1;i<(row*col);)
{
if(point%4==1)
{
if(x[heng][zong+1].over==1&&(zong+1)<col)
{
zong++;
printf("%d\n",x[heng][zong].data);
x[heng][zong].over=0;
i++;
}
else
point++;
}
if(point%4==2)
{
if(x[heng+1][zong].over==1&&(heng+1)<row)
{
heng++;
printf("%d\n",x[heng][zong].data);
x[heng][zong].over=0;
i++;
}
else
point++;
}
if(point%4==3)
{
if(x[heng][zong-1].over==1&&(zong-1)>=0)
{
zong--;
printf("%d\n",x[heng][zong].data);
x[heng][zong].over=0;
i++;
}
else
point++;
}
if(point%4==0)
{
if(x[heng-1][zong].over==1&&(heng-1)>=0)
{
heng--;
printf("%d\n",x[heng][zong].data);
x[heng][zong].over=0;
i++;
}
else
point++;
}
}
} |
46 | 22577 | int main()
{
int row,col,i,j,d=0,count=0;
int de[]={0,1,2,3};
scanf("%d%d",&row,&col);
int a[row][col],b[row][col];
for(i=0;i<row;i++)
{
for(j=0;j<col;j++){scanf("%d",&a[i][j]);b[i][j]=1;}
}
i=0;j=0;
for(count=0;count<row*col;count++)
{
printf("%d\n",a[i][j]);
b[i][j]=0;
switch(de[d])
{
case 0: j++;break;
case 1: i++;break;
case 2: j--;break;
case 3: i--;break;
}
if(i<0||i>=row||j<0||j>=col||b[i][j]==0)
{
switch(de[d])
{
case 0: j--;i++;break;
case 1: i--;j--;break;
case 2: j++;i--;break;
case 3: i++;j++;break;
}
d=(d+1)%4;
}
}
return 0;
} |
46 | 22578 | //********************************
//*???2.???????? **
//*?????? 1300017623 **
//*???2013.11.1 **
//********************************
int main()
{
int a[100][100];
int row, col, i, j;
cin >> row >> col;
int i1 = 0, i2 = row - 1, j1 = 0, j2 = col - 1;
for (i = 0; i < row ; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
while (1)
{
for (j = j1; j <= j2; j++)
cout << a[i1][j] << endl;
i1++;
if (i1 > i2)
break;
for (i = i1; i <= i2; i++)
cout << a[i][j2] << endl;
j2--;
if (j1 > j2)
break;
for (j = j2; j >= j1; j--)
cout << a[i2][j] << endl;
i2--;
if (i1 > i2)
break;
for (i = i2; i >= i1; i--)
cout << a[i][j1] << endl;
j1++;
if(i1 > i2)
break;
}
return 0;
} |
46 | 22579 | 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 | 22580 | 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 | 22581 | int main()
{
int a[100][100],m,n,i,j,s=0;
int (*p)[100];
p=a;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{ for(j=0;j<n;j++)
scanf("%d",&a[i][j]);}
for(i=0;(i<(m+1)/2)&&(i<(n+1)/2);i++)
{
for(j=i;j<n-i;j++)
{
if(s<n*m)
printf("%d",*(*(p+i)+j));
if(s<n*m-1)
printf("\n");
s++;
}
for(j=i+1;j<m-i;j++)
{
if(s<n*m)
printf("%d",*(*(p+j)+n-1-i));
if(s<n*m-1)
printf("\n");
s++;
}
for(j=n-i-2;j>=i;j--)
{
if(s<n*m)
printf("%d",*(*(p+m-1-i)+j));
if(s<n*m-1)
printf("\n");
s++;
}
for(j=m-i-2;j>i;j--)
{
if(s<n*m)
printf("%d",*(*(p+j)+i));
if(s<n*m-1)
printf("\n");
s++;
}
}
return 0;
}
|
46 | 22582 | int main()
{
int a[100][100],i,j,n,m,flag[100][100]={0},k=0,l=0,num=0,sign=1;
cin>>n>>m;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>a[i][j];
}
}
while(num<m*n)
{
cout<<a[k][l]<<endl;
flag[k][l]=1;
num++;
if(sign==1)
{
if(l!=m-1&&flag[k][l+1]==0)
{
l++;
}
else
{
sign=2;
k++;
continue;
}
}
if(sign==2)
{
if(k!=n-1&&flag[k+1][l]==0)
{
k++;
}
else
{
sign=3;
l--;
continue;
}
}
if(sign==3)
{
if(l!=0&&flag[k][l-1]==0)
{
l--;
}
else
{
sign=4;
k--;
continue;
}
}
if(sign==4)
{
if(m!=0&&flag[k-1][l]==0)
{
k--;
}
else
{
sign=1;
l++;
continue;
}
}
}
return 0;
} |
46 | 22583 |
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 | 22584 | int main()
{
int a[100][100]={0},row,col,i=0,j=0,t=0,s=0,isRow,isCol;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
i=0;
j=0;
do
{
for(j=t;j<col-t;j++)
printf("%d\n",a[i][j]);
j-=1;
isRow = 0;
for(i=s+1;i<row-s;i++)
{
printf("%d\n",a[i][j]);
isRow = 1;
}
if( isRow== 0 ) break;
i-=1;
t+=1;
isCol = 0;
for(j=col-t-1;j>=s;j--)
{
printf("%d\n",a[i][j]);
isCol = 1;
}
if( isCol== 0 ) break;
j+=1;
s+=1;
for(i=row-s-1;i>=t;i--)
printf("%d\n",a[i][j]);
i+=1;
}
while(t!=col && s!=row);
return 0;
} |
46 | 22585 |
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 | 22586 |
int main()
{
int i,j,m,n,r,c,k,sz[100][100],time=0;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&sz[i][j]);
}
}
for(i=0,j=0,m=r-1,n=c-1;i<=m&&j<=n;i++,j++,m--,n--){
for(k=j;k<=n;k++){
printf("%d\n",sz[i][k]);
time+=1;
}
if(time==r*c)break;
for(k=i+1;k<=m;k++){
printf("%d\n",sz[k][n]);
time+=1;
}
if(time==r*c)break;
for(k=n-1;k>=j;k--){
printf("%d\n",sz[m][k]);
time+=1;
}
if(time==r*c)break;
for(k=m-1;k>=i+1;k--){
printf("%d\n",sz[k][j]);
time+=1;
}
if(time==r*c)break;
}
return 0;
} |
46 | 22587 | 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 | 22588 | 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 | 22589 | 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 | 22590 | 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 | 22591 | int main(){
int m,n,x,y,c,d,e,f,g;
int a[100][100];
scanf("%d %d",&n,&m);
g=m*n;
c=0;
d=0;
e=0;
f=0;
for(y=0;y<n;y++){
for(x=0;x<m;x++){
scanf("%d",&a[x][y]);
}
}
while(g!=0){
if(g!=0){
if(c+d!=m-1){
for(x=c;x<m-d;x++){
printf("%d\n",a[x][e]);
g--;
}
e++;
}else{
printf("%d\n",a[c][e]);
g--;
e++;
}
}
if(g!=0){
if(e+f!=n-1){
for(y=e;y<n-f;y++){
printf("%d\n",a[m-d-1][y]);
g--;
}
d++;
}else{
printf("%d\n",a[m-d-1][e]);
d++;
g--;
}
}
if(g!=0){
if(c+d!=m-1){
for(x=m-d-1;x>=c;x--){
printf("%d\n",a[x][n-f-1]);
g--;
}
f++;
}else{
printf("%d\n",a[c][n-f-1]);
g--;
f++;
}
}
if(g!=0){
if(e+f!=n-1){
for(y=n-f-1;y>=e;y--){
printf("%d\n",a[c][y]);
g--;
}
c++;
}else{
printf("%d\n",a[c][e]);
c++;
g--;
}
}
}
return 0;
} |
46 | 22592 | /*????????
* bookfee.cpp
*
* Created on: 2011-12-23
* Author: WJ
*/
int main() {
int a[101][101], i, j, row, col;
cin >> row >> col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> a[i][j];
int up = 0, down = row - 1, left = 0, right = col - 1; //??????????
int c = row * col;//????????????????
while (c > 0) {
for (j = left; j <= right; j++) {
cout << a[up][j] << endl;
}
c -= right-left + 1;
if (c <= 0)
break;
up++;
for (i = up; i <= down; i++) {
cout << a[i][right] << endl;
}
c -= down - up + 1;
if (c <= 0)
break;
right--;
for (j = right; j >= left; j--) {
cout << a[down][j] << endl;
}
c -= right - left + 1;
if (c <= 0)
break;
down--;
for (i = down; i >= up; i--) {
cout << a[i][left] << endl;
}
c -= down - up + 1;
if (c <= 0)
break;
left++;
}
return 0;
}
|
46 | 22593 | 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 | 22594 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int sz[100][100];
int i,j;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int n,time=0;
i=0,j=0;
for(n=0;;n++){
for(;j<col-n;j++){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
j--;
i++;
for(;i<row-n;i++){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
i--;
j--;
for(;j>n-1;j--){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
j++;
i--;
for(;i>n;i--){
printf("%d\n",sz[i][j]);
time++;
}
if(time==row*col){
break;
}
i++;
j++;
}
return 0;
}
|
46 | 22595 | 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 | 22596 | //***************************
//**???2.cpp
//**??????
//**???2013.11.1
//**?????????????
//***************************
int main()
{
int a[100][100];
int row, col;
int n = 0; // n??????????
cin >> row >> col;
for (int i = 1; i <= row; i++)
for (int j = 1; j <= col; j++)
cin >> a[i][j];
for (int i = 1; i <= (row + 1) / 2; i++)
for (int j = i; j <= col + 1 - i; j++) // ???????
{
if (n == row * col) break; // ???????????????
cout << a[i][j] << endl;
n++; // ???????????
if (j == col + 1 - i)
for (int k = i + 1; k <= row + 1 - i; k++) // ????????????
{
if (n == row * col) break;
cout << a[k][j] << endl;
n++;
if (k == row + 1 - i)
for (int l = col - i; l >= i; l--) // ?????????????
{
if (n == row * col) break;
cout << a[k][l] << endl;
n++;
if (l == i)
for (int m = row - i; m >= 1 + i; m--) // ????????????
{
if (n == row * col) break;
cout << a[m][l] << endl;
n++;
} // ?????????????i??????????????i???????????????????
}
}
}
return 0;
} |
46 | 22597 | ///********************************
//*??????????? **
//*?????? 1300012745 **
//*???2013.11.1 **
//********************************
int main()
{
int a[100][100], row, col, i, j, //row????col????i,j????????row,col????????????????????????????????????
r, c; // r,c????????????????
cin >> row >> col;
for (i = 0; i <= row - 1; i++) //??????????????
for (j = 0; j <= col - 1; j++)
cin >> a[i][j];
r = 0;
c = -1; //??????????????????????????????????
while ((row >= 2) && (col >= 2)) //?????????2??????????????????????????????????
{
for (i = 1; i <= col; i++) //????col?????????
{
c++;
cout << a[r][c] << endl;
}
for (i = 1; i <= row - 1; i++) //??row-1????????
{
r++;
cout << a[r][c] << endl;
}
for (i = 1; i <= col - 1; i++) //???col-1
{
c--;
cout << a[r][c] << endl;
}
for (i = 1; i <= row - 2; i++) //??row-2?????????????????
{
r--;
cout << a[r][c] << endl;
}
col-=2; //???????????????2??2?
row-=2;
}
if ((row == 1) && (col != 1)) //?????????????????????????????????????????????????????
for (i = 1; i <= col; i++) //?????????
{
c++;
cout << a[r][c] << endl;
}
if ((col == 1) && (row != 1)) //???????
{
c++;
for (i = 1; i <= row; i++)
{
cout << a[r][c] << endl;
r++;
}
}
if ((row == 1) && (col == 1)) //??????????????row?col???????
cout << a[r][c+1];
cin.get();cin.get();
return 0;
}
|
46 | 22598 |
int main()
{
int row,col;
int i,j;
int matrix[100][100];
/*????*/
cin>>row>>col;
for (i=1;i<=row;i++)
{
for (j=1;j<=col;j++)
{
cin>>matrix[i][j];
}
}
/*?????*/
int k;
cout<<matrix[1][1];
for (k=2;k<=col;k++)
{
cout<<endl<<matrix[1][k];
}
/*??????*/
int xlength=col-1;
int ylength=row-1;
int t;
char flag='d';
i=1;j=col;
while ( ( (flag=='u'||flag=='d')&&(ylength!=0) )
||
( (flag=='l'||flag=='r')&&(xlength!=0) ) )
{
switch (flag)
{
case 'd':
for (t=1;t<=ylength;t++)
{
i++;
cout<<endl<<matrix[i][j];
}
flag='l';
ylength--;
break;
case 'l':
for (t=1;t<=xlength;t++)
{
j--;
cout<<endl<<matrix[i][j];
}
flag='u';
xlength--;
break;
case 'u':
for (t=1;t<=ylength;t++)
{
i--;
cout<<endl<<matrix[i][j];
}
flag='r';
ylength--;
break;
case 'r':
for (t=1;t<=xlength;t++)
{
j++;
cout<<endl<<matrix[i][j];
}
flag='d';
xlength--;
break;
}
}
return 0;
} |
46 | 22599 |
int main()
{
int n,row,col;
int i,j,a[ROW][COL]={0},time=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
/*
int width = col;
int height = row;
for ( int i = 0; i <= (row - 1) / 2; i++){
if ( height <= 0 || width <= 0 )
break;
for( int j = 0; j < width; j++)
printf("%d\n", a[i][j+i]);
if ( height == 1)
break;
for( int j = 1; j < height - 1; j++)
printf("%d\n", a[j+i][i+width-1]);
for( int j = width - 1; j >= 0; j--)
printf("%d\n", a[i+height-1][j+i]);
if( width == 1)
break;
for( int j = height - 2; j > 0; j--)
printf("%d\n", a[j+i][i]);
width -= 2;
height -= 2;
}
*/
for(n=0; n <= ( row - 1)/2;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",a[n][i]);
}
if ( 2*n +1 == row)
break;
for(i=n+1;i<row-n-1;i++)
{
printf("%d\n",a[i][col-n-1]);
}
for(j=col-n-1;j>=n;j--)
{
printf("%d\n",a[row-n-1][j]);
}
if ( 2*n +1 == col)
break;
for(j=row-n-2;j>n;j--)
{
printf("%d\n",a[j][n]);
}
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.