label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
46 | 22800 | int main()
{
int i,j,row,cow,a[100][100];
scanf("%d%d",&row,&cow);
for(i=0;i<row;i++)
{
for(j=0;j<cow;j++)
{
scanf("%d",&a[i][j]);
}
if(i!=row-1)
printf("\n");
}
i=0;
while(row-i-i>1&&cow-i-i>1)
{
for(j=i;j<cow-i;j++)
{
printf("%d\n",a[i][j]);
}
for(j=i+1;j<row-i;j++)
{
printf("%d\n",a[j][cow-i-1]);
}
for(j=cow-2-i;j>=i;j--)
{
printf("%d\n",a[row-1-i][j]);
}
for(j=row-2-i;j>=i+1;j--)
{
printf("%d\n",a[j][i]);
}
i++;
}
if(row-i-i==1)
{
for(j=i;j<cow-i;j++)
{
printf("%d\n",a[i][j]);
}
}
else if(cow-i-i==1)
{
for(j=i;j<row-i;j++)
{
printf("%d\n",a[j][i]);
}
}
return 0;
} |
46 | 22801 | int main()
{
int array[100][100], a, b, p, q, i, j, k = 1, x = 1;
cin >> a >> b;
for (i = 0; i <= a - 1; i++)
{
for (j = 0; j <= b - 1; j++)
{
cin >> array[i][j];
}
}
for (q = 0, p = b - 1; p >= 0, q <= a - 1; p--, q++)
{
for (i = b - 1 - p; i <= p; i++)
{
if (array[q][i] == -1)
{
break; k = 0;
}
cout << array[q][i] << endl << endl;
array[q][i] = -1;
}
for (i = q + 1; i <= a - 1 - q; i++)
{
if (array[i][p] == -1)
{
break; k = 0;
}
cout << array[i][p] << endl << endl;
array[i][p] = -1;
}
for (i = p - 1; i >= b - 1 - p; i--)
{
if (array[a - 1 - q][i] == -1)
{
break; k = 0;
}
cout << array[a - 1 - q][i] << endl << endl;
array[a - 1 - q][i] = -1;
}
for (i = a - 2 - q; i >= q; i--)
{
if (array[i][b - 1 - p] == -1)
{
break; k = 0;
}
cout << array[i][b - 1 - p] << endl << endl;
array[i][b - 1 - p] = -1;
}
for (i = 0; i <= a - 1; i++)
{
for (j = 0; j <= b - 1; j++)
{
if (array[i][j] != -1)
x = x * 0;
}
}
if (x == 1)
break;
x = 1;
}
return 0;
}
|
46 | 22802 | int main ()
{
int a[100][100]={0},cnt=0,i,j,row,col,l=0;
cin >> row>>col ;
cnt = row * col ;
for(i = 0 ;i < row;i++)
{
for(j = 0 ; j <col ;j++)
cin >> a[i][j] ;
}
while(cnt > 0)
{
for(j=l;j<(col-l);j++)
{
cout << a[l][j]<<endl;
cnt--;
}
if(cnt == 0) break ;
for (i=(l+1);i<row-l;i++)
{
cout << a[i][col-l-1]<<endl;
cnt--;
}
if(cnt == 0) break ;
for(j=col-l-2;j>l-1;j--)
{
cout << a[row-l-1][j]<<endl;
cnt-- ;
}
if(cnt == 0) break ;
for(i=row-l-2;i>l;i--)
{
cout << a[i][l]<<endl;
cnt--;
}
l++ ;
}
return 0 ;
}
|
46 | 22803 | int main()
{
int i,j,m,n,a[100][100];
int shang,xia,zuo,you;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&a[i][j]);
}
}
shang=0;
zuo=0;
xia=m-1;
you=n-1;
while(zuo<=you&&(shang<=xia)){
if(zuo!=you&&shang!=xia){
for(i=shang,j=zuo;j<=you;j++){
printf("%d\n",a[i][j]);
}
for(j=you,i=shang+1;i<=xia;i++){
printf("%d\n",a[i][j]);
}
for(i=xia,j=you-1;j>=zuo;j--){
printf("%d\n",a[i][j]);
}
for(i=xia-1,j=zuo;i>shang;i--){
printf("%d\n",a[i][j]);
}
}
else if(zuo==you&&shang!=xia){
for(j=zuo,i=shang;i<=xia;i++){
printf("%d\n",a[i][j]);
}
}
else if(shang==xia&&zuo!=you){
for(i=shang,j=zuo;j<=you;j++){
printf("%d\n",a[i][j]);
}
}
else if(shang==xia&&zuo==you){
i=shang;j=zuo;
printf("%d\n",a[i][j]);
}
zuo++,shang++,you--,xia--;
}
return 0;
}
|
46 | 22804 | void f(int a[100][100],int m,int p,int q)
{
int n=0,i,j,w,*pt;
w=(p+1)*(q+1);
for(j=1;;j++)
{
for(pt=&a[m][m];pt<=&a[m][p];pt++)
{ printf("%d\n",*pt); n++;}
if(n==w) break;
for(i=m+1;i<=q;i++)
{printf("%d\n",a[i][p]);n++;}
if(n==w) break;
for(pt=&a[q][p-1];pt>=&a[q][m];pt--)
{printf("%d\n",*pt);n++;}
if(n==w) break;
for(i=q-1;i>=m+1;i--)
{ printf("%d\n",a[i][m]);n++;}
if(n==w) break;
m++;
p--;
q--;
}
}
void main()
{
int row,col,i,j,a[100][100],m=0,p,q;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
p=col-1;
q=row-1;
f(a,m,p,q);
}
|
46 | 22805 | int main()
{
int hangshu, lieshu, array[101][101], i, j;
cin >> hangshu >> lieshu;
for (i = 0; i < hangshu; i++)
for (j = 0; j < lieshu; j++)
cin >> array[i][j];
int count = 0;
int total = hangshu * lieshu;
lieshu--; hangshu--;
for (i = 0; i <= hangshu; i++)
{
for (j = i; j <= lieshu - i; j++)
{
cout << array[i][j] << endl;
count++;
}
if (count == total)
break;
for (j = i + 1; j <= hangshu - i; j++)
{
cout << array[j][lieshu - i] << endl;
count++;
}
if (count == total)
break;
for (j = lieshu - i - 1; j >= i; j--)
{
cout << array[hangshu - i][j] << endl;
count++;
}
if (count == total)
break;
for (j = hangshu - i - 1; j >= i + 1; j--)
{
cout << array[j][i] << endl;
count++;
}
if (count == total)
break;
}
return 0;
} |
46 | 22806 |
int main(int argc, char *argv[])
{int array[100][100];
int row,col,i,j,rowmin,rowmax,colmin,colmax;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
rowmin=0;
rowmax=row-1;
colmin=0;
colmax=col-1;
while(colmin<colmax&&rowmin<rowmax){
for(i=colmin;i<colmax;i++)
printf("%d\n",array[rowmin][i]);
for(i=rowmin;i<rowmax;i++)
printf("%d\n",array[i][colmax]);
for(i=colmax;i>colmin;i--)
printf("%d\n",array[rowmax][i]);
for(i=rowmax;i>rowmin;i--)
printf("%d\n",array[i][colmin]);
rowmin++;
rowmax--;
colmin++;
colmax--;}
if(rowmin==rowmax&&colmin<colmax)
{for(i=colmin;i<=colmax;i++)
printf("%d\n",array[rowmin][i]);}
else if(rowmin<rowmax&&colmin==colmax)
{for(i=rowmin;i<=rowmax;i++)
printf("%d\n",array[i][colmin]);
}
else if(rowmin==rowmax&&colmin==colmax)
printf("%d\n",array[rowmin][colmax]);
return 0;
}
|
46 | 22807 | 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 | 22808 | 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 | 22809 | int sum(int a,int b,int c){
int d=0,e;
for(e=1;e<=c;e++){
d=a+a+b+b-4*(2*e-1)+d;
}
return d;
}
int min(int a,int b,int c,int d){
if(a<b)
b=a;
if(b<c)
c=b;
if(c<d)
d=c;
return d;
}
int main(){
int a[100][100],s[10000];
int row,col,i,j,b,c,d,e;
int f,g,h;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++){
scanf("%d",&a[i][j]);
b=col-j;
c=row-i;
d=min(i-1,j-1,b,c);
e=sum(row,col,d);
f=i-d;
g=j-d;
if(f==1&&g>=1)
h=e+g;
else if(g==(col-2*d)&&f<=(row-2*d))
h=e+f+g-1;
else
h=e+row+col-1-4*d+col-2*d-g+row-2*d-f;
s[h]=a[i][j];
}
}
for(i=1;i<=row*col;i++)
printf("%d\n",s[i]);
return 0;
}
|
46 | 22810 | int main() {
int row,col;
int sz[100][100];
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int xx_row=0;
int sx_row=row-1;
int xx_col=0;
int sx_col=col-1;
while((xx_row<sx_row)&&(xx_col<sx_col)){
for(int i=xx_col;i<sx_col;i++){
printf("%d\n",sz[xx_row][i]);
}
for(int j=xx_row;j<sx_row;j++){
printf("%d\n",sz[j][sx_col]);
}
for(int k=sx_col;k>xx_col;k--){
printf("%d\n",sz[sx_row][k]);
}
for(int p=sx_row;p>xx_row;p--){
printf("%d\n",sz[p][xx_col]);
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;
}
if(xx_row==sx_row){
if(xx_col!=sx_col){
for(int i=xx_col;i<=sx_col;i++){
printf("%d\n",sz[xx_row][i]);
}
}
}
if(xx_col==sx_col){
for(int j=xx_row;j<=sx_row;j++){
printf("%d\n",sz[j][xx_col]);
}
}
return 0;
}
|
46 | 22811 | //*********************************************
//** ??: ???????? **
//** ??: ??? 1300012722 **
//** ??: 2013.11.1 **
//*********************************************
int main()
{
int row, col, n, i, j, count = 0, sum; //??????row,???col, ??????????????????n????????count
int array[120][120],times; //??????,????times
cin >> row >> col; //?????????
sum = row * col; //???????????sum
for (i = 1; i <= row; i++)
for (j = 1; j <= col; j++)
cin >> array[i][j]; //???????row??col????????????
i = 1;
j = 1; //?i?j????????????array[1][1]
while (1)
{
n = i;
for (j = n; j <= col - n + 1; j++)
{
cout << array[i][j] << endl; //???????????
count++;
}
j--;
i++;
if (count >= sum)
break; //???????????????
for ( ; i <= row - n + 1; i++)
{
cout << array[i][j] << endl; //????????????
count++;
}
if (count >= sum)
break; //???????????????
i--;
j--;
for ( ; j >= n; j--)
{
cout << array[i][j] << endl; //????????????
count++;
}
if (count >= sum)
break; //???????????????
j++;
i--;
for ( ; i > n; i--)
{
cout << array[i][j] << endl; //???????????
count++;
}
if (count >= sum)
break; //???????????????
i++;
j++;
}
return 0;
} |
46 | 22812 | int main()
{
int i,j,det[100][100],ROW,COL,row1,row2,col1,col2,count=0;
scanf("%d%d",&ROW,&COL);
for(j=0;j<ROW;j++){
for(i=0;i<COL;i++){
scanf("%d",&det[j][i]);
}
}
row1=0;
row2=ROW-1;
col1=0;
col2=COL-1;
while(row2>=row1&&col2>=col1){
for(i=col1;i<=col2;i++){
printf("%d\n",det[row1][i]);
count++;
} //verforward
if(count==ROW*COL){
break;
}
for(j=(row1+1);j<=row2;j++){
printf("%d\n",det[j][col2]);
count++;
} //hordown
if(count==ROW*COL){
break;
}
for(i=col2-1;i>=col1;i--){
printf("%d\n",det[row2][i]);
count++;
} //verbackward
if(count==ROW*COL){
break;
}
for(j=(row2-1);j>=(row1+1);j--){
printf("%d\n",det[j][col1]);
count++;
} //horup
col1++;
col2--;
row1++;
row2--;
}
return 0;
} |
46 | 22813 | 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 | 22814 | int main()
{int row,col;
int i,j;
cin>>row>>col;
int a[101][101];
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
cin>>a[i][j];
}
}
int x;
for(x=0;x<=row&&x<=col;x++)
{
i=x;
if(x<=col-1-x)
{
for(j=x;j<=col-1-x;j++)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
j=j-1;
if(x+1<=row-1-x)
{
for(i=x+1;i<=row-1-x;i++)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
i=row-1-x;
if(x<=col-2-x)
{
for(j=col-2-x;j>=x;j--)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
j=x;
if(x+1<=row-2-x)
{
for(i=row-2-x;i>=x+1;i--)
{
cout<<a[i][j]<<endl;
}
}
else {break;}
}
return 0;
}
|
46 | 22815 |
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
int n, m, a[110][110], v[110][110];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; ++ i)
for (int j = 0; j < m; ++ j)
cin >> a[i][j];
int x = 0, y = 0, cnt = 0, now = 0;
while (cnt < n * m)
{
++ cnt;
v[x][y] = 1;
cout << a[x][y] << endl;
if (x + dx[now] < 0 || x + dx[now] >= n || y + dy[now] < 0 || y + dy[now] >= m)
now = (now + 1) % 4;
else
if (v[x+dx[now]][y+dy[now]] == 1)
now = (now + 1) % 4;
x += dx[now];
y += dy[now];
}
return 0;
}
|
46 | 22816 |
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;
for(int j=i+1;j<=row-i-1;j++) //??
{
cout<<a[j][col-i-1]<<endl;
flag+=1;
}
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;
for(int j=row-i-1;j>=i+1;j--) //??
{
cout<<a[j][i]<<endl;
flag+=1;
}
if(flag==row*col)
break;
}
return 0;
}
|
46 | 22817 | void main()
{
int a[100][100];
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]);
int s_row=0,s_col=0,e_row=row-1,e_col=col-1;
while(1)
{
if (s_row>e_row)
break;
for (i=s_col;i<=e_col;i++)
printf("%d\n",a[s_row][i]);
s_row++;
if (s_col>e_col)
break;
for (i=s_row;i<=e_row;i++)
printf("%d\n",a[i][e_col]);
e_col--;
if (s_row>e_row)
break;
for (i=e_col;i>=s_col;i--)
printf("%d\n",a[e_row][i]);
e_row--;
if (s_col>e_col)
break;
for (i=e_row;i>=s_row;i--)
printf("%d\n",a[i][s_col]);
s_col++;
}
} |
46 | 22818 | int main()
{
int m,n;
int h,l,i;
int sz[100][100];
scanf("%d%d",&m,&n);
for(h=0;h<m;h++)
{
for(l=0;l<n;l++)
{
scanf("%d",&(sz[h][l]));
}
}
for(i=0;i<(m+1)/2&&i<(n+1)/2;i++)
{
for(l=i;l<n-1-i;l++)
{
printf("%d\n",sz[i][l]);
}
for(h=i;h<=m-1-i;h++)
{
printf("%d\n",sz[h][n-1-i]);
}
for(l=n-2-i;l>=i;l--)
{
if(i!=m-1-i&&i!=n-1-i)
{
printf("%d\n",sz[m-1-i][l]);
}
}
for(h=m-2-i;h>=1+i;h--)
{
if(i!=m-1-i&&i!=n-1-i)
{
printf("%d\n",sz[h][i]);
}
}
}
return 0;
}
|
46 | 22819 | int main()
{
int array[101][101],row,col;
int i=0,j=0,sum=0;
cin>>row>>col;
for(i=0;i<row;i++){
for(j=0;j<col;j++){
cin>>array[i][j];
}}//????
int n=0;
for(n=0;;n++){
for(j=n;j<=col-n-1;j++){
cout<<array[n][j]<<endl;
sum++;//???
}
if(sum==row*col)break;
for(i=n+1;i<=row-1-n;i++){
cout<<array[i][col-n-1]<<endl;
sum++;
}//???
if(sum==row*col)break;
for(j=col-n-2;j>=n;j--){
cout<<array[row-1-n][j]<<endl;
sum++;
}//???
if(sum==row*col)break;
for(i=row-2-n;i>=n+1;i--){
cout<<array[i][n]<<endl;
sum++;
}//???
if(sum==row*col)break;
}
return 0;
} |
46 | 22820 | int main(){
int x,y;
scanf("%d%d",&y,&x);
int sz[x][y];
int c,d;
c=x*y;
d=0;
for(int b=0;b<y;b++){
for(int a=0;a<x;a++){
scanf("%d",&sz[a][b]);
}
}
for(int i=0;i!=-1;i++){
for(int a=i;a<x-i;a++){
printf("%d\n",sz[a][i]);
sz[a][i]=0;
d++;
}
if(d==c){
break;
}
for(int b=i+1;b<y-i;b++){
printf("%d\n",sz[x-i-1][b]);
sz[x-i-1][b]=0;
d++;
}
if(d==c){
break;
}
for(int a=x-i-2;a>=i;a--){
printf("%d\n",sz[a][y-i-1]);
sz[a][y-i-1]=0;
d++;
}
if(d==c){
break;
}
for(int b=y-i-2;b>i;b--){
printf("%d\n",sz[i][b]);
sz[i][b]=0;
d++;
}
if(d==c){
break;
}
}
return 0;
}
|
46 | 22821 | int main()
{
int a[100][100];
int row,col,i,j,h;
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=-1;
for(h=0;;h++)
{
for(j++;j<col-h;j++)
{
printf("%d\n",a[i][j]);
}
j--;
if(i>=row-h-1)
break;
for(i++;i<row-h;i++)
{
printf("%d\n",a[i][j]);
}
i--;
if(j<h+1)
break;
for(j--;j>=h;j--)
{
printf("%d\n",a[i][j]);
}
j++;
if(i<h+2)
break;
for(i--;i>=h+1;i--)
{
printf("%d\n",a[i][j]);
}
i++;
if(j>=col-h-1)
break;
}
return 0;
}
|
46 | 22822 | int main()
{
int m1[100][100],i,j,k,a,b,c=0,d,e,x=-1;
scanf("%d %d\n",&a,&b);
e=a;d=b;
for(i=0;i<a;i++)
{
for(j=0;j<b;j++){
scanf("%d",&m1[i][j]);}
scanf("\n");
}
for(k=1;k<100000;k++){
x=x+1;
for(j=x;j<b-x;j++)
{
printf("%d\n",m1[x][j]);
c+=1;
}
if(c==d*e)break;
for(i=x+1;i<a-x;i++)
{
printf("%d\n",m1[i][b-x-1]);
c+=1;
}
if(c==d*e)break;
for(j=2+x;j<b+1-x;j++)
{
printf("%d\n",m1[a-1-x][b-j]);
c+=1;
}
if(c==d*e)break;
for(i=2+x;i<a-x;i++)
{
printf("%d\n",m1[a-i][x]);
c+=1;
}
if(c==e*d)break;
}
return 0;
}
|
46 | 22823 | int main(){
int sz[100][100],row,col;
scanf("%d %d",&row,&col);
for(int i=0;i<row;i++){
for(int j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
int xx_row=0,sx_row=row-1;
int xx_col=0,sx_col=col-1;
int k,n;
while(xx_row<sx_row&&xx_col<sx_col){
for(k=xx_col;k<=sx_col-1;k++){
printf("%d\n",sz[xx_row][k]);
}
for(n=xx_row;n<=sx_row-1;n++){
printf("%d\n",sz[n][sx_col]);
}
for(k=sx_col;k>=xx_col+1;k--){
printf("%d\n",sz[sx_row][k]);
}
for(n=sx_row;n>=xx_row+1;n--){
printf("%d\n",sz[n][xx_col]);
}
xx_col++;
sx_col--;
xx_row++;
sx_row--;
}
if(sx_row==xx_row){
for(k=xx_col;k<=sx_col;k++){
printf("%d\n",sz[sx_row][k]);
}
}else
if(xx_row==sx_col){
for(n=xx_row;n<=sx_row;n++){
printf("%d\n",sz[n][sx_col]);
}
}
return 0;
} |
46 | 22824 | int main()
{
int row,col,x,y,a[100][100],flag=0,i,k;
scanf("%d%d",&row,&col);
for(x=0;x<row;x++){
for(y=0;y<col;y++){
scanf("%d",&a[x][y]);}
}
k=(row>col)?col:row;
for(i=0;i<k;i++){
for(y=i;y<col-i;y++){
printf("%d\n",a[i][y]);
flag++;}
if(flag==row*col)
break;
for(x=i+1;x<row-i;x++){
printf("%d\n",a[x][col-1-i]);
flag++;}
if(flag==row*col)
break;
for(y=col-2-i;y>=i;y--){
printf("%d\n",a[row-1-i][y]);
flag++;}
if(flag==row*col)
break;
for(x=row-2-i;x>i;x--){
printf("%d\n",a[x][i]);
flag++;}
if(flag==row*col)
break;
}
return 0;
}
|
46 | 22825 | int main()
{
int i, j, k;
int sz[100][100];
int row,col;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=0;k<(col+1)/2;k++){
for(i=k,j=k;j<col-k;j++){
printf("%d\n",sz[i][j]);
}
if(2*k==row-1){break;}
for(i=k+1,j=col-k-1;i<row-k;i++){
printf("%d\n",sz[i][j]);
}
if(2*k==col-1){break;}
for(i=row-k-1,j=col-k-2;j>=k;j--){
printf("%d\n",sz[i][j]);
}
if(2*k==row-2){break;}
for(j=k,i=row-k-2;i>k;i--){
printf("%d\n",sz[i][j]);
}
if(2*k==col-2){break;}
}
return 0;
}
|
46 | 22826 |
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 r = 0, c = 0, num = 0, n = row * col, row0 = 0, col0 = 0;
while (true)
{
for (; c < col; c++)
{
cout << a[r][c] <<endl;
num++;
}
if (num == n)
break;
row0++;
c--;
r++;
for (; r < row; r++)
{
cout << a[r][c] << endl;
num++;
}
if (num == n)
break;
col--;
r--;
c--;
for (; c >= col0; c--)
{
cout << a[r][c] << endl;
num++;
}
if (num == n)
break;
row--;
c++;
r--;
for (; r >= row0; r--)
{
cout << a[r][c] << endl;
num++;
}
if (num == n)
break;
col0++;
r++;
c++;
}
cin >> row;
return 0;
} |
46 | 22827 | int row,col,array[MAXN][MAXN],sign[MAXN][MAXN];
int main(){
memset(array,0,sizeof(array));
memset(sign,0,sizeof(sign));
cin>>row>>col;
for(int i=0;i<row;i++){
for(int j=0;j<col;j++) cin>>array[i][j];
}
int num=0,sxy=0,cxy=0,mrow=0,mcol=0;;//0==x,1==y;0==left->right/down;1==right/up
while(num<row*col){
if(sxy==0){
while(mcol<col&&mcol>=0){
if(sign[mrow][mcol]==0) {
cout<<array[mrow][mcol]<<endl;
num++;
}
sign[mrow][mcol]=1;
if(cxy==0){
if(mcol+1<col&&sign[mrow][mcol+1]==0) mcol++;
else break;
}
else{
if(mcol-1>=0&&sign[mrow][mcol-1]==0) mcol--;
else break;
}
}
sxy=1;
}
else{
while(mrow<row&&mrow>=0){
if(sign[mrow][mcol]==0){
cout<<array[mrow][mcol]<<endl;
num++;
}
sign[mrow][mcol]=1;
if(cxy==0){
if(mrow+1<row&&sign[mrow+1][mcol]==0) mrow++;
else break;
}
else{
if(mrow-1>=0&&sign[mrow-1][mcol]==0) mrow--;
else break;
}
}
sxy=0;
cxy=(cxy) ? 0 : 1;
}
}
} |
46 | 22828 | int main()
{
int m,n,a[100][100];
int p,i,j,k,q,s,ys,hs;
scanf("%d%d",&m,&n);
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
if(m<=n)
{
p=m/2;
ys=m%2;
hs=1;
}
else
{
p=n/2;
ys=n%2;
hs=2;
}
for(i=1;i<=p;i++)
{
for(j=i;j<=n-i;j++)
{
printf("%d\n",a[i][j]);
}
for(k=i;k<=m-i;k++)
{
printf("%d\n",a[k][n+1-i]);
}
for(q=n-i+1;q>=i+1;q--)
{
printf("%d\n",a[m+1-i][q]);
}
for(s=m+1-i;s>=i+1;s--)
{
printf("%d\n",a[s][i]);
}
}
if(ys==1)
{
if(hs==1)
{
for(i=(m+1)/2;i<=n-(m-1)/2;i++)
{
printf("%d\n",a[(m+1)/2][i]);
}
}
if(hs==2)
{
for(i=(n+1)/2;i<=m-(n-1)/2;i++)
{
printf("%d\n",a[i][(n+1)/2]);
}
}
}
return 0;
}
|
46 | 22829 | 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 | 22830 | // homework : ????????
// name : ???
int main()
{
int array[100][100];
int row, col;
cin >> row >> col;
for( int i = 0; i < row; i++ )
{
for( int j = 0; j < col; j++ )
{
cin >> array[i][j];
}
}
for( int row1 = 0, row2 = row - 1,col1 = 0, col2 = col - 1; col1 <= col2 && row1 <= row2; row1++, row2--, col1++, col2-- )
{
if( col1 == col2 && row1 == row2 )
{
cout << array[row1][col1] << endl;
break;
}
if( row1 == row2 )
{
for( int i =col1; i <= col2; i++ )
cout << array[row1][i] << endl;
break;
}
if( col1 == col2 )
{
for( int i = row1; i <= row2; i++ )
cout << array[i][col1] << endl;
break;
}
for( int i = col1; i < col2; i++ )
cout << array[row1][i] << endl;
for( int i = row1; i < row2; i++ )
cout << array[i][col2] << endl;
for( int i = col2; i > col1; i-- )
cout << array[row2][i] << endl;
for( int i = row2; i > row1; i-- )
cout << array[i][col1] << endl;
}
return 0;
} |
46 | 22831 | int x,y,x1,y1;
void next()
{
if((x1==0)&&(y1==1))
{
x1=1;
y1=0;
}
else if((x1==1)&&(y1==0))
{
x1=0;
y1=-1;
}
else if ((x1==0)&&(y1==-1))
{
x1=-1;
y1=0;
}
else if((x1==-1)&&(y1==0))
{
x1=0;
y1=1;
}
}
void main()
{
int a[200][200]={0},row,col,i,j,count;
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}
}
x1=0;
y1=1;
for(x=1,y=0,count=1;count<=row*col;)
{
x=x+x1;
y=y+y1;
if(a[x][y]==0)
{
x=x-x1;
y=y-y1;
next();
}
else
{
printf("%d\n",a[x][y]);
a[x][y]=0;
count++;
}
}
} |
46 | 22832 | /*
* ????????.cpp
*
* Created on: 2012-12-27
* Author: i
*/
int a[103][103]={0},n=0,m=0;
void shuchu(int hang,int lie){
int i=0;
if((n%2==0&&hang>=n/2)||(m%2==0&&lie>=m/2)){}
else if(m%2==1&&lie==m/2)for(i=hang;i<n-hang;i++)cout<<a[i][lie]<<endl;
else if(n%2==1&&hang==n/2)for(i=lie;i<m-lie;i++)cout<<a[hang][i]<<endl;
else{
for(i=lie;i<m-lie;i++)cout<<a[hang][i]<<endl;
for(i=hang+1;i<n-hang;i++)cout<<a[i][m-lie-1]<<endl;
for(i=m-lie-2;i>=lie;i--)cout<<a[n-hang-1][i]<<endl;
for(i=n-hang-2;i>=hang+1;i--)cout<<a[i][lie]<<endl;
shuchu(hang+1,lie+1);
}
}
int main(){
int i=0,j=0;
cin>>n>>m;
for(i=0;i<n;i++){
for(j=0;j<m;j++){
cin>>a[i][j];
}
}
shuchu(0,0);
return 0;
}
|
46 | 22833 | int main()
{
int m,n,i,j,k,p,q,flag=0,t;
int a[123][123];
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
for(t=0;t<123;t++)
{
for(i=t;i<n-t;i++)
{
if(a[t][i]==-123||flag==1)
{flag=1;break;}
printf("%d\n",a[t][i]);
a[t][i]=-123;
}
for(j=t+1;j<m-t;j++)
{
if(a[j][i-1]==-123||flag==1)
{flag=1;break;flag=1;}
printf("%d\n",a[j][i-1]);
a[j][i-1]=-123;
}
for(p=i-2;p>=t;p--)
{
if(a[j-1][p]==-123||flag==1)
{flag=1;break;flag=1;}
printf("%d\n",a[j-1][p]);
a[j-1][p]=-123;
}
for(q=j-2;q>t;q--)
{
if(a[q][t]==-123||flag==1)
{flag=1;break;flag=1;}
printf("%d\n",a[q][t]);
a[q][t]=-123;
}
if(flag==1)
break;
}
return 0;
} |
46 | 22834 | 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 | 22835 |
void f(int x,int y,int a[][100])
{
int i,j;
if(x*y==0||x<0||y<0) //???????
return;
if(x==1||y==1)
{
for(i=0;i<x;i++)
for(j=0;j<y;j++)
{
cout<<a[i][j]<<endl;
}
return;
}
int b[100][100];
for(j=0;j<y;j++) //????
cout<<a[0][j]<<endl;
for(i=1;i<x;i++)
cout<<a[i][y-1]<<endl;
for(j=y-2;j>=0;j--)
cout<<a[x-1][j]<<endl;
for(i=x-2;i>0;i--)
cout<<a[i][0]<<endl;
for(i=1;i<x-1;i++)
for(j=1;j<y-1;j++)
{
b[i-1][j-1]=a[i][j];
}
f(x-2,y-2,b); //????????
return;
}
int main()
{
int x,y,a[100][100],i,j;
cin>>x>>y; //????
for(i=0;i<x;i++)
for(j=0;j<y;j++)
cin>>a[i][j];
if(x==1||y==1)
for(i=0;i<x;i++)
for(j=0;j<y;j++)
cout<<a[i][j]<<endl;
else
f(x,y,a);
return 0;
}
|
46 | 22836 | int main()
{
const int max = 100;
int row, col, i, j;
cin >> row;
cin >> col;
int num[max + 2][max + 2];
for(i = 0; i < max + 2; i++)
{
for(j = 0; j < max + 2; j++)
{
num[i][j] = -1;
}
}
for(i = 1; i <= row; i++)
{
for(j = 1; j <= col; j++)
{
cin >> num[i][j];
}
}
int flag = 0;
int maxnum = row * col;
int count = 0;
i = 1;
j = 1;
while(1)
{
if(flag == 0)
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
j++;
}
j--;
i++;
flag = 1;
}
else
{
if(flag == 1)
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
i++;
}
i--;
j--;
flag = 2;
}
else {
if(flag == 2)
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
j--;
}
j++;
i--;
flag = 3;
}
else
{
while(num[i][j] != -1)
{
cout << num[i][j] << endl;
num[i][j] = -1;
count++;
i--;
}
i++;
j++;
flag = 0;
}
}
}
if(count == maxnum) break;
}
return 0;
} |
46 | 22837 | int main()
{
int row, col, n = 0;
int i, j;
int a[100 + 10][100 + 10] = {0};
cin >> row >> col;
for (i = 0; i < row; i ++)
for (j = 0; j < col; j ++)
cin >> a[i][j];
i = 0; j = 0;
int buttom = row, right = col, left = 0, top = 0;
for (;;)
{
while(j <= right - 1)
{n ++; cout << a[i][j ++] << endl;}
if (n == col * row) break;
j --; i ++; top ++;
while(i <= buttom - 1)
{n ++; cout << a[i ++][j] << endl;}
if (n == col * row) break;
i --; j --; right --;
while(j >= left)
{n ++; cout << a[i][j --] << endl;}
if (n == col * row) break;
j ++; i --; buttom --;
while(i >= top)
{n ++; cout << a[i --][j] << endl;}
if (n == col * row) break;
i ++; j ++; left ++;
}
return 0;
} |
46 | 22838 |
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 | 22839 | int main()
{
int a,b;
cin>>a>>b;
int n[a][b];
int s=0,e=b-1,p=0,q=a-1;
for(int i=0;i<a;i++)
for(int j=0;j<b;j++)
cin>>n[i][j];
if(s==e)
for(int i=p;i<=q;i++)
cout<<n[i][0]<<endl;
else if(p==q) for(int i=s;i<=e;i++)
cout<<n[0][i]<<endl;
while(s<e&&p<q)
{
for(int i=s;i<e;i++){
cout<<n[p][i]<<endl;
}
for(int i=p;i<q;i++)
{cout<<n[i][e]<<endl;}
for(int i=e;i>s;i--)
{cout<<n[q][i]<<endl;}
for(int i=q;i>p;i--)
{cout<<n[i][s]<<endl;}
s++;
e--;
p++;
q--;
if(s==e){for(int i=p;i<=q;i++)
{cout<<n[i][s]<<endl;}
break;
}
if(p==q){for(int i=s;i<=e;i++)
{cout<<n[p][i]<<endl;}
break;
}
}
return 0;
}
|
46 | 22840 | int main()
{
int n,m,i,j,r,k;
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]);
printf("\n");
for(r=0,k=0;;r++)
{
for(i=r,j=r;j<=n-r-1;j++)
{
k++;
printf("%d\n",a[i][j]);
}
if(k==m*n)break;
for(i=r+1,j=n-1-r;i<=m-1-r;i++)
{
k++;
printf("%d\n",a[i][j]);
}
if(k==m*n)break;
for(i=m-1-r,j=n-r-2;j>=r;j--)
{
k++;
printf("%d\n",a[i][j]);
}
if(k==m*n)break;
for(i=m-2-r,j=r;i>=r+1;i--)
{
k++;
printf("%d\n",a[i][j]);
}
if(k==m*n)break;
}
return 0;
} |
46 | 22841 | int main(){
int h, l;
scanf("%d %d",&h, &l);
int sz[h][l];
for(int i=0;i<h;i++){
for(int j=0;j<l;j++){
scanf("%d",&sz[i][j]);
}
}
int qs_h=0, qs_l=0;
int zz_h=h-1, zz_l=l-1;
while(qs_h<=zz_h&&qs_l<=zz_l){
if(qs_h!=zz_h&&qs_l!=zz_l){
for(int i=qs_l;i<=zz_l;i++){
printf("%d\n",sz[qs_h][i]);
}
for(int i=qs_h+1;i<=zz_h;i++){
printf("%d\n",sz[i][zz_l]);
}
for(int i=zz_l-1;i>=qs_l;i--){
printf("%d\n",sz[zz_h][i]);
}
for(int i=zz_h-1;i>=qs_h+1;i--){
printf("%d\n",sz[i][qs_l]);
}
}//???????
if(qs_h==zz_h&&qs_l!=zz_l){
if(h%2==1){
for(int i=qs_l;i<=zz_l;i++){
printf("%d\n",sz[qs_h][i]);
}
}//???
if(h%2==0){
for(int i=zz_l;i>=qs_l;i--){
printf("%d\n",sz[qs_h][i]);
}
}//???
}//????
if(qs_h!=zz_h&&qs_l==zz_l){
for(int i=qs_h;i<=zz_h;i++){
printf("%d\n",sz[i][qs_l]);
}
}//????
if(qs_h==zz_h&&qs_l==zz_l){
printf("%d\n",sz[qs_h][zz_h]);
}//????
qs_h++;
qs_l++;
zz_l--;
zz_h--;
}
return 0;
}
|
46 | 22842 | int main()
{
int x,y,k,sum;
int a[100][100];
int i,j;
int count;
scanf("%d %d",&x,&y);
count=0;
for(i=0;i<x;i++)
{
for(j=0;j<y;j++)
{
scanf("%d",&a[i][j]);
}
}
sum=x*y;
i=0;
j=0;
k=0;
while(count<sum)
{
for(j=0+k;j<y;j++)
{
printf("%d\n",a[i][j]);
}
count+=y-k;
if(count==sum)
break;
for(i=1+k;i<x;i++)
{
printf("%d\n",a[i][j-1]);
}
count+=x-1-k;
if(count==sum)
break;
y--;
for(j=y-1;j>=k;j--)
{
printf("%d\n",a[i-1][j]);
}
count+=y-k;
if(count==sum)
break;
x--;
for(i=x-1;i>k;i--)
{
printf("%d\n",a[i][j+1]);
}
count+=x-1-k;
k++;
i=k;
}
}
|
46 | 22843 | void main()
{
int a[100][100],i,j,t,row,col;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0;i<col;i++)
{
for(j=i;j<=col-1;j++)
{t=a[i][j];
printf("%d\n",a[i][j]);
}
for(j=i+1;j<=row-1;j++)
{t=a[j][col-1];
printf("%d\n",a[j][col-1]);
}
if(i>=row-1)
break;
if(i>=col-1)
break;
for(j=col-2;j>=i;j--)
{t=a[row-1][j];
printf("%d\n",a[row-1][j]);
}
for(j=row-2;j>i;j--)
{t=a[j][i];
printf("%d\n",a[j][i]);
}
row--;
col--;
}
} |
46 | 22844 | int main(){
int row,col,i,k,j,m,n;
scanf("%d%d",&row,&col);
'\n';
int sz[100][100],a[10000];
for(i=0;i<row;i++){
for(k=0;k<col;k++){
scanf("%d",&sz[i][k]);
}
'\n';
}
j=0;
for(i=0;i<col-1;i=i+2){
m=i/2;
for(k=m;k<col-m-1;k++){
a[j]=sz[m][k];
j++;
}
for(k=m;k<row-m-1;k++){
a[j]=sz[k][col-m-1];
j++;
}
for(k=col-m-1;k>m;k--){
a[j]=sz[row-m-1][k];
j++;
}
for(k=row-m-1;k>m;k--){
a[j]=sz[k][m];
j++;
}
}
if(col%2==1){
m=i/2;
for(k=m;k<row-m;k++){
a[j]=sz[k][(col-1)/2];
j++;
}
}
for(i=0;i<row*col-1;i++){
printf("%d\n",a[i]);
}
printf("%d",a[row*col-1]);
return 0;
} |
46 | 22845 | int main()
{
int l,m,n,k,i,j,sum,p,q;
int s[150][150]={0};
int a[150][150]={0};
scanf("%d %d",&m,&n);
for (i=0;i<m;i++)
for (j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
s[i][j]=1;
}
sum=m*n;i=0;j=0;p=0;q=1;
while (sum>0)
{
k=0;
while (s[i][j]==1)
{
printf("%d\n",a[i][j]);
s[i][j]=0;sum--;
i+=p;
j+=q;
}
if ((p==0)&&(q==1)&&(k==0))
{
p=1;
q=0;
i=i+1;
j=j-1;
k=1;
}
if ((p==1)&&(q==0)&&(k==0))
{
p=0;
q=-1;
i=i-1;
j=j-1;k=1;
}
if ((p==0)&&(q==-1)&&(k==0))
{
p=-1;
q=0;
j=j+1;
i=i-1;k=1;
}
if ((p==-1)&&(q==0)&&(k==0))
{
p=0;
q=1;
j=j+1;
i=i+1;
k=1;
}
}
return 0;
}
|
46 | 22846 | 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 | 22847 | int judge(int a[101][101],int m,int n,int i,int j){
if(i==0&&j<n-1) return 2;
if(j==n-1&&i<m-1) return 3;
if(i==m-1&&j>0) return 4;
if(j==0&&i>1) return 1;
if(a[i-1][j]!=-1&&a[i][j-1]==-1) return 1;
if(a[i][j+1]!=-1) return 2;
if(a[i+1][j]!=-1) return 3;
if(a[i][j-1]!=-1) return 4;
return 0;
}
void main(){
int m,n,i,j,a[101][101];
int judge(int a[101][101],int n,int m,int i,int j);
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++) scanf("%d",&a[i][j]);
i=j=0;
if(m==1&&n==1) printf("%d\n",a[0][0]);
else{
while(judge(a,m,n,i,j)!=0){
if(a[i][j]>0) printf("%d\n",a[i][j]);
else break;
a[i][j]=-1;
switch (judge(a,m,n,i,j)){
case 1:i--;break;
case 2:j++;break;
case 3:i++;break;
case 4:j--;break;
}
};
if(a[i][j]>0) printf("%d\n",a[i][j]);
}
}
|
46 | 22848 | //#define s 100
int main(){
int row ,col;
int ew[100][100];
int a,b,p,q;
int i,j;
int e,f;
int m,n;
int min=0;
scanf("%d%d",&row,&col);
e=row/2;
f=col/2;
for(i=0;i<=row-1;i++)
{
for(j=0;j<=col-1;j++)
{
scanf("%d",&ew[i][j]);
}
}
if(row%2==0&&col%2==0)
{
if(e>f)
{
min=f;
}
if(e<=f)
{
min=e;
}
}
if(row%2==1&&col%2==1){
if(e+1>f+1)
{
min=f+1;
}
if(e+1<=f+1)
{
min=e+1;
}
}
if(row%2==1&&col%2==0)
{
if(e+1>f)
{
min=f;
}
if(e+1<=f)
{
min=e+1;
}
}
if(row%2==0&&col%2==1)
{
if(e>f+1)
{
min=f+1;
}
if(e<=f+1)
{
min=e;
}
}
if((row%2==0&&col%2==0)||((row%2==1&&col%2==0)&&(e+1>f))||((row%2==0&&col%2==1)&&(f+1>e)))
{
for(i=0;i<=min-1;i++)
{
for(a=i;a<=col-i-2;a++)
{
printf("%d\n",ew[i][a]);
}
for(b=i;b<=row-i-2;b++)
{
printf("%d\n",ew[b][col-1-i]);
}
for(p=col-i-1;p>=i+1;p--)
{
printf("%d\n",ew[row-i-1][p]);
}for(q=row-1-i;q>=i+1;q--)
{
printf("%d\n",ew[q][i]);
}
}
}
if( ((col%2==1)&&(row%2==0)&&(f+1<=e)) || ((col%2==1)&&(row%2==1)&&(f+1<=e+1)))
{
for(i=0;i<=min-2;i++)
{
for(a=i;a<=col-i-2;a++)
{
printf("%d\n",ew[i][a]);
}
for(b=i;b<=row-i-2;b++)
{
printf("%d\n",ew[b][col-1-i]);
}
for(p=col-i-1;p>=i+1;p--)
{
printf("%d\n",ew[row-i-1][p]);
}for(q=row-1-i;q>=i+1;q--)
{
printf("%d\n",ew[q][i]);
}
}
for(m=min-1;m<=row-min;m++)
{
printf("%d\n",ew[m][f]);
}
}
if( ((row%2==1)&&(col%2==0)&&(e+1<=f)) || ( (row%2==1) && (col%2==1) && (e+1<f+1) ) )
{
for(i=0;i<=min-2;i++)
{
for(a=i;a<=col-i-2;a++)
{
printf("%d\n",ew[i][a]);
}
for(b=i;b<=row-i-2;b++)
{
printf("%d\n",ew[b][col-1-i]);
}
for(p=col-i-1;p>=i+1;p--)
{
printf("%d\n",ew[row-i-1][p]);
}for(q=row-1-i;q>=i+1;q--)
{
printf("%d\n",ew[q][i]);
}
}
for(n=min-1;n<=col-min;n++)
{
printf("%d\n",ew[e][n]);
}
}
return 0;
}
|
46 | 22849 | 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 | 22850 | int main()
{
int i,j,row,col,row0=0,col0=0;
int a[200][200];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
while(row0>=0)
{
if(row0+1==row)
{
for(i=col0;i<col;i++)
printf("%d\n",a[row0][i]);
break;
}
if(col0+1==col)
{
for(i=row0;i<row;i++)
printf("%d\n",a[i][col0]);
break;
}
if(row0+1==row&&col0+1==col)
{
printf("%d\n",a[row0][col0]);
break;
}
for(i=col0;i<col;i++)
printf("%d\n",a[row0][i]);
for(i=row0+1;i<row;i++)
printf("%d\n",a[i][col-1]);
for(i=col-2;i>=col0;i--)
printf("%d\n",a[row-1][i]);
for(i=row-2;i>=row0+1;i--)
printf("%d\n",a[i][col0]);
row0++;
col0++;
row--;
col--;
if(row0>row-1||col0>col-1)
break;
}
return 0;
}
|
46 | 22851 | int main()
{
int row, col, num[100][100], count;
int r, l;
int i, j, k;
cin >> row >> col;
count = row * col;
for (i = 1; i <= row; i++) // i???
{
for (j = 1; j <= col; j++) // j???
{
cin >> num[i][j];
}
} // end for
int r1, r2, l1, l2;
r1 = 1;
r2 = row;
l1 = 1;
l2 = col;
while ((r1 <= r2) && (l1 <= l2))
{
int flag = 0;
for (l = l1; l <= l2; l++)
{
cout << num[r1][l];
count--; // count?????????
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
for (r = r1 + 1; r <= r2; r++)
{
cout << num[r][l2];
count--;
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
for (l = l2 - 1; l >= l1; l--)
{
cout << num[r2][l];
count--;
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
for (r = r2 - 1; r > r1; r--)
{
cout << num[r][l1];
count--;
if (count != 0)
{
cout << endl;
}
else
{
flag = 1;
}
}
if (flag)
{
break;
}
else
{
r1++;
r2--;
l1++;
l2--;
}
} // end while
return 0;
}
|
46 | 22852 | int main()
{
int row,col,m,n,p,q,i,j;
int a[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<=row-1;i++)
for(j=0;j<=col-1;j++)
scanf("%d",&a[i][j]);
m=0;
p=0;
n=row-1;
q=col-1;
while((n-m>1)&&(q-p)>1)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
for(i=m+1;i<=n;i++)
printf("%d\n",a[i][q]);
for(i=q-1;i>=p;i--)
printf("%d\n",a[n][i]);
for(i=n-1;i>=m+1;i--)
printf("%d\n",a[i][p]);
m++;
p++;
n--;
q--;
}
if(n==m)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
}
else if(n==m+1)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
for(i=q;i>=p;i--)
printf("%d\n",a[n][i]);
}
else if(p==q)
{
for(i=m;i<=n;i++)
printf("%d\n",a[i][p]);
}
else if(q==p+1)
{
for(i=p;i<=q;i++)
printf("%d\n",a[m][i]);
for(i=m+1;i<=n;i++)
printf("%d\n",a[i][q]);
for(i=q-1;i>=p;i--)
printf("%d\n",a[n][i]);
for(i=n-1;i>=m+1;i--)
printf("%d\n",a[i][p]);
}
return 0;
} |
46 | 22853 | /*????
????????????????row?col?
???row??????col???????????????
??????row?col??0<row<100, 0<col<100?
????
????????????????????
????
4 4
1 2 3 4
12 13 14 5
11 16 15 6
10 9 8 7
*/
int main(){
int n,m,sum=0;
int str[100][100];
cin>>n>>m;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
cin>>str[i][j];
for(int k=0;k<(n+1)/2;k++){
for(int k1=k;k1<m-k;k1++){
cout<<str[k][k1]<<endl;
sum++;
if(sum==n*m)
return 0;}
for(int k2=k+1;k2<n-k;k2++){
cout<<str[k2][m-k-1]<<endl;
sum++;
if(sum==n*m)
return 0;}
for(int k3=m-k-2;k3>=k;k3--){
cout<<str[n-k-1][k3]<<endl;
sum++;
if(sum==n*m)
return 0;}
for(int k4=n-k-2;k4>k;k4--){
cout<<str[k4][k]<<endl;
sum++;
if(sum==n*m)
return 0;}
}
return 0;
}
|
46 | 22854 | int main()
{
int a[110][110],row,col,i,j=0,k=0,geshu=0,zong;
scanf("%d %d",&row,&col);
zong=row*col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
j=0;i=0;
while(col>=1&&row>=1)
{
if(geshu==zong) break;
for(j=k;j<col;j++)
{
printf("%d\n",a[k][j]);
geshu+=1;
}
if(geshu==zong) break;
for(i=k+1;i<=(row-1);i++)
{
printf("%d\n",a[i][col-1]);
geshu+=1;
}
if(geshu==zong) break;
for(j=col-2;j>=k;j--)
{
printf("%d\n",a[row-1][j]);
geshu+=1;
}
if(geshu==zong) break;
for(i=row-2;i>=(k+1);i--)
{
printf("%d\n",a[i][k]);
geshu+=1;
}
row-=1;
col-=1;
k+=1;
}
return 0;
} |
46 | 22855 | void Matrix(int a[100][100],int srow,int scol,int erow,int ecol)
{
int i,j;
for(i=scol;i<=ecol;i++)
printf("%d\n",a[srow][i]);
for(i=srow+1;i<=erow;i++)
printf("%d\n",a[i][ecol]);
if(erow>srow)
for(i=ecol-1;i>=scol;i--)
printf("%d\n",a[erow][i]);
if(ecol>scol)
for(i=erow-1;i>=srow+1;i--)
printf("%d\n",a[i][scol]);
if(erow-srow>=2&&ecol-scol>=2)
Matrix(a,srow+1,scol+1,erow-1,ecol-1);
}
main()
{
int a[100][100],i,j,m,n;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
Matrix(a,0,0,m-1,n-1);
} |
46 | 22856 |
int main()
{
int row,col;
int i,j,n,time=0;
scanf("%d%d",&row,&col);
int array[100][100];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
for (n=0;;n++)
{
for (i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
time++;
if(time!=0)
{
printf("\n");
}
}
if(time==row*col)break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
time++;
if(time!=row*col)
{
printf("\n");
}
}
if(time==row*col)break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
time++;
if(time!=row*col)
{
printf("\n");
}
}
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
time++;
if(time!=row*col)
{
printf("\n");
}
}
if(time==row*col)break;
}
return 0;
}
|
46 | 22857 | int main()
{
int m,n,i,j,A,B,C,D;
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]);
}
}
A=n-1;
B=m-1;
C=0;
D=1;
int sum,k=0;
sum=m*n;
i=0;
j=0;
if(m==1&&n==1)
{
printf("%d",a[0][0]);
}
else
{
if(m==1&&n!=1)
{
for(i=0;i<n-1;i++)
{
printf("%d\n",a[0][i]);
}
printf("%d",a[0][i]);
}
else
{
if(n==1&&m!=1)
{
for(i=0;i<m-1;i++)
{
printf("%d\n",a[i][0]);
}
printf("%d",a[i][0]);
}
else
{
while(k<sum)
{
for(j=C;j<=A;j++)
{
if(k!=sum-1)
{
printf("%d\n",a[i][j]);
k++;
}
else
{
printf("%d",a[i][j]);
goto end;
}
}
j--;
A--;
for(i=D;i<=B;i++)
{
if(k!=sum-1)
{
printf("%d\n",a[i][j]);
k++;
}
else
{
printf("%d",a[i][j]);
goto end;
}
}
i--;
B--;
for(j=A;j>=C;j--)
{
if(k!=sum-1)
{
printf("%d\n",a[i][j]);
k++;
}
else
{
printf("%d",a[i][j]);
goto end;
}
}
j++;
C++;
for(i=B;i>=D;i--)
{
if(k!=sum-1)
{
printf("%d\n",a[i][j]);
k++;
}
else
{
printf("%d",a[i][j]);
goto end;
}
}
i++;
D++;
}
}
}
}
end: return 0;
} |
46 | 22858 | int main()
{
int a[100][100];
int h,s,i,j,m,z=0;
scanf("%d%d",&h,&s);
m=h*s;
for(i=0;i<h;i++)
{
for(j=0;j<s;j++)
scanf("%d",&a[i][j]);
}
for(i=0;;i++)
{
for(j=i;j<s-i;j++)
{
printf("%d\n",a[i][j]);
z++;
}
if(z==m)break;
for(j=i+1;j<h-i;j++)
{
printf("%d\n",a[j][s-1-i]);
z++;
}
if(z==m)break;
for(j=s-i-2;j>=i;j--)
{
printf("%d\n",a[h-i-1][j]);
z++;
}
if(z==m)break;
for(j=h-i-2;j>i;j--)
{
printf("%d\n",a[j][i]);
z++;
}
if(z==m)break;
}
} |
46 | 22859 | int main()
{
int row,col;
int i,j,n;
int t=0;
int array[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
for (n=0;n<row;n++)
{
for (i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
t++;
}
printf("\n");
if(t==row*col)
break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
t++;
}
printf("\n");
if(t==row*col)
break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
t++;
}
printf("\n");
if(t==row*col)
break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
t++;
}
printf("\n");
if(t==row*col)
break;
}
return 0;
}
|
46 | 22860 | int main()
{
int m,n,i,j,num[100][100];
int flag = -1;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0; j<n; j++)
{
scanf("%d", &num[i][j]);
}
//num[i][n] = -10;
}
//for(j = 0; j<=n; j++)
//{
//num[m][j] = -10;
//}
i = 0;
j = 0;
flag = 1;
while(1)
{
if(num[i][j] != -10)
{
printf("%d\n", num[i][j]);
num[i][j] = -10;
}
else
{
break;
}
if(flag == 1)
{
if(j+1<n && num[i][j+1] != -10)
{
j++;
}
else if(i+1 <m )
{
i++;
flag = 2;
}
}
else if(flag == 2)
{
if(i+1<m && num[i+1][j] != -10)
{
i++;
}
else if(j-1 >=0)
{
j--;
flag = 3;
}
}
else if(flag == 3)
{
if(j-1>=0 && num[i][j-1] != -10)
{
j--;
}
else if(i-1 >=0 )
{
i--;
flag = 4;
}
}
else if (flag ==4)
{
if( i-1>=0 && num[i-1][j] != -10)
{
i--;
}
else if(j+1 <n)
{
j++;
flag = 1;
}
}
}
return 0;
}
|
46 | 22861 |
int a[104][104],n=0;
int row,col,i,j,s;
int out(int ai,int aj,int bi,int bj)
{
int i,j;
for (i=aj;i<=bj;i++) {printf("%d\n",a[ai][i],n); n++;}
for (i=ai+1;i<=bi;i++) {printf("%d\n",a[i][bj],n);n++;}
if (ai!=bi) {for (i=bj-1;i>aj;i--) {printf("%d\n",a[bi][i],n);n++;} }
if (aj!=bj) {for (i=bi;i>ai;i--) {printf("%d\n",a[i][aj],n);n++;} }
// printf(" %d******%d %d \n",n,ai,aj);
if (n!=s) out(ai+1,aj+1,bi-1,bj-1);
return 0;
}
int main()
{
scanf("%d %d",&row,&col);
s=row*col;
for (i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}}
out(1,1,row,col);
return 0;
}
|
46 | 22862 | int a[100][100]={0};
int main()
{void p(char c,int b1,int b2,int b3,int b4);
int i,j,k,l,n,m;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
p('y',0,0,n-1,m-1);
}
void p(char c,int b1,int b2,int b3,int b4)
{
int i,j,k,l;
if(c=='y')
{for(i=b1;i<=b3;i++)
printf("%d\n",a[b2][i]);
if(b2!=b4)
p('x',b1,b2+1,b3,b4);}
if(c=='x')
{for(i=b2;i<=b4;i++)
printf("%d\n",a[i][b3]);
if(b1!=b3)
p('z',b1,b2,b3-1,b4);}
if(c=='z')
{for(i=b3;i>=b1;i--)
printf("%d\n",a[b4][i]);
if(b2!=b4)
p('s',b1,b2,b3,b4-1);}
if(c=='s')
{for(i=b4;i>=b2;i--)
printf("%d\n",a[i][b1]);
if(b1!=b3)
p('y',b1+1,b2,b3,b4);}
}
|
46 | 22863 | 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 | 22864 | int main()
{
int a[100][100]= {0}, r, c, i, j, n = 0;
cin >> r >> c ;
for (i = 1; i <= r; i++)
{
for (j = 1; j <= c; j++)
{
cin >> a[i][j];
}
}
j = 1;
i = 0;
while ((2 * n < c - 1) && (2 * n < r - 1))
{
for (i = 1 + n; i <= c - n; i++)
{
cout << a[j][i] << endl;
}
i--;
for (j = j + 1; j <= r - n; j++)
{
cout << a[j][i] << endl;
}
j--;
for (i = i - 1; i >= 1 + n; i--)
{
cout << a[j][i] << endl;
}
i++;
for (j = j - 1; j > 1 + n; j--)
{
cout << a[j][i] << endl;
}
j++;
n++;
}
if(2 * n == r - 1)
for (i = 1 + n; i <= c - n; i++)
{
cout << a[j][i] << endl;
}
else if(2 * n == c - 1)
for (j = j; j <= r - n; j++)
{
cout << a[j][i + 1] << endl;
}
return 0;
}
|
46 | 22865 | /*
* hui.cpp
*
* Created on: 2013-11-5
* Author: ??
*/
int main(){
int r,c;
cin>>r>>c;
int a[r][c],b[r+2][c+2],d[r*c];
for(int ii=0;ii<r+2;ii++){
for(int jj=0;jj<c+2;jj++){
b[ii][jj]=1;
}
}
for(int i=0;i<r;i++){
for(int j=0;j<c;j++){
cin>>a[i][j];
b[i+1][j+1]=0;
}
}
int ii=0,jj=0;
b[1][1]=1;
d[0]=a[0][0];
for(int m=1;m<r*c;m++){
if(jj+1<c&&b[ii+1][jj+1+1]==0&&b[ii-1+1][jj+1]==1&&b[ii+1][jj-1+1]==1)
{jj++;d[m]=a[ii][jj];b[ii+1][jj+1]++;}
else if(ii+1<r&&b[ii+1+1][jj+1]==0&&b[ii+1][jj+1+1]==1&&b[ii-1+1][jj+1]==1)
{ii++;d[m]=a[ii][jj];b[ii+1][jj+1]++;}
else if(jj-1>=0&&b[ii+1][jj-1+1]==0&&b[ii+1+1][jj+1]==1&&b[ii+1][jj+1+1]==1)
{jj--;d[m]=a[ii][jj];b[ii+1][jj+1]++;}
else if(ii-1>=1&&b[ii-1+1][jj+1]==0&&b[ii+1][jj-1+1]==1&&b[ii+1+1][jj+1]==1)
{ii--;d[m]=a[ii][jj];b[ii+1][jj+1]++;}
}
for(int f=0;f<r*c;f++){
cout<<d[f]<<endl;
}
return 0;
}
|
46 | 22866 | 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 | 22867 | int main()
{
int i,j,a[100][100]={{0},{0}},s=0,b,t=0,r=0,c=0,R,rmin=0,C,cmin=0;
scanf("%d%d",&R,&C);
for(i=0;i<R;i++)
{
for(j=0;j<C;j++)
{
scanf("%d",&a[i][j]);
t=t+1;
}
}
for(b=0;b<=10000;b++)
{
for(c=cmin;c<C;c++)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
C-=1;
c-=1;
rmin+=1;
for(r=rmin;r<R;r++)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
R-=1;
r-=1;
for(c=C-1;c>=cmin;c--)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
c+=1;
for(r=R-1;r>=rmin;r--)
{
printf("%d\n",a[r][c]);
s=s+1;
if(s==t)
return 0;
}
r+=1;
cmin+=1;
}
} |
46 | 22868 | int main(){
int i,j,k=1,n,m;
int sz[100][100];
scanf("%d %d",&n,&m);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=1;k<=n/2&&k<=m/2;k++){
for(i=k-1,j=k-1;j<m-k;j++){
printf("%d\n",sz[i][j]);
}
for(i=k-1,j=m-k;i<n-k;i++){
printf("%d\n",sz[i][j]);
}
for(i=n-k,j=m-k;j>k-1;j--){
printf("%d\n",sz[i][j]);
}
for(i=n-k,j=k-1;i>k-1;i--){
printf("%d\n",sz[i][j]);
}
}
if(n%2!=0&&n<=m){
for(j=k-1;j<=m-k;j++){
printf("%d\n",sz[n/2][j]);
}
}
else if(m%2!=0){
for(i=k-1;i<=n-k;i++){
printf("%d\n",sz[i][m/2]);
}
}
return 0;
}
|
46 | 22869 | /*************************************
*file 2.cpp ******
*author ??? ****
*date 2013-11-1 ***
*description ???????? *
*************************************/
int main()
{
int row, col; //???????
cin >> row >> col;
int i, j, m, n; //?????????
int s = row * col, k=0; //s???????,k????
int a[200][200];
for(i = 1; i <= row; i++)
{
for(j = 1; j <= col; j++)
cin >> a[i][j];
}
//??????i,i???i,col-i+1???row-i+1,col-i+1???row-i+1,i?????i,i?
for(i = 1; (i <= col - i + 1) && (i <= row - i + 1); i++)
{
for(m = i; m <= col - i + 1 && (k - s); m++) //???k-s?????????????????????????????????
{
cout << a[i][m] << endl;
k++;
}
for(m = i + 1; m <= row - i + 1 && (k - s); m++)
{
cout << a[m][col - i + 1] << endl;
k++;
}
for(m = col - i; m >= i && (k - s); m--)
{
cout << a[row - i + 1][m] << endl;
k++;
}
for(m = row - i; m > i && (k - s); m--)
{
cout << a[m][i] << endl;
k++;
}
}
return 0;
} |
46 | 22870 | //*******************************
// ???? ??????????
// ?? ? ??? 1300012972
// ?? ? 2013.11.6
//*******************************
int main()
{
int step = 0, row, col, x[4] = {0, 1, 0, -1}, y[4] = {1, 0, -1, 0}, array[100][100], i, j, acc[100][100] = {0}, d = 0;
cin >> row >> col;
for (i = 0; i < row; i++)
for (j = 0; j < col; j++)
cin >> array[i][j];
i = 0;
j = -1;
while (step < row * col)
{
i += x[d];
j += y[d];
if (i >= 0 && i < row && j >= 0 && j < col && acc[i][j] == 0)
{
cout << array[i][j] << endl;
acc[i][j] = 1;
step++;
}
else
{
i -= x[d];
j -= y[d];
d = (d + 1) % 4;
}
}
return 0;
}
|
46 | 22871 | /*
* huixingbianli.cpp
*
* Created on: 2012-12-8
* Author: Lenovo
*/
int array[100][100];
int row,col;
void out(int beginx,int beginy,int r,int c)
{
if(r==0||c==0) return;
int x,y;
if(r==1)
{
for(x=beginx;x<beginx+c;x++)
cout<<array[beginy][x]<<endl;
return;
}
if(c==1)
{
for(y=beginy;y<beginy+r;y++)
cout<<array[y][beginx]<<endl;
return;
}
for(x=beginx;x<beginx+c;x++)
cout<<array[beginy][x]<<endl;
x--;
for(y=beginy+1;y<beginy+r;y++)
cout<<array[y][x]<<endl;
y--;
for(x=x-1;x>=beginx;x--)
cout<<array[y][x]<<endl;
x++;
for(y=y-1;y>beginy;y--)
cout<<array[y][x]<<endl;
beginx++;
beginy++;
r-=2;
c-=2;
out(beginx,beginy,r,c);
}
int main()
{
int row,col,i,j;
cin>>row>>col;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>array[i][j];
out(0,0,row,col);
return 0;
}
|
46 | 22872 | int main()
{
int i,j,k,l,row,col,shuzu[100][100],n=0,m=0,b=1;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&shuzu[i][j]);
}
}
for(i=0;;i++){
for(j=m;j<col-i;j++){
printf("%d\n",shuzu[i][j]);
n++;
}
m++;
if(n==row*col){
break;
}
for(j=b;j<row-i;j++){
k=col-1-i;
printf("%d\n",shuzu[j][k]);
n++;
}
b++;
if(n==row*col){
break;
}
for(j=k-1;j>=i;j--){
l=row-1-i;
printf("%d\n",shuzu[l][j]);
n++;
}
if(n==row*col){
break;
}
for(j=l-1;j>i;j--){
printf("%d\n",shuzu[j][i]);
n++;
}
if(n==row*col){
break;
}
}
return 0;
}
|
46 | 22873 | int main(){
int xx_col,sx_col,xx_row,sx_row,row,col,k,i,a[100][100];
scanf("%d%d",&row,&col);
for(k=0;k<row;k++){
for(i=0;i<col;i++){
scanf("%d",&a[k][i]);
}
}
xx_col=0;
xx_row=0;
sx_col=col-1;
sx_row=row-1;
for(;xx_col<=sx_col&&xx_row<=sx_row;xx_col++,xx_row++,sx_col--,sx_row--){
if(xx_col!=sx_col&&xx_row!=sx_row){
for(i=xx_col;i<sx_col;i++){
printf("%d\n",a[xx_row][i]);
}
for(i=xx_row;i<sx_row;i++){
printf("%d\n",a[i][sx_col]);
}
for(i=sx_col;i>xx_col;i--){
printf("%d\n",a[sx_row][i]);
}
for(i=sx_row;i>xx_row;i--){
printf("%d\n",a[i][xx_col]);
}
}else if(xx_col==sx_col){
for(i=xx_row;i<=sx_row;i++){
printf("%d\n",a[i][xx_col]);
}
}else if(xx_row==sx_row){
for(i=xx_col;i<=sx_col;i++){
printf("%d\n",a[xx_row][i]);
}
}
}
return 0;
} |
46 | 22874 | int main()
{
int row,col,matrix[ROW][COL],k[100000];
int i,j,a=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&matrix[i][j]);
}
}
int xx_row,sx_row,xx_col,sx_col;
xx_row=0;
sx_row=row-1;
xx_col=0;
sx_col=col-1;
while((xx_row<=sx_row)&&(xx_col<=sx_col)){
if((xx_row==sx_row)&&(xx_col==sx_col)){
k[a]=matrix[xx_row][xx_col];
a++;
}
for(j=xx_col;j<sx_col;j++){
k[a]=matrix[xx_row][j];
a++;
}
for(i=xx_row;i<sx_row;i++){
k[a]=matrix[i][sx_col];
a++;
}
for(j=sx_col;j>xx_col;j--){
k[a]=matrix[sx_row][j];
a++;
}
for(i=sx_row;i>xx_row;i--){
k[a]=matrix[i][xx_col];
a++;
}
xx_row++;
sx_row--;
xx_col++;
sx_col--;
}
for(i=0;i<row*col;i++)
{
printf("%d\n",k[i]);
}
return 0;
}
|
46 | 22875 |
int a[200][200],row,col,f;
void function(int r,int c)
{
int i,j;
f=0;
if(r==1){for(i=1;i<=c;i++){printf("%d\n", a[1][i]);}f=1;}
if(c==1&&f==0){for(i=1;i<=r;i++){printf("%d\n", a[i][1]);}}
if(r!=1&&c!=1){
for(i=1;i<=c;i++){printf("%d\n", a[1][i]);}
for(i=2;i<=r;i++){printf("%d\n", a[i][c]);}
for(i=c-1;i>=1;i--){printf("%d\n", a[r][i]);}
for(i=r-1;i>=2;i--){printf("%d\n", a[i][1]);}
}
for(i=2;i<=r-1;i++){
for(j=1;j<=c-2;j++){a[i][j]=a[i][j+1];}
}
for(i=1;i<=r-2;i++){
for(j=1;j<=c-2;j++){a[i][j]=a[i+1][j];}
}
if(c-2>=1&&r-2>=1){function(r-2,c-2);}
}
int main()
{
int i,j;
scanf("%d %d", &row,&col);
for(i=1;i<=row;i++){
for(j=1;j<=col;j++){
scanf("%d", &a[i][j]);
} }
function(row,col);
}
|
46 | 22876 | int main()
{
int h,l,i,j,a,b,c,k=0,num[100][100];
cin>>h>>l;
for(i=0;i<h;i++)
for(j=0;j<l;j++)
cin>>num[i][j];
for(i=0;k<h*l;i++){
for(j=i;(j<l-i)&&(k<h*l);j++){
cout<<num[i][j]<<endl;k++;}
for(j=i+1;(j<h-i)&&(k<h*l);j++){
cout<<num[j][l-1-i]<<endl;k++;}
for(j=l-2-i;(j>=i)&&(k<h*l);j--){
cout<<num[h-1-i][j]<<endl;k++;}
for(j=h-2-i;(j>i)&&(k<h*l);j--){
cout<<num[j][i]<<endl;k++;}}
return 0;
}
|
46 | 22877 |
int main() {
int row, col;
scanf("%d%d", &row, &col);
int data[100][100];
for(int i = 0; i < row; i++) {
for(int j = 0; j < col; j++) {
scanf("%d", &data[i][j]);
}
}
int colLow = 0;
int rowLow = 0;
int colHigh = col - 1;
int rowHigh = row - 1;
while(rowLow <= rowHigh && colLow <= colHigh) {
for(int i = colLow; i <= colHigh; i++) {
printf("%d\n", data[rowLow][i]);
}
for(int i = rowLow + 1; i <= rowHigh - 1; i++) {
printf("%d\n", data[i][colHigh]);
}
if(rowHigh != rowLow) {
for(int i = colHigh; i >= colLow; i--) {
printf("%d\n", data[rowHigh][i]);
}
}
if(colHigh != colLow) {
for(int i = rowHigh - 1; i >= rowLow + 1; i--) {
printf("%d\n", data[i][colLow]);
}
}
colLow++;
rowLow++;
colHigh--;
rowHigh--;
}
}
|
46 | 22878 | void main()
{
int row,col;
int i,j,n,time=0,a,b,c,d;
int array[100][100];
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
for(n=0;;n++)
{
for(a=n;a<col-n;a++)
{
printf("%d\n",array[n][a]);
time++;
}
if(time==row*col)
break;
for(b=n+1;b<row-n;b++)
{
printf("%d\n",array[b][col-n-1]);
time++;
}
if(time==row*col)
break;
for(c=col-2-n;c>=n;c--)
{
printf("%d\n",array[row-n-1][c]);
time++;
}
if(time==row*col)
break;
for(d=row-2-n;d>n;d--)
{
printf("%d\n",array[d][n]);
time++;
}
if(time==row*col)
break;
}
}
|
46 | 22879 | 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 | 22880 |
int main()
{
int sz[100][100],i,row,col,j,k=0,min;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
min=row;
if(row>col){
min=col;
}
while(k<(min+1)/2){
for(j=0+k;j<col-k;j++){
printf("%d\n",sz[0+k][j]);
}
for(i=1+k;i<row-k;i++){
printf("%d\n",sz[i][col-1-k]);
}
for(j=col-2-k;j>-1+k;j--){
if(row-1-k<=0+k){
break;
}
printf("%d\n",sz[row-1-k][j]);
}
for(i=row-2-k;i>k;i--){
if(k>=col-1-k){
break;
}
printf("%d\n",sz[i][k]);
}
k+=1;
}
return 0;
}
|
46 | 22881 |
int main()
{
int array[110][110], row, col; //????array???row???col
int x = 0, y = 0; //x???????????????y?????
int m = 0, n = 0; //m???????n??????
cin >> row >> col; //???????
for ( int i = 0; i < row; i++ )
{
for ( int j = 0; j < col; j++ )
{
cin >> array[i][j]; //??????
}
}
while ( n < col && m < row )
{
if ( y >= col - n )
break;
while ( y < col - n )
{
cout << array[x][y] << endl;
y++;
}
y--;
x++;
if ( x >= row - m )
break;
while ( x < row - m )
{
cout << array[x][y] << endl;
x++;
}
x--;
y--;
if ( y < n )
break;
while ( y >= n )
{
cout << array[x][y] << endl;
y--;
}
y++;
x--;
m++;
if ( x < m )
break;
while ( x >= m )
{
cout << array[x][y] << endl;
x--;
}
x++;
y++;
n++;
}
return 0;
}
|
46 | 22882 | int times(int x,int y)
{
int z;
z=(x<y)?x:y;
if(z%2) return (z+1)/2;
else return z/2;
}
void spinout(int b[100][100],int x,int y)
{
int i,j,k[100][100]={0};
for(i=0;i<times(x,y);i++)
{
for(j=0;j<y;j++)
{
if(k[i][j]==0)
{
printf("%d\n",b[i][j]);
k[i][j]=1;
}
}
for(j=0;j<x;j++)
{
if(k[j][y-1-i]==0)
{
printf("%d\n",b[j][y-1-i]);
k[j][y-1-i]=1;
}
}
for(j=y-1;j>=0;j--)
{
if(k[x-1-i][j]==0)
{
printf("%d\n",b[x-1-i][j]);
k[x-1-i][j]=1;
}
}
for(j=x-1;j>=0;j--)
{
if(k[j][i]==0)
{
printf("%d\n",b[j][i]);
k[j][i]=1;
}
}
}
}
void main()
{
int row,col,i,j,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);
spinout(a,row,col);
} |
46 | 22883 | 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 | 22884 | int main()
{
int row,col,i,j,time=0;
int a[101][101]={0};
scanf("%d%d",&row,&col);
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(i=0,j=0;;)
{
for(i++,j++;;j++)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
for(j=j-1,i=i+1;;i++)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
for(i--,j--;;j--)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
for(j++,i--;;i--)
{
if(a[i][j]==0)break;
printf("%d\n",a[i][j]);
time++;
a[i][j]=0;
}
if(time==row*col)break;
}
return 0;
} |
46 | 22885 | void main()
{
int a[105][105],row,col,min,i,j;
int n,x;
scanf("%d %d",&row,&col);
for(i=1;i<=row;i++) for(j=1;j<=col;j++) scanf("%d",&a[i][j]);
if(row<=col) min=row; else min=col;
if(min%2==0) n=min/2; else n=min/2+1;
for(x=1;x<=n;x++)
{
i=x;
for(j=x;j<=col-x+1;j++) printf("%d\n",a[i][j]);
if(row==min&&row%2==1&&x==n) break;
j=col-x+1;
for(i=x+1;i<=row-x+1;i++) printf("%d\n",a[i][j]);
if(col==min&&col%2==1&&x==n) break;
i=row-x+1;
for(j=col-x;j>=x;j--) printf("%d\n",a[i][j]);
if(row==min&&row%2==0&&x==n) break;
j=x;
for(i=row-x;i>=x+1;i--) printf("%d\n",a[i][j]);
}
} |
46 | 22886 | int main(){
int x[100][100];
int row,col,i,j;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&x[i][j]);
}
}
int s=0,a=row-1,b=0,c=col-1;
while(s<=a&&b<=c){
if(s<a&&b<c){
for(i=b;i<c;i++){
printf("%d\n",x[s][i]);
}
for(i=s;i<a;i++){
printf("%d\n",x[i][c]);
}
for(i=c;i>b;i--){
printf("%d\n",x[a][i]);
}
for(i=a;i>s;i--){
printf("%d\n",x[i][b]);
}
}else if(s==a){
for(i=b;i<=c;i++){
printf("%d\n",x[s][i]);
}
}else{
for(i=s;i<=a;i++){
printf("%d\n",x[i][b]);
}
}
s=s+1;
a=a-1;
b=b+1;
c=c-1;
}
return 0;
} |
46 | 22887 | int main( )
{
int m,n,t;
cin>>m>>n;
int a[m][n];
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
cin>>a[i][j];
if(m<=n)
t=m;
else t=n;
for(int i=0;i<t/2;i++)
{
for(int j=i;j<n-i;j++)
{
cout<<a[i][j]<<endl;
}
for(int j=i+1;j<m-i;j++)
{
cout<<a[j][n-i-1]<<endl;
}
for(int j=i+1;j<n-i;j++)
{
cout<<a[m-1-i][n-1-j]<<endl;
}
for(int j=i+1;j<m-i-1;j++)
{
cout<<a[m-1-j][i]<<endl;
}
}
if(m<=n&&m%2==1)
{
for(int j=(m-1)/2;j<n-(m-1)/2;j++)
cout<<a[(m-1)/2][j]<<endl;
}
if(m>n&&n%2==1)
for(int j=(n-1)/2;j<m-(n-1)/2;j++)
cout<<a[j][(n-1)/2]<<endl;
return 0;
}
|
46 | 22888 | int a[10000][10000];
int main(){
int row,col,i,j,k=0,r,c,p=0;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&a[i][j]);
}
}
for(row=r,col=c;(row>0)&&(col>0);row=row-1,col=col-1){
if(p!=r*c){
for(j=k;j<col;j++){
printf("%d\n",a[k][j]);
p++;
}
}else{
break;
}
if(p!=r*c){
for(i=k;i<row-1;i++){
printf("%d\n",a[i+1][col-1]);
p++;
}
}else{
break;
}
if(p!=r*c){
for(j=col-1;j>k;j--){
printf("%d\n",a[row-1][j-1]);
p++;
}
}else{
break;
}
if(p!=r*c){
for(i=row-1;i>k+1;i--){
printf("%d\n",a[i-1][k]);
p++;
}
}else{
break;
}
k++;
}
return 0;
}
|
46 | 22889 | 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 | 22890 | //******************
//???2 **
//?????? **
//???2013.11.1 **
//******************
int main()
{
int row, col, num[200][200], a, b, c, c1, x, y;
cin >> row >> col;
for ( int i = 1; i <= row; i++ )
for ( int j = 1; j <= col; j++ )
cin >> num[i][j];
x = y = 1;
c1 = 0;
c = row * col;
for ( ;x <= row; )
{
for ( a = x; a <= col; a++ )
{
if ( c1 == c ) break;
cout << num[x][a] << "\n";
c1++;
}
a--;
for ( b = y + 1; b <= row; b++ )
{
if ( c1 == c ) break;
cout << num[b][a] << "\n";
c1++;
}
b--;
for ( a--; a >= x; a-- )
{
if ( c1 == c ) break;
cout << num[b][a] << "\n";
c1++;
}
a++;
b--;
for ( ; b > y; b-- )
{
if ( c1 == c ) break;
cout << num[b][a] << "\n";
c1++;
}
x++;
y++;
row--;
col--;
}
return 0;
} |
46 | 22891 | 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 | 22892 | 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 | 22893 | //********************************
//*??????????? **
//*????? 1300012845 **
//*???2013.11.2 **
//********************************
int main ()//???
{
int x[104][104]={0}, y[10001]={0}, N ;
int row, col, i, j, k, l=1, min ;
cin >> row >> col;
for ( i=1; i <=row; i++ )
{
for ( j=1; j <=col; j++ )
cin >> x[i][j];//?????x??
}
i=1, j=1;
N= row * col;
if ( row > col )
min = col;
else
min = row;
for (k=1; k <= min; k++ )//????1
{
for ( j=k; j <= col -k; j++ )//????????
{
if ( l>N )
break;//break??
y[l] = x[k][j]; //?????y??
l++;
}
for ( i=k; i <= row -k; i++ )//????????
{
if ( l>N )
break;
y[l] = x[i][col-k+1];
l++;
}
for ( j=col-k+1; j>=k+1; j-- )//??????????
{
if ( l>N )
break;
y[l] = x[row-k+1][j];
l++;
}
for ( i=row-k+1; i>=k+1; i--)//??????????
{
if ( l>N )
break;
y[l] = x[i][k];
l++;
}
}
if (col==row && col % 2!=0 )
y[N] = x [(col + 1)/2][(col + 1)/2];
for (l=1; l <= N; l++)//??
cout << y[l] << endl;
return 0;
} |
46 | 22894 |
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 | 22895 |
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 | 22896 | int main()
{
int n, m, i, j, a[101][101], round, count;
cin >> n >> m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
cin >> a[i][j];
i=1;
j=1;
round=0;
count=0; //??????
while (count<n*m) //????????
{
while (j<=m-round)
{
cout << a[i][j] << endl;
count++;
j++;
}
if (count>=n*m) break;
j--;
i++; //????
while (i<=n-round)
{
cout << a[i][j] << endl;
count++;
i++;
}
if (count>=n*m) break;
i--;
j--; //????
while (j>=round+1)
{
cout << a[i][j] << endl;
count++;
j--;
}
if (count>=n*m) break;
j++;
i--; //????
while (i>=round+2)
{
cout << a[i][j] << endl;
count++;
i--;
}
if (count>=n*m) break;
i++;
j++; //????
round++; //???????
}
return 0; //main???????0
} |
46 | 22897 | 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 | 22898 | int main(){
int a,b,c,n,i,m,j,sz[100][100];
scanf("%d%d",&m,&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&(sz[i][j]));
}
}
c=0;
for(i=0;c<n*m;i++){
a=i%4;
b=i/4;
if(a==0){
for(j=b;j<n-b;j++){
printf("%d\n",sz[b][j]);
c=c+1;
}
}
if(a==1){
for(j=b+1;j<m-b;j++){
printf("%d\n",sz[j][n-1-b]);
c=c+1;
}
}
if(a==2){
for(j=n-2-b;j>=b;j--){
printf("%d\n",sz[m-1-b][j]);
c=c+1;
}
}
if(a==3){
for(j=m-2-b;j>b;j--){
printf("%d\n",sz[j][b]);
c=c+1;
}
}
}
return 0;
} |
46 | 22899 | 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;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.