label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
46 | 22900 | int main()
{
int i,j,n,m,k,N=0;
scanf("%d%d",&n,&m);
int a[100][100];
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&a[i][j]);
}
}
for(k=0;;k++){
for(j=k;j<=m-1-k;j++){
printf("%d\n",a[k][j]);
N++;
}
printf("\n");
if(N==n*m)break;
for(i=k+1;i<=n-1-k;i++){
printf("%d\n",a[i][m-1-k]);
N++;
}
printf("\n");
if(N==n*m)break;
for(j=m-2-k;j>=k;j--){
printf("%d\n",a[n-1-k][j]);
N++;
}
printf("\n");
if(N==n*m)break;
for(i=n-2-k;i>=k+1;i--){
printf("%d\n",a[i][k]);
N++;
}
printf("\n");
if(N==n*m)
break;
}
return 0;
}
|
46 | 22901 |
/*
* 1000012795-??????????.cpp
* ??????????
* Created on: 2010-12-30
* Author: ??
*/
int a[100][100]={0};//????????
void cut(int m,int n)//??????????????
{
int i,j;
if(m==0||n==0)//???????m=0||n=0????
return ;
if(m==1)//?????m=1??????????????
{
for(i=0;i<n;i++)
cout<<a[0][i]<<endl;
return ;
}
if(n==1)//?????n=1??????????????
{
for(i=0;i<m;i++)
cout<<a[i][0]<<endl;
return ;
}
for(i=0;i<n;i++)//?????????
cout<<a[0][i]<<endl;
for(i=1;i<m;i++)
cout<<a[i][n-1]<<endl;
for(i=n-2;i>=0;i--)
cout<<a[m-1][i]<<endl;
for(i=m-2;i>0;i--)
cout<<a[i][0]<<endl;
for(i=0;i<m-2;i++)//????????????????
for(j=0;j<n-2;j++)
{
a[i][j]=a[i+1][j+1];
}
cut(m-2,n-2);//?????????
}
int main()
{
int m,n,i,j;
cin>>m>>n;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
cin>>a[i][j];
cut(m,n);
return 0;
}
|
46 | 22902 | int main()
{
int sz[100][100],row,col,i,k,x=0,y=0,n=1;
cin>>row>>col;
for(i=0;i<row;i++)
{
for(k=0;k<col;k++)
{
cin>>sz[i][k];
}
}
while(n<=row*col)
{
for(k=y;k<(col-y-1);k++)
{
cout<<sz[x][k]<<"\n";
n++;
if(n>row*col)
break;
}
for(i=x;i<(row-x-1);i++)
{
cout<<sz[i][col-y-1]<<"\n";
n++;
if(n>row*col)
break;
}
for(k=col-y-1;k>y;k--)
{
cout<<sz[row-x-1][k]<<"\n";
n++;
if(n>row*col)
break;
}
for(i=row-x-1;i>x;i--)
{
cout<<sz[i][y]<<"\n";
n++;
if(n>row*col)
break;
}
if(x==(row-1)/2&&x==y&&row==col&&row%2==1)
{
cout<<sz[x][y]<<"\n";
n++;
}
x++;
y++;
}
return 0;
} |
46 | 22903 | int main()
{
int r,c,a[100][100],b[10000]={0},i=0,j=0,p=0,q=0;
int z1,z2,z3,z4;
scanf("%d",&r);
scanf("%d",&c);
z1=z2=0,z3=r-1,z4=c-1;
for(i=0;i<r;i++){
for(j=0;j<c;j++){
scanf("%d",&a[i][j]);}}
if(c==1||r==1){
for(i=0;i<r;i++){
for(j=0;j<c;j++){
printf("%d\n",a[i][j]);}}}
else{
b[0]=a[0][0];
i=0,j=1;
for(p=1;p<(c*r);p++){
switch(q){
case 0:b[p]=a[i][j];j++;break;
case 1:b[p]=a[i][j];i++;break;
case 2:b[p]=a[i][j];j--;break;
case 3:b[p]=a[i][j];i--;break;
default:break;}
if(j==z4&&i==z1&&q==0){q=1;z1++;}
else if(i==z3&&j==z4&&q==1){q=2;z4--;}//??????
else if(j==z2&&i==z3&&q==2){q=3;z3--;}
else if(i==z1&&j==z2&&q==3){q=0;z2++;}
}
for(q=0;q<(c*r);q++){
printf("%d\n",b[q]);}}
} |
46 | 22904 | //#define main xmain
int a[MAX][MAX];
int main()
{
int m, n, i, j;
scanf("%d %d", &m, &n);
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int rs = 0, re = m - 1;
int cs = 0, ce = n - 1;
while (re >= rs && ce >= cs) {
if (re > rs) {
if (ce > cs) {
for (j=cs; j<=ce; j++) {
printf("%d\n", a[rs][j]);
}
for (i=rs+1; i<=re; i++) {
printf("%d\n", a[i][ce]);
}
for (j=ce-1; j>=cs; j--) {
printf("%d\n", a[re][j]);
}
for (i=re-1; i>rs; i--) {
printf("%d\n", a[i][cs]);
}
}
else if (ce == cs) {
for (i=rs; i<=re; i++) {
printf("%d\n", a[i][cs]);
}
}
}
else if (re == rs) {
for (j=cs; j<=ce; j++) {
printf("%d\n", a[rs][j]);
}
}
re--;
rs++;
ce--;
cs++;
}
return 0;
}
int mn[][2] = {
{23, 23},
{44, 44},
{23, 44},
{44, 23},
{3, 4},
{4, 3},
{1, 1},
{1, 99},
{99, 1},
{99, 99}
};
int xn = 0;
int max_files = sizeof(mn) / sizeof(mn[0]);
char * output_dir = "data";
int rnd(int min, int max)
{
return min + ((rand() << 15) | rand()) % (max - min + 1);
}
void swap(int *a, int *b) {
int t;
t = *a;
*a = *b;
*b = t;
}
void fill(int a[][MAX], int m, int n) {
int i, j, count = rnd(1,10);
for (i=0; i<m; i++) {
for (j=0; j<n; j++) {
a[i][j] = count++;
}
}
for (i=0; i<m; i++) {
for (j=0; j<n; j++) {
int i1 = rnd(0, m-1);
int j1 = rnd(0, n-1);
int i2 = rnd(0, m-1);
int j2 = rnd(0, n-1);
swap(&a[i1][j1], &a[i2][j2]);
}
}
}
void print(int a[][MAX], int m, int n) {
int count = 0;
for (int i=0; i<m; i++) {
for (int j=0; j<n; j++) {
printf("%d", a[i][j]);
if (j == n-1)
printf("\n");
else
printf(" ");
}
}
}
void xbuild()
{
printf("%d %d\n", mn[xn][0], mn[xn][1]);
fill(a, mn[xn][0], mn[xn][1]);
print(a, mn[xn][0], mn[xn][1]);
xn++;
}
|
46 | 22905 | int main()
{
int n,m,a[100][100],i,j,t;
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
scanf("%d",&a[i][j]);
int k=n,l=m;
i=1;
j=1;
do
{
for (t=j;t<=l;t++) printf("%d\n",a[i][t]);
i++;
if (i>k) break;
for (t=i;t<=k;t++) printf("%d\n",a[t][l]);
l--;
if (l<j) break;
for (t=l;t>=j;t--) printf("%d\n",a[k][t]);
k--;
if (i>k) break;
for (t=k;t>=i;t--) printf("%d\n",a[t][j]);
j++;
if (l<j) break;
}
while((i<=k)&&(j<=l));
return 0;
}
|
46 | 22906 | /*
* 6.cpp
*
* Created on: 2012-11-9
* Author: AK
*/
int main(){
int row,col,i,j,head,bottom,left,right;
cin>>row>>col;
int a[100][100];
for(i=0;i<row;i++)
for(j=0;j<col;j++)
{cin>>a[i][j];}
head=0,bottom=row-1,left=0,right=col-1;i=0;
for(;head<=bottom&&left<=right;){
if(head>bottom||left>right) break;
for(j=left;j<=right;j++)
cout<<a[i][j]<<endl;
j--;
head++;
if(head>bottom||left>right) break;
for(i=head;i<=bottom;i++)
cout<<a[i][j]<<endl;
i--;
right--;
if(head>bottom||left>right) break;
for(j=right;j>=left;j--)
cout<<a[i][j]<<endl;
j++;
bottom--;
if(head>bottom||left>right) break;
for(i=bottom;i>=head;i--)
cout<<a[i][j]<<endl;
i++;
left++;
}
return 0;
} |
46 | 22907 | int main (){
int h,l,i,k,a,s[H][L];
scanf("%d %d",&h,&l);
for(i=0;i<h;i++){
for(k=0;k<l;k++){
scanf("%d",&(s[i][k]));
}
}
if(h<=l){
a=2*h-1;
}else{
a=2*l;
}
for(i=0;i<a;i++){
if(i%4==0){
for(k=i/4;k<=l-1-i/4;k++){
printf("%d\n",s[i/4][k]);
}
}else if(i%4==1){
for(k=i/4+1;k<=h-1-i/4;k++){
printf("%d\n",s[k][l-1-i/4]);
}
}else if(i%4==2){
for(k=l-2-i/4;k>=i/4;k--){
printf("%d\n",s[h-1-i/4][k]);
}
}else{
for(k=h-2-i/4;k>=(i+1)/4;k--){
printf("%d\n",s[k][i/4]);
}
}
}
return 0;
} |
46 | 22908 |
int main ()
{
int a[105][105];
int m,n;
cin>>n>>m;
for(int i = 0; i < n; i ++)
for(int j = 0; j < m; j ++)
cin>>a[i][j];
int k = 0;
for(int t = 0; t < m * n; k ++)
{
for(int j1 = k; j1 < m - k; j1 ++)
{
cout<<a[k][j1]<<endl;
t ++;
}
for(int i1 = k + 1; i1 < n - k; i1 ++)
{
cout<<a[i1][m - 1 - k]<<endl;
t ++;
}
if( (k + 1 <= n - 1 - k) && ( m - 2 - k >= k) )
{
for(int j = m - 2 - k; j >= k; j --)
{
cout<<a[n - 1 - k][j]<<endl;
t ++;
}
for(int i = n - 2 - k; i >= k + 1; i --)
{
cout<<a[i][k]<<endl;
t ++;
}
}
}
return 0;
}
|
46 | 22909 | int main()
{
int a[100][100],i,k,t,m,n;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(k=0;k<n;k++)
{
scanf("%d",&a[i][k]);
}
}
for(t=0;t<(m+1)/2&&t<(n+1)/2;t++)
{
for(i=t,k=t;k<n-t;k++)
{
printf("%d\n",a[i][k]);
}
if(t!=m-t-1)
{
for(k=n-t-1,i=t+1;i<m-t;i++)
{
printf("%d\n",a[i][k]);
}
if(t!=n-t-1)
{
for(i=m-t-1,k=n-t-2;k>=t;k--)
{
printf("%d\n",a[i][k]);
}
for(k=t,i=m-t-2;i>t;i--)
{
printf("%d\n",a[i][k]);
}
}
}
}
return 0;
}
|
46 | 22910 |
int main(){
int sz[155][155];
int i,j,p,q,c=0,a,b,col,row;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&(sz[i][j]));
}
}
p=0,q=0,a=col,b=row;
while(1)
{
for(i=p,j=p;j<=p+a-1;j++)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
for(j=p+a-1,i=q+1;i<=q+b-2;i++)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
for(i=q+b-1,j=p+a-1;j>=p;j--)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
for(j=p,i=q+b-2;i>=q+1;i--)
{
if(c>=col*row)
break;
printf("%d\n",sz[i][j]); c++;
}
a-=2,b-=2;
p++,q++;
if(c>=col*row)
break;
}
return 0;
}
|
46 | 22911 |
int main()
{
int a[100][100], vis[100][100] = {0};
int row, col, n, x = -1, y = 0;
cin >> row >> col;
for (int i = 0; i < row; i++)
for (int j = 0; j < col; j++)
{
cin >> a[j][i];
}
n = row * col;
while (n)
{
while (!vis[x + 1][y] && x + 1 < col)
{
x++;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
while (!vis[x][y + 1] && y + 1 < row)
{
y++;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
while (!vis[x - 1][y] && x > 0)
{
x--;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
while (!vis[x][y - 1] && y > 0)
{
y--;
vis[x][y] = 1;
cout << a[x][y] << endl;
n--;
}
}
return 0;
} |
46 | 22912 | int main()
{
int a[101][101];
int m,n,i,j,s,t;
scanf("%d%d",&m,&n);
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
if(m>n)
{
s=n;
}
else
{
s=m;
}
i=1;
if(s%2==0)
{ for(t=1;t<=s/2;t++)
{
for(j=t;j<=n-t+1;j++)
{
printf("%d\n",a[i][j]);
}
for(i=1+t;i<=m+1-t;i++)
{
printf("%d\n",a[i][j-1]);
}
i=i-1;
for(j=n-t;j>=t;j--)
{
printf("%d\n",a[i][j]);
}
j=j+1;
for(i=m-t;i>=t+1;i--)
{
printf("%d\n",a[i][j]);
}
i=i+1;
}
}
else
{
i=1;
for(t=1;t<=(s-1)/2;t++)
{
for(j=t;j<=n-t+1;j++)
{
printf("%d\n",a[i][j]);
}
for(i=1+t;i<=m+1-t;i++)
{
printf("%d\n",a[i][j-1]);
}
i=i-1;
for(j=n-t;j>=t;j--)
{
printf("%d\n",a[i][j]);
}
j=j+1;
for(i=m-t;i>=t+1;i--)
{
printf("%d\n",a[i][j]);
}
i=i+1;
}
if(m<n)
{
for(j=(s+1)/2;j<=(n-(s-1)/2);j++)
{
printf("%d\n",a[(s+1)/2][j]);
}
}
else
{
for(i=(s+1)/2;i<=(m-(s-1)/2);i++)
{
printf("%d\n",a[i][(s+1)/2]);
}
}
}
return 0;
}
|
46 | 22913 | int main()
{
int array[100][100],i,j,k,n,col,row;
scanf("%d""%d",&row,&col);
for (i=0;i<row;i++)
{
for (j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
if (col>row)
n=row;
else if (col<row)
n=col;
else if (col==row)
n=row;
n=n/2-1;
for (k=0;k<=n;k++)
{
for (i=k,j=k;j<col-1-k;j++)
{
printf("%d\n",array[i][j]);
}
for (i=k,j=col-1-k;i<row-1-k;i++)
{
printf("%d\n",array[i][j]);
}
for (i=row-1-k,j=col-1-k;j>k;j--)
{
printf("%d\n",array[i][j]);
}
for (i=row-1-k,j=k;i>k;i--)
{
printf("%d\n",array[i][j]);
}
}
if (col>row&&row%2==1)
{
k=row/2;
for (i=k,j=k;j<=col-1-k;j++)
{
printf("%d\n",array[i][j]);
}
}
else if (col<row&&col%2==1)
{
k=col/2;
for (i=k,j=k;i<=row-1-k;i++)
{
printf("%d\n",array[i][j]);
}
}
else if (col==row&&col%2==1&&row%2==1)
{
k=col/2;
printf("%d\n",array[k][k]);
}
else k=k;
return 0;
}
|
46 | 22914 | int main()
{
int row,col,rowsx,rowxx,colsx,colxx;
scanf("%d%d",&row,&col);
int sz[100][100];
for(int i=0;i<row;i++)
{
for(int j=0;j<col;j++)
{
scanf("%d",&sz[i][j]);
}
}
rowsx=row-1;
rowxx=0;
colsx=col-1;
colxx=0;
while(rowxx<=rowsx&&colxx<=colsx)
{
if(rowxx==rowsx){
for(int o=colxx;o<=colsx;o++)
{
printf("%d\n",sz[rowxx][o]);
}
break;
}
if(colsx==colxx){
for(int p=rowxx;p<=rowsx;p++)
{
printf("%d\n",sz[p][colxx]);
}
break;
}
for(int k=colxx;k<=colsx;k++){
printf("%d\n",sz[rowxx][k]);
}
for(int l=rowxx+1;l<=rowsx;l++){
printf("%d\n",sz[l][colsx]);
}
for(int m=colsx-1;m>=colxx;m--){
printf("%d\n",sz[rowsx][m]);
}
for(int n=rowsx-1;n>rowxx;n--){
printf("%d\n",sz[n][colxx]);
}
rowsx--;
rowxx++;
colsx--;
colxx++;
}
return 0;
}
|
46 | 22915 | int main()
{
int row,col,i,j,array[101][101],count=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&array[i][j]);
int num=row+col-1;
for(i=1;i<=num;i++)
{
if(count==row*col)
break;
else
switch(i%4)
{
case 1:
{
for(j=i/4;j<col-i/4;j++)
{
printf("%d\n",array[i/4][j]);
count+=1;
}
break;
}
case 2:
{
for(j=i/4+1;j<row-i/4;j++)
{
printf("%d\n",array[j][col-i/4-1]);
count+=1;
}
break;
}
case 3:
{
for(j=col-2-i/4;j>=i/4;j--)
{
printf("%d\n",array[row-1-i/4][j]);
count+=1;
}
break;
}
case 0:
{
for(j=row-1-i/4;j>=i/4;j--)
{
printf("%d\n",array[j][i/4-1]);
count+=1;
}
break;
}
}
}
return 0;
}
|
46 | 22916 | int main()
{int i,e,array[100][100],col,row,n=0;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{ for(e=0;e<col;e++)
scanf("%d",&array[i][e]);
}
i=0;
while(n<col*row)
{ for(e=0;e<col;e++)
{
if(array[i][e]!=0)
{ printf("%d\n",array[i][e]);
array[i][e]=0;
n++;
}
}
for(e=0;e<row;e++)
{ if(array[e][col-1-i]!=0)
{ printf("%d\n",array[e][col-1-i]);
array[e][col-1-i]=0;
n++;
}
}
for(e=1;e<=col;e++)
{ if(array[row-i-1][col-e]!=0)
{ printf("%d\n",array[row-1-i][col-e]);
array[row-1-i][col-e]=0;
n++;
}
}
for(e=1;e<=row;e++)
{ if(array[row-e][i]!=0)
{ printf("%d\n",array[row-e][i]);
array[row-e][i]=0;
n++;
}
}
i++;
}
return 0;
} |
46 | 22917 | int main()
{
int row,col;
int array[100][100];
int i,j,count,n;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
count=0;
for(n=0;;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
count++;
}
for(j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
count++;
}
if (count==row*col) break;
for(i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
count++;
}
for(j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
count++;
}
}
return 0;
} |
46 | 22918 |
int main(){
int h,l;
int i,j,n,t=0;
int sz[100][100];
scanf("%d%d",&h,&l);
for(i=0;i<h;i++){
for(j=0;j<l;j++){
scanf("%d",&sz[i][j]);
}
}
for(n=0;;n++){
for(i=n,j=n;j<l-n;j++){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
for(j=l-1-n,i=1+n;i<h-n;i++){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
for(i=h-1-n,j=l-2-n;j>=n;j--){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
for(j=n,i=h-2-n;i>n;i--){
printf("%d\n",sz[i][j]);
t++;
}
if(t==h*l){
break;}
}
return 0;
}
|
46 | 22919 | void main()
{
int array[100][100]={0},i,j,row,col,h=0,n,k,r,c,m;
scanf("%d%d",&row,&col);
r=row;
c=col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
if(r<=c)
{
n=(r*2-1)/4;
m=2*r-1;
}
else
{
n=(c*2)/4;
m=c*2;
}
for(k=0;k<n;k++)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
for(j=col-1,i=h+1;i<row;i++)
{
printf("%d\n",array[i][j]);
}
for(i=row-1,j=col-2;j>=h;j--)
{
printf("%d\n",array[i][j]);
}
for(j=h,i=row-2;i>=h+1;i--)
{
printf("%d\n",array[i][j]);
}
h++;
col--;
row--;
}
if(m%4==1)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
}
if(m%4==2)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
for(j=col-1,i=h+1;i<row;i++)
{
printf("%d\n",array[i][j]);
}
}
if(m%4==3)
{
for(i=h,j=h;j<col;j++)
{
printf("%d\n",array[i][j]);
}
for(j=col-1,i=h+1;i<row;i++)
{
printf("%d\n",array[i][j]);
}
for(i=row-1,j=col-2;j>=h;j--)
{
printf("%d\n",array[i][j]);
}
}
}
|
46 | 22920 | int main()
{
int i=0,j=0,row=0,col=0,count=0,k=0,l=0,m=0;
int a[110][110]={0};
cin>>row>>col;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
cin>>a[i][j];
}
}//????????
int total = row * col;
for(i=0;count < total;i++)//???????????row?col??????
{
for(j=i;j<col-i;j++)
{
cout<<a[i][j]<<'\n';
count++;
}
if(count >= total)
break;
for(k=i+1;k<row-i;k++)
{
cout<<a[k][col-i-1]<<'\n';
count++;
}
if(count >= total)
break;
for(l=col-i-2;l>=i;l--)
{
cout<<a[row-i-1][l]<<'\n';
count++;
}
if(count >= total)
break;
for(m=row-i-2;m>=i+1;m--)
{
cout<<a[m][i]<<'\n';
count++;
}//??????????????,????????????????????
}
return 0;
} |
46 | 22921 | void main()
{
int a[105][105];
int flag=1,loci=0,locj=0,row,col,upwall=0,downwall,rightwall,leftwall=-1,i,j;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
rightwall=col;
downwall=row;
for(i=1;i<row*col;){
if(locj+1<rightwall&&flag==1){printf("%d\n",a[loci][locj++]);i++;}
else if(locj-1>leftwall&&flag==2){printf("%d\n",a[loci][locj--]);i++;}
else if(loci+1<downwall&&flag==3){printf("%d\n",a[loci++][locj]);i++;}
else if(loci-1>upwall&&flag==4){printf("%d\n",a[loci--][locj]);i++;}
else if(locj+1==rightwall&&flag==1){
rightwall--;
flag=3;
}
else if(locj-1==leftwall&&flag==2){
leftwall++;
flag=4;
}
else if(loci+1==downwall&&flag==3){
downwall--;
flag=2;
}
else if(loci-1==upwall&&flag==4){
upwall++;
flag=1;
}
}
printf("%d\n",a[loci][locj]);
} |
46 | 22922 | void main()
{
int m,n;
scanf("%d %d",&m,&n);
int a[100][100];
int i,j;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
int hd/*?????*/,hu/*?????*/,lr/*?????*/,ll/*?????*/;
if(m%2==0 && m<=n) //???????? ??????????
{
for(i=0,j=0;i<=(m/2-1);i++,j++) //????????? ???????? ????????
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
}
if(n%2==0 && m>n)
{
for(i=0,j=0;j<=(n/2-1);i++,j++)
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
}
if(m>n && n%2!=0)
{
for(i=0,j=0;j<=((n-1)/2-1);i++,j++)
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
for(j=(n-1)/2;j<m-(n-1)/2;j++)
printf("%d\n",a[j][(n-1)/2]);
}
if(m<=n && m%2!=0)
{
for(i=0,j=0;i<=((m-1)/2-1);i++,j++)
{
for(lr=j;lr<(n-j);lr++)
printf("%d\n",a[i][lr]);
for(hd=i+1;hd<(m-i);hd++)
printf("%d\n",a[hd][n-1-j]);
for(ll=n-2-j;ll>=j;ll--)
printf("%d\n",a[m-1-i][ll]);
for(hu=m-2-i;hu>i;hu--)
printf("%d\n",a[hu][j]);
}
for(i=(m-1)/2;i<n-(m-1)/2;i++)
printf("%d\n",a[(m-1)/2][i]);
}
}
|
46 | 22923 | int main(){
int r,c;
scanf("%d%d",&r,&c);
int sz[r][c];
for(int i=0;i<r;i++){for(int k=0;k<c;k++){scanf("%d",&sz[i][k]);}}
int a ;
if(r>c){a=c;}
else {a=r;}int x=0;
for (int i=0;i<a/2;i++){for (int m=x;m<c-x;m++){printf("%d\n",sz[x][m]);}
for(int m=x+1;m<r-x;m++){printf("%d\n",sz[m][c-1-x]);}
for(int m=c-2-x;m>x;m--){printf("%d\n",sz[r-1-x][m]);}
for(int m=r-1-x;m>x;m--){printf("%d\n",sz[m][x]);}
x++;
}
if(c>=r&&r%2!=0){for(int i=r/2;i<c-r/2;i++){printf("%d\n",sz[r/2][i]);}}
if(r>c&&c%2!=0){for(int i=c/2;i<r-c/2;i++){printf("%d\n",sz[i][c/2]);}
}
return 0;
}
|
46 | 22924 |
int main()
{
int a[102][102],b[102][102];
int m,n,x,y,i,j;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
int k=1;
x=0;y=0;
printf("%d\n",a[0][0]);
b[0][0]=1;
while(k<m*n)
{
while((y+1<m)&&(b[x][y+1]==0))
{
y++;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
while((x+1<n)&&(b[x+1][y]==0))
{
x++;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
while((y-1>=0)&&(b[x][y-1]==0))
{
y--;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
while((x-1>=0)&&(b[x-1][y]==0))
{
x--;
k++;
b[x][y]=1;
printf("%d\n",a[x][y]);
}
}
return 1;
}
|
46 | 22925 |
int main(int argc, char *argv[])
{
int x[100][100],i,j,k,n,col,row;
scanf("%d""%d",&row,&col);
for (i=0;i<row;i++)
{
for (j=0;j<col;j++)
{
scanf("%d",&x[i][j]);
}
}
if (col>row)
n=row;
else if (col<row)
n=col;
else if (col==row)
n=row;
n=n/2-1;
for (k=0;k<=n;k++)
{
//the 1st we will try to output the num in row=0
for (i=k,j=k;j<col-1-k;j++)//x[0][0]~x[0][col-2]
{
printf("%d\n",x[i][j]);
}
//the 2nd output the num in col=col-1
for (i=k,j=col-1-k;i<row-1-k;i++)//x[0][col-1]~x[row-2][col-1]
{
printf("%d\n",x[i][j]);
}
//the 3rd output the num in row=row-1
for (i=row-1-k,j=col-1-k;j>k;j--)//x[row-1][col-1]~x[row-1][1]
{
printf("%d\n",x[i][j]);
}
//the 4th outoput the num in col=0
for (i=row-1-k,j=k;i>k;i--)//x[row-1][0]~x[1][0]
{
printf("%d\n",x[i][j]);
}
}
if (col>row&&row%2==1)
{
k=row/2;
for (i=k,j=k;j<=col-1-k;j++)
{
printf("%d\n",x[i][j]);
}
}
else if (col<row&&col%2==1)
{
k=col/2;
for (i=k,j=k;i<=row-1-k;i++)
{
printf("%d\n",x[i][j]);
}
}
else if (col==row&&col%2==1&&row%2==1)
{
k=col/2;
printf("%d\n",x[k][k]);
}
else k=k;
return 0;
}
|
46 | 22926 | int main(){
int b[100][100],Row,Col,n,i,k,l,row,col,s=0;
scanf("%d %d",&Row,&Col);
for(row=0;row<Row;row++){
for(col=0;col<Col;col++){
scanf("%d",&b[row][col]);
}
}
for(i=1;s<Row*Col;i=i+1){
s=s+(Row+Col-4*i+4)*2-4;
}
n=i-1;
s=0;
for(k=1;k<=n;k++){
for(l=k-1;l<=Col-k&&s!=Row*Col;l++){
printf("%d\n",b[k-1][l]);
s=s+1;
}
for(l=k;l<=Row-k&&s!=Row*Col;l++){
printf("%d\n",b[l][Col-k]);
s=s+1;
}
for(l=Col-k-1;l>=k-1&&s!=Row*Col;l--){
printf("%d\n",b[Row-k][l]);
s=s+1;
}
for(l=Row-k-1;l>=k&&s!=Row*Col;l--){
printf("%d\n",b[l][k-1]);
s=s+1;
}
}
return 0;
}
|
46 | 22927 | int main()
{
int row,col,k,j;
int time=0;
cin>>row>>col;
int arr[100][100];
for(k=0;k<row;k++)
for(j=0;j<col;j++)
{
cin>>arr[k][j];
}
int i=0;
while(time<row*col)
{
for(k=i;k<col-i&&time<row*col;k++)
{
cout<<arr[i][k]<<endl;
time++;
}
for(k=i+1;k<row-i&&time<row*col;k++)
{
cout<<arr[k][col-i-1]<<endl;
time++;
}
for(k=col-i-2;k>=i&&time<row*col;k--)
{
cout<<arr[row-i-1][k]<<endl;
time++;
}
for(k=row-i-2;k>i&&time<row*col;k--)
{
cout<<arr[k][i]<<endl;
time++;
}
i++;
}
return 0;
} |
46 | 22928 | int main()
{
int a[4][2]={0,1,1,0,0,-1,-1,0};
int i,n,m,j,p;
int map[200][200];
int x,y;
scanf("%d%d",&n,&m);
for(i=0;i<=n+1;i++)
for(j=0;j<=m+1;j++)
map[i][j]=-1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&map[i][j]);
x=1;y=1;p=0;
printf("%d",map[1][1]);
map[1][1]=-1;
while(1)
{
if(map[x+a[p][0]][y+a[p][1]]!=-1)
{
x+=a[p][0];
y+=a[p][1];
printf("\n%d",map[x][y]);
map[x][y]=-1;
}
else
{
p=(p+1)%4;
if(map[x+a[p][0]][y+a[p][1]]!=-1)
{
x+=a[p][0];
y+=a[p][1];
printf("\n%d",map[x][y]);
map[x][y]=-1;
}
else
break;
}
}
//getch();
return 0;
}
|
46 | 22929 | int dat[102][102];
_Bool use[102][102];
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int main()
{
int n,m;
int l1,l2,i,j,d;
scanf("%d%d",&m,&n);
for (l1=1;l1<=m;l1++)
for (l2=1;l2<=n;l2++)
scanf("%d",&dat[l1][l2]);
for (l1=1;l1<=m;l1++)
use[l1][0]=use[l1][n+1]=1;
for (l1=1;l1<=n;l1++)
use[0][l1]=use[m+1][l1]=1;
i=1;
j=1;
d=0;
while (1)
{
printf("%d\n",dat[i][j]);
use[i][j]=1;
for (l1=1;l1<=4;l1++)
if (use[i+dir[d][0]][j+dir[d][1]]==1)
d=(d+1)%4;
else
{
i+=dir[d][0];
j+=dir[d][1];
break;
}
if (l1==5)
break;
}
return 0;
}
|
46 | 22930 | int main()
{
int row, col, array[100][100], i, j, k, min, flag;
cin >> row >> col;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
cin >> array[i][j];
}
}
min = (row < col) ? row : col;
for (k = 0; 2 * k < min; k++)
{
flag = 0;
for (i = 1 + k; i <= col - k; i++)
cout << array[1 + k][i] << endl;
for (j = 2 + k; j <= row - k; j++)
{cout << array[j][col - k] << endl; flag=1;}
if(flag)
{flag=0;
for (i = col - k - 1; i >= 1 + k; i--)
{cout << array[row - k][i] << endl;flag=1;}
if(flag)
for (j =row - k - 1; j >= 1 + k + 1; j--)
cout << array[j][1 + k] << endl;
}
}
return 0;
}
|
46 | 22931 | 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-1;j++){
scanf("%d",&m1[i][j]);}
scanf("%d\n",&m1[i][b-1]);
}
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 | 22932 | int main()
{
int row, col, u, v, w, x, y;
cin >> row >> col;
int a = 0, b;
int c = 1, d;
int num[150][150] = {0};
for (u = 0; u <= row - 1; u++)
{
for (v = 0; v <= col - 1; v++)
{
scanf("%d", &num[u][v]);
}
}
b = col - 1;
d = row - 1;
for (u = 0; u <= (row - 1) / 2; u++)
{
if (u>b) break;
for (v = u; v <= b; v++)
{
cout << num[u][v] << endl;
}
for (w = u + 1; w <= d; w++)
{
cout << num[w][b] << endl;
}
for (x = b - 1; x >= u; x--)
{
if (u < d)
cout << num[d][x] << endl;
}
for (y = d - 1; y >= u + 1; y--)
{
if (u < b)
cout << num[y][u] << endl;
}
b--;
d--;
}
return 0;
}
/*
a=0;b=m-1;c=0;d=n-1;
while (a<=b && c<=d)
{
print(..);
a++;b--;c++;d--;
}
*/ |
46 | 22933 | //********************************
//*??????????? **
//*?????? 1300012861 **
//*???2013.11.01 **
//********************************
int main()
{
int a[102][102], i, j, k, row, col;
cin >> row >> col;
for ( i = 0; i < row; i++ )
{
for ( j = 0; j < col; j++ )
{
cin >> a[i][j];
}
}
if ( row <= col )
{
if ( row < 2 )
{
for ( j = 0; j < col; j++ )
cout << a[0][j] << endl;
}
if ( row >= 2 )
{
for ( i = 0; i < row / 2; i++ )
{
for ( j = i; j < col - i; j++ )
{
cout << a[i][j] << endl;
}
j--;
for ( k = i + 1; k < row - i; k++ )
{
cout << a[k][j] << endl;
}
k--;
for ( j = j - 1; j >= i; j-- )
{
cout << a[k][j] << endl;
}
j++;
for ( k = k - 1; k > i; k-- )
{
cout << a[k][j] << endl;
}
}
if ( row % 2 != 0 )
{
for ( j = i; j < col - i; j++ )
{
cout << a[i][j] << endl;
}
}
}
}
if ( col < row )
{
if ( col < 2 )
{
for ( i = 0; i < row; i++ )
cout << a[i][0] << endl;
}
if ( col >= 2 )
{
for ( i = 0; i < col / 2; i++ )
{
for ( j = i; j < col - i; j++ )
{
cout << a[i][j] << endl;
}
j--;
for ( k = i + 1; k < row - i; k++ )
{
cout << a[k][j] << endl;
}
k--;
for ( j = j - 1; j >= i; j-- )
{
cout << a[k][j] << endl;
}
j++;
for ( k = k - 1; k > i; k-- )
{
cout << a[k][j] << endl;
}
}
if ( col % 2 != 0 )
{
for ( k = i; k < row - i; k++ )
{
cout << a[k][j+1] << endl;
}
}
}
}
return 0;
}
|
46 | 22934 | int main()
{
int a[100][100]={0},i,j,m,n,s,t,u,v;
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
i=0;
j=0;
s=0;
t=0;
u=0;
v=0;
for(;;)
{
do
{
printf("%d\n",a[i][j]);
j=j+1;
}
while (j!=n-s);
j=j-1;
s=s+1;
i=i+1;
if (v+t+1==m) break;
do
{
printf("%d\n",a[i][j]);
i=i+1;
}
while (i!=m-t);
i=i-1;
t=t+1;
j=j-1;
if (u+s==n) break;
do
{
printf("%d\n",a[i][j]);
j=j-1;
}
while (j!=u-1);
u=u+1;
j=j+1;
i=i-1;
if (v+t+1==m) break;
do
{
printf("%d\n",a[i][j]);
i=i-1;
}
while (i!=v);
v=v+1;
i=i+1;
j=j+1;
if (u+s==n) break;
}
return 0;
}
|
46 | 22935 | /*
* ????????.cpp
*
* Created on: 2011-11-4
* Author: ???
*/
void hxprint(int a[][100],int n,int m){//??????????????????
int i,j,b[100][100];
if(n==0||m==0){//??????0???
return;
}
else{
for(j=0;j<m;j++)//????????
cout<<a[0][j]<<endl;
for(i=1;i<n;i++)
cout<<a[i][m-1]<<endl;
if(n==1||m==1) return;//?????????
else{
for(j=m-2;j>=0;j--)//????????????
cout<<a[n-1][j]<<endl;
for(i=n-2;i>=1;i--)
cout<<a[i][0]<<endl;
for(i=0;i<n-2;i++)
for(j=0;j<m-2;j++){
b[i][j]=a[i+1][j+1];
}
hxprint(b,n-2,m-2);//?????????
}
}
}
int main(){
int i,j,a[100][100],n,m;
cin>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
cin>>a[i][j];
hxprint(a,n,m);
return 0;
} |
46 | 22936 | int main()
{
int row,col;
int i,j,n,time=0;
scanf("%d %d",&row,&col);
int array[100][100];
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
}
}
for (n=0;;n++)
{
for (i=n;i<col-n;i++)
{
printf("%d\n",array[n][i]);
time++;
}
printf("\n");
if(time==row*col)break;
for (j=n+1;j<row-n;j++)
{
printf("%d\n",array[j][col-n-1]);
time++;
}
if(time==row*col)break;
for (i=col-2-n;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
time++;
}
if(time==row*col)break;
for (j=row-2-n;j>n;j--)
{
printf("%d\n",array[j][n]);
time++;
}
if(time==row*col)break;
}
return 0;
}
|
46 | 22937 | int main()
{
int row,col,array[100][100],sum=0;
int i,j;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&array[i][j]);
}
}
for(i=0;i<row;i++){
for(j=i;j<=col-i-1;j++){
printf("%d\n",array[i][j]);
sum++;
}
if(sum==row*col)
break;
for(j=i+1;j<=row-i-1;j++){
printf("%d\n",array[j][col-i-1]);
sum++;
}
if(sum==row*col)
break;
for(j=col-i-1-1;j>=i;j--){
printf("%d\n",array[row-i-1][j]);
sum++;
}
if(sum==row*col)
break;
for(j=row-i-1-1;j>=i+1;j--){
printf("%d\n",array[j][i]);
sum++;
}
if(sum==row*col)
break;
}
return 0;
} |
46 | 22938 | int main(int argc, char* argv[])
{
int row,col,n,i,j,a[100][100];
int sum=0;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&(a[i][j]));
}
}
for(n=0;n<=row;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",a[n][i]);
sum++;
}
if(sum==row*col)break;
for(j=n+1;j<row - n;j++)
{
printf("%d\n",a[j][col-(n+1)]);
sum++;
}
if(sum==row*col)break;
for(i=col-(n+1)-1;i>=n;i--)
{
printf("%d\n",a[row-(n+1)][i]);
sum++;
}
if(sum==row*col)break;
for(j=row-(n+1)-1;j>n;j--)
{
printf("%d\n",a[j][n]);
sum++;
}
if(sum==row*col)break;
}
return 0;
} |
46 | 22939 |
int main()
{
int i,j,k,l,r,c,a[100][100];
scanf("%d %d",&r,&c);
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
{
scanf("%d",&a[i][j]);
}
}
l=0;
k=1;
if(r==1&&c==1)
printf("%d",a[0][0]);
else
{
for(j=0;;)
{
switch (k)
{
case 1: goto p1;break;
case 2: goto p2;break;
case 3: goto p3;break;
case 4: goto p4;
}
p1:{
for(i=l;i<c-l;i++)
{
printf("%d\n",a[l][i]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
p2:{
for(i=l+1;i<r-l-1;i++)
{
printf("%d\n",a[i][c-l-1]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
p3:{
for(i=c-l-1;i>=l;i--)
{
printf("%d\n",a[r-l-1][i]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
p4:{
for(i=r-l-2;i>l;i--)
{
printf("%d\n",a[i][l]);
j++;
if(j==r*c)
goto out;
}
goto end;
}
end:
{
k++;
if(k>4)
{
k=1;
l++;
}
}
}
}
out:;
return 0;
}
|
46 | 22940 | void main()
{
int row,col,a[100][100],i,j,p,q,k;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
if(row<col)
q=row;
else
q=col;
p=(q+1)/2;
if(row==col||q%2==0)
{
for(k=0;k<p;k++)
{
for(j=k;j<col-k;j++)
printf("%d\n",a[k][j]);
for(i=k+1;i<row-k;i++)
printf("%d\n",a[i][col-1-k]);
for(j=col-2-k;j>=k;j--)
printf("%d\n",a[row-1-k][j]);
for(i=row-2-k;i>k;i--)
printf("%d\n",a[i][k]);
}
}
if(row!=col&&q%2!=0)
{
if(col>row)
{
if(q==1)
{
for(j=0;j<col;j++)
printf("%d\n",a[0][j]);
}
else
{
for(k=0;k<p-1;k++)
{
for(j=k;j<col-k;j++)
printf("%d\n",a[k][j]);
for(i=k+1;i<row-k;i++)
printf("%d\n",a[i][col-1-k]);
for(j=col-2-k;j>=k;j--)
printf("%d\n",a[row-1-k][j]);
for(i=row-2-k;i>k;i--)
printf("%d\n",a[i][k]);
}
for(j=p-1;j<col-p+1;j++)
printf("%d\n",a[p-1][j]);
}
}
if (row>col)
{
if(q==1)
{
for(i=0;i<row;i++)
printf("%d\n",a[i][0]);
}
else
{
for(k=0;k<p-1;k++)
{
for(j=k;j<col-k;j++)
printf("%d\n",a[k][j]);
for(i=k+1;i<row-k;i++)
printf("%d\n",a[i][col-1-k]);
for(j=col-2-k;j>=k;j--)
printf("%d\n",a[row-1-k][j]);
for(i=row-2-k;i>k;i--)
printf("%d\n",a[i][k]);
}
for(j=p-1;j<row-p+1;j++)
printf("%d\n",a[j][p-1]);
}
}
}
}
|
46 | 22941 | int main ()
{
int m,n,i,j,g,h,k,l;
int a[100][100];
scanf("%d%d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
}
}
g=0;
j=0;
h=0;
l=0;
for(i=0;i<m;i++)
{
for(j=i;j<n-i;j++)
{
if(l==m*n)
{break;}
printf("%d\n",a[i][j]);
l++;
if(l==m*n)
{break;}
}
j=n-i-1;
for(g=i+1;g<m-i;g++)
{
if(l==m*n)
{break;}
printf("%d\n",a[g][j]);
l++;
if(l==m*n)
{break;}
}
k=m-i-1;
for(j=n-i-2;j>=i;j--)
{
if(l==m*n)
{break;}
printf("%d\n",a[k][j]);
l++;
if(l==m*n)
{break;}
}
for(h=m-i-2;h>i;h--)
{
if(l==m*n)
{break;}
printf("%d\n",a[h][i]);
l++;
if(l==m*n)
{break;}
}
if(l==m*n)
{break;}
}
return 0;
} |
46 | 22942 | int main()
{
int array[101][101], pos[101][101] = {0};
int row, col, i, j, count = 0, n;
cin >> row >> col;
n = row * col;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
cin >> array[i][j];
pos[i][j] = 1;
}
}
i = 0;
j = 0;
while (1)
{
while (pos[i][j+1] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
j++;
count++;
}
if (count == n - 1) break;
while (pos[i+1][j] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
i++;
count++;
}
if (count == n - 1) break;
while (j >= 0 && pos[i][j-1] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
j--;
count++;
}
if (count == n - 1) break;
while (i >= 0 && pos[i-1][j] != 0)
{
cout << array[i][j] << endl;
pos[i][j] = 0;
i--;
count++;
}
if (count == n - 1) break;
}
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
if (pos[i][j] == 1)
{
cout << array[i][j] << endl;
}
}
}
return 0;
} |
46 | 22943 | int main()
{ int i ,j ,k,row,col;
int t = 0 ;
cin >> row >> col;
int array[row][col];
for(i = 0; i <= row - 1;i ++)
{
for(j = 0; j <= col - 1; j ++)
{
cin >> array[i][j];
}
}
for( k = 0;;k ++ )
{
for(j = 0 + k; j <= col - 1 - k; j ++)
{
cout << array[k][j] << endl;
t ++;
if( t == row *col)
{ break ;
}
}
if ( t == row*col )
{
break;
}
for(i = 1 + k; i <= row - 1 - k; i ++)
{
cout << array[i][col - 1 - k] << endl;
t ++;
if( t == row *col)
{ break ;
}
}
if( t == row *col)
{ break ;
}
for(j = col - 2 - k; j >= 0 + k; j --)
{
cout << array[row - 1 -k][j] << endl;
t ++;
if( t == row *col)
{ break ;
}
}
if( t == row *col)
{ break ;
}
for(i = row - 2 - k; i >= 1 + k; i --)
{ cout << array[i][0+k] << endl;
t ++ ;
if( t == row *col)
{ break ;
}
}
if( t == row *col)
{ break ;
}
}
return 0 ;
} |
46 | 22944 | int main()
{
int x,y,m,n,i,j,k=0;
cin>>x>>y;
m=x;
if (x>y)
m=y;
m=(m+1)/2;
int max[x][y];
for (i=0;i<x;i++)
for (j=0;j<y;j++)
{
cin>>max[i][j];
}
for (n=0;n<m;n++)
{
i=n;
for (j=n;j<y-n;j++)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
i=y-n;
j--;
for (i=n+1;i<x-n;i++)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
i--;
for (j--;j>n-1;j--)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
j++;
for (i--;i>n;i--)
{
if (k==x*y)
break;
cout<<max[i][j]<<endl;
k++;
}
}
return 0;
}
|
46 | 22945 | void main()
{
int s[100][100],(*p)[100],i,j,b,a,w,q,k,t;
scanf("%d %d",&a,&b);
p=s;
for(i=0;i<=a-1;i++)
{
for(j=0;j<=b-1;j++)
{
scanf("%d",*(p+i)+j);
//printf("%d",*(*(p+i)+j));
}
}
t=0;
if(b!=1)
{for(i=0;i<=(a-1)/2;i++)
{
for(j=i;j<=b-1-i;j++)
{
if(t==0)
{
printf("%d",*(*(p+i)+j));
t=1;
}
else
{printf("\n%d",*(*(p+i)+j));
if(j==b-i-1)
{
for(k=i+1;k<=a-1-i;k++)
{
printf("\n%d",*(*(p+k)+j));
if(k==a-1-i)
{
for(q=b-i-2;q>=i;q--)
{
printf("\n%d",*(*(p+k)+q));
if(q==i)
{
for(w=a-i-2;w>=i+1;w--)
{
printf("\n%d",*(*(p+w)+q));
}
}
}
}
}
}
}
}
}
}
else
{
for(i=0;i<=a-1;i++)
{
for(j=0;j<=b-1;j++)
{
if(t!=0)
printf("\n%d",*(*(p+i)+j));
else
{printf("%d",*(*(p+i)+j));
t=1;}//printf("%d",*(*(p+i)+j));
}
}
}
} |
46 | 22946 | int rt1(int x,int y);
int rt2(int x,int y);
int rt3(int x,int y);
int rt4(int x,int y);
int sz[100][100];
int sr[100][100];
int sc[10000];
int p=0,q=0;
int count=0;
int flag=1;
int main()
{
int m,n;
scanf("%d%d",&m,&n);
int i,j;
for (i=0;i<100;i++)
{
for (j=0;j<100;j++)
{
sz[i][j]=1;
}
}
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
sz[i][j]=-2;
}
}
for (i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
scanf("%d",&sr[i][j]);
}
}
sz[0][0]=1;
int limit=m*n;
while (count<=limit-1)
{
switch (flag%4)
{
case 1:
{
(p,q)=rt1(p,q);
count=count+1;
break;
}
case 2:
{
(p,q)=rt2(p,q);
count=count+1;
break;
}
case 3:
{
(p,q)=rt3(p,q);
count=count+1;
break;
}
case 0:
{
(p,q)=rt4(p,q);
count=count+1;
break;
}
}
}
for (i=0;i<m*n;i++)
{
printf("%d\n",sc[i]);
}
return 0;
}
int rt1(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x+1;
q=y;
if (sz[q][p]>0)
{
flag=flag+1;
p=p-1;
q=q+1;
}
return (p,q);
}
int rt2(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x;
q=y+1;
if (sz[q][p]>0)
{
flag=flag+1;
q=q-1;
p=p-1;
}
return (p,q);
}
int rt3(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x-1;
q=y;
if (sz[q][p]>0)
{
flag=flag+1;
p=p+1;
q=q-1;
}
return (p,q);
}
int rt4(int x,int y)
{
sz[q][p]=sr[q][p];
sc[count]=sz[q][p];
p=x;
q=y-1;
if (sz[q][p]>0)
{
flag=flag+1;
q=q+1;
p=p+1;
}
return (p,q);
}
|
46 | 22947 |
int main()
{
int num[100][100];
int row,col;
scanf("%d%d",&row,&col);
int i,j;
int a=0,b=row-1,c=0,d=col-1;
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&num[i][j]);
}
}
do
{
i=a;
for(j=c;j<=d&&a<=b;j++)
{
printf("%d\n",num[i][j]);
}
a=a+1;
j=d;
for(i=a;i<=b&&c<=d;i++)
{
printf("%d\n",num[i][j]);
}
d=d-1;
i=b;
for(j=d;j>=c&&a<=b;j--)
{
printf("%d\n",num[i][j]);
}
b=b-1;
j=c;
for(i=b;i>=a&&c<=d;i--)
{
printf("%d\n",num[i][j]);
}
c=c+1;
/*
a=a+1;
b=b-1;
c=c+1;
d=d-1;
*/
}
while(a<=b||c<=d);
return 0;
}
|
46 | 22948 | void print(int a[100][100],int row,int col,int b,int c)
{
int i;
for(i=c;i<=col;i++)
printf("%d\n",a[b][i]);
for(i=b+1;i<=row;i++)
printf("%d\n",a[i][col]);
if(row>b)
for(i=col-1;i>=c;i--)
printf("%d\n",a[row][i]);
if(col>c)
for(i=row-1;i>=b+1;i--)
printf("%d\n",a[i][c]);
row--;
col--;
b++;
c++;
if(row-b>=0&&col-c>=0)
print(a,row,col,b,c);
}
void main()
{
int col,row,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]);
print(a,row-1,col-1,0,0);
}
|
46 | 22949 | int main(){
int m,n,i,k,s,q,w,e,r;
scanf("%d%d",&n,&m);
int a[n][m];
for(i=0;i<n;i++){
for(k=0;k<m;k++){
scanf("%d",&(a[i][k]));
}
}
s=0;
for(k=0;s<=m*n;k++){
for(q=k;q<=m-k-1;q++){
printf("%d\n",a[k][q]);
s=s+1;
}
if(s==m*n){
break;
}
for(w=k+1;w<=n-k-1;w++){
printf("%d\n",a[w][m-k-1]);
s=s+1;
}
if(s==m*n){
break;
}
for(e=m-k-2;e>=k;e--){
printf("%d\n",a[n-k-1][e]);
s=s+1;
}
if(s==m*n){
break;
}
for(r=n-k-2;r>=k+1;r--){
printf("%d\n",a[r][k]);
s=s+1;
}
if(s==m*n){
break;
}
}
return 0;
} |
46 | 22950 | void main()
{
void toy(int b[100][100],int c,int d);
int a[100][100];
int n,m,i,j;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
scanf("%d",&a[i][j]);
}
toy(a,n,m);
}
void toy(int b[100][100],int c,int d)
{
int k,l,t;
if(c==1)
{for(k=0;k<d;k++)
printf("%d\n",b[0][k]);
}
else if(c==2)
{
for(k=0;k<d;k++)
printf("%d\n",b[0][k]);
for(k=d-1;k>=0;k--)
printf("%d\n",b[1][k]);
}
else if(d==1)
{
for(k=0;k<c;k++)
printf("%d\n",b[k][0]);
}
else if(d==2)
{
for(k=0;k<c;k++)
printf("%d\n",b[k][0]);
for(k=c-1;k>=0;k--)
printf("%d\n",b[k][1]);
}
else
{
for(k=0;k<d;k++)
printf("%d\n",b[0][k]);
for(k=1;k<c-1;k++)
printf("%d\n",b[k][d-1]);
for(k=d-1;k>=0;k--)
printf("%d\n",b[c-1][k]);
for(k=c-2;k>=1;k--)
printf("%d\n",b[k][0]);
for(l=0;l<c-2;l++)
{
for(t=0;t<d-2;t++)
b[l][t]=b[l+1][t+1];
}
toy(b,c-2,d-2);
}
} |
46 | 22951 | int sz[100][100];
int main(){
int n,m,i,j,k,a1,a2,b1,b2;
scanf("%d%d",&n,&m);
for(i=0;i<n;i++){
for(j=0;j<m;j++){
scanf("%d",&sz[i][j]);
}
}
for(k=0;;k++){
a1=k;
a2=m-1-k;
b1=k;
b2=n-1-k;
if(a1>a2||b1>b2){
break;
}
if(a1==a2&&b1!=b2){
for(i=b1;i<=b2;i++){
printf("%d\n",sz[i][a1]);
}
}else if(b1==b2){
for(j=a1;j<=a2;j++){
printf("%d\n",sz[b1][j]);
}
}else if(b1==b2&&a1==a2){
printf("%d\n",sz[b1][a1]);
}else{
for(j=a1;j<=a2;j++){
printf("%d\n",sz[b1][j]);
}
for(i=b1+1;i<=b2;i++){
printf("%d\n",sz[i][a2]);
}
for(j=a2-1;j>=a1;j--){
printf("%d\n",sz[b2][j]);
}
for(i=b2-1;i>=b1+1;i--){
printf("%d\n",sz[i][a1]);
}
}
}
return 0;
}
|
46 | 22952 | int main()
{
int row,col,i,j,l,p,q,count;
int a[100][100];
cin>>row>>col;
p=(row+1)/2;
q=(col+1)/2;
count=0;
for(i=1;i<=row;i++)
{
for(j=1;j<=col;j++)
{
cin>>a[i][j];
}
}
if(row<=col&&row%2==1)
{
for(i=1;i<=row/2;i++)
{
for(j=i;j<=col-i+1;j++)
{cout<<a[i][j]<<endl;count++;}
for(l=i+1;l<=row-i+1;l++)
{cout<<a[l][col-i+1]<<endl;count++;}
for(j=col-i;j>=i;j--)
{cout<<a[row-i+1][j]<<endl;count++;}
for(l=row-i;l>=i+1;l--)
{cout<<a[l][i]<<endl;count++;}
}
for(j=(row+1)/2;j<=col-(row-1)/2;j++)
{cout<<a[p][j]<<endl;}
}
else if(row>col&&col%2==1)
{
for(i=1;i<=col/2;i++)
{
for(j=i;j<=col-i+1;j++)
{cout<<a[i][j]<<endl;count++;}
for(l=i+1;l<=row-i+1;l++)
{cout<<a[l][col-i+1]<<endl;count++;}
for(j=col-i;j>=i;j--)
{cout<<a[row-i+1][j]<<endl;count++;}
for(l=row-i;l>=i+1;l--)
{cout<<a[l][i]<<endl;count++;}
}
for(i=(col+1)/2;i<=row-(col-1)/2;i++)
{cout<<a[i][q]<<endl;}
}
else
{
for(i=1;i<=row/2;i++)
{
if(count==row*col)break;
else
{
for(j=i;j<=col-i+1;j++)
{cout<<a[i][j]<<endl;count++;}
for(l=i+1;l<=row-i+1;l++)
{cout<<a[l][col-i+1]<<endl;count++;}
for(j=col-i;j>=i;j--)
{cout<<a[row-i+1][j]<<endl;count++;}
for(l=row-i;l>=i+1;l--)
{cout<<a[l][i]<<endl;count++;}
}
}
}
return 0;
} |
46 | 22953 | int main()
{
int x,y,p=1,q=1;
double a[200][200];
scanf("%d %d",&x,&y);
for(p=1;p<=x;p++)
for(q=1;q<=y;q++)
scanf("%lf",&a[p][q]);
for(q=0;q<=y;q++)
a[0][q]=0.5;
for(q=0;q<=y;q++)
a[x+1][q]=0.5;
for(p=1;p<=x;p++)
a[p][0]=0.5;
for(p=1;p<=x;p++)
a[p][y+1]=0.5;
int i=1,j=1;
while(a[i][j]-floor(a[i][j])==0)
{
printf("%.0lf\n",a[i][j]);
a[i][j]=0.5;
if(a[i][j+1]-floor(a[i][j+1])==0&&a[i+1][j]-floor(a[i+1][j])==0||a[i][j+1]-floor(a[i][j+1])==0&&a[i+1][j]-floor(a[i+1][j])!=0&&a[i-1][j]-floor(a[i-1][j])!=0)
j=j+1;
else if(a[i+1][j]-floor(a[i+1][j])==0)
i=i+1;
else if(a[i][j-1]-floor(a[i][j-1])==0)
j=j-1;
else if(a[i-1][j]-floor(a[i-1][j])==0)
i=i-1;
else break;
}
getchar();
getchar();
return 0;
} |
46 | 22954 | int main(int argc, char* argv[])
{
int row,col,k,e,i,j,min;
int sz[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
if(col>row){
min=row;
}else{
min=col;
}
for(e=0;e<min/2+1;e++){
for(j=e;j<col-e;j++){
printf("%d\n",sz[e][j]);
}if(row%2==1&&e+1>row-2-e){
break;
}
for(i=e+1;i<row-e;i++){
printf("%d\n",sz[i][col-1-e]);
}
if(col%2==1&&e>col-2-e){
break;
}
for(j=col-2-e;j>=e;j--){
printf("%d\n",sz[row-1-e][j]);
}
for(i=row-2-e;i>e;i--){
printf("%d\n",sz[i][e]);
}}
return 0;
} |
46 | 22955 | int main()
{
int a[101][101],i,j,k=0,l=1,m,n,c,d;//???????
cin>>m>>n;//?????????
c=m,d=n;//?m,n????c,d
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
cin>>a[i][j];//??????
j=0;//?j=0
while(j<c*d)//?j<c*d?
{
for(i=l;i<=n;i++)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[k+1][i]<<endl;//??a[k+1][i]
j=j+1;//j=j+1
}
for(k=i-1,i=l+1;i<=m;i++)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[i][k]<<endl;//??a[i][k]
j=j+1;//j=j+1
}
for(k=i-1,i=n-1;i>=l;i--)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[k][i]<<endl;//??a[k][i]
j=j+1;//j=j+1
}
for(k=i+1,i=m-1;i>=l+1;i--)
{
if(j>=c*d)break;//??j>=c*d,????
cout<<a[i][k]<<endl;//??a[i][k]
j=j+1;//j=j+1
}
n=n-1;m=m-1;l=l+1;
}
return 0;
} |
46 | 22956 | int main(){
int a,b,c,d,m,n,i,j,k;
int e[MAX][MAX];
int q[4]={1,0,-1,0};
int w[4]={0,1,0,-1};
scanf("%d%d",&m,&n);
for(i=0;i<m;i++){
for(j=0;j<n;j++){
scanf("%d",&e[i][j]);
}
}
for(i=0,a=q[0],b=w[0],j=0,k=0;i<m*n;i++,j+=b,k+=a){
printf("%d\n",e[j][k]);
if(a==q[0]&&b==w[0]&&j+k==n-1){
a=q[1];
b=w[1];
}
else if(a==q[1]&&b==w[1]&&j-k==m-n){
a=q[2];
b=w[2];
}
else if(a==q[2]&&b==w[2]&&j+k==m-1){
a=q[3];
b=w[3];
}
else if(a==q[3]&&b==w[3]&&j==k+1){
a=q[0];
b=w[0];
}
}
return 0;
}
|
46 | 22957 | int main()
{
int array[100][100], i, j, row, col, num, s, k;
scanf("%d %d",&row,&col);
if(row>0 && row<100 && col>0 && col<100)
{
for(i=0; i<row; i++)
{
for(j=0; j<col; j++)
scanf("%d",&array[i][j]);
}
for(i=0, j=0, num=0; num<row*col; i++, j++) //????row*col???????
{
for(s=j; s<=(col-j-1); s++)
{
printf("%d\n",array[i][s]);//???i????
num++;
if(num>=row*col)
break;
}
if(num>=row*col)
break;
for(k=i+1; k<(row-i-1); k++)
{
printf("%d\n",array[k][col-j-1]);
num++;
if(num>=row*col)
break;
}
if(num>=row*col)
break;
for(s=col-j-1; s>j; s--)
{
printf("%d\n",array[row-i-1][s]);
num++;
if(num>=row*col)
break;
}
if(num>=row*col)
break;
for(k=row-i-1; k>i; k--)
{
printf("%d\n",array[k][j]);//??????
num++;
if(num>=row*col)
break;
}
if(num>=row*col)
break;
}
}
return 0;
}
|
46 | 22958 | int main ()
{
int a[110][110];
int row, col, i, j, k, h, l, count, hzz, lzz; // h ?row l? col
cin >> row >> col;
for (i = 1; i <= row; i++)
{
for (j = 1; j <= col; j++)
{
cin >> a[i][j];
}
}
// ??? ???i? ? i ??? lzz?? ??i????? row - i + 1 ? col - ?i - 1?
// ?lzz?i ? ????i??? col - i + 1?
// ?hzz?j ? ????j++??? row - j + 1?
// ?lzz?col - i + 1??lzz-- ??? col - hzz + 1?
// ?hzz?j? ? hzz??? row - hzz + 2 ?
// ?????????????
count = 0;
h = row;
l = col;
hzz = 1;
lzz = 1;
i = 1;
j = 1;
while (count <= row * col)
{
for (lzz = j; lzz <= col - (j - 1); lzz++) //???????
{
cout << a[i][lzz] << endl;
count++;
if (count == row * col) return 0;
}
j = lzz - 1; //?????????lzz+1
for (hzz = i + 1; hzz <= row - i + 1; hzz++) // ?????
{
cout << a[hzz][j] << endl;
count++;
if (count == row * col) return 0;
}
i = hzz - 1;
for (lzz = j - 1; lzz >= col - j + 1; lzz--)
{
cout << a[i][lzz] << endl;
count++;
if (count == row * col) return 0;
}
j = lzz + 1;
for (hzz = i - 1; hzz >= row - i + 2; hzz--)
{
cout << a[hzz][j] << endl;
count++;
if (count == row * col) return 0;
}
j = j + 1;
i = hzz + 1;
}
return 0;
}
|
46 | 22959 | int main (){
int r,c,i,k,j,p;
scanf("%d %d",&r,&c);
int a[1000][1000];
for(i=0;i<r;i++){
for(k=0;k<c;k++){
scanf("%d",&a[i][k]);
}
}
int s=0;
int h=0;
i=0;
j=0;
p=r*c;
while(j<p){
for(i=s,k=h;k<c;k++){
if(j<p){
printf("%d\n",a[i][k]);
j++;
}
}
s++;
for(i=s,k=c-1;i<r;i++){
if(j<p){
printf("%d\n",a[i][k]);
j++;
}
}
c--;
for(k=c-1,i=r-1;k>=h;k--){
if(j<p){
printf("%d\n",a[i][k]);
j++;
}
}
r--;
for(i=r-1,k=h;i>=s;i--){
if(j<p){
printf("%d\n",a[i][k]);
j++;
}
}
h++;
}
return 0;
}
|
46 | 22960 | int main()
{
int n,m,M,N,i,t,e,k,s[200][200];
scanf("%d%d", &N, &M);
t=M*N;
e=0;
for(n=0;n<N;n++)
{
for(m=0;m<M;m++)
{
scanf("%d", &s[n][m]);
}
}
for(k=0;k<103;k++)
{
for(i=k;i<M-k;i++)
{
printf("%d\n", s[k][i]);
e++;
}
if(e==t)
{
break;
}
for(i=k+1;i<N-k;i++)
{
printf("%d\n", s[i][M-k-1]);
e++;
}
if(e==t)
{
break;
}
for(i=M-k-2;i>k-1;i--)
{
printf("%d\n", s[N-k-1][i]);
e++;
}
if(e==t)
{
break;
}
for(i=N-k-2;i>k;i--)
{
printf("%d\n", s[i][k]);
e++;
}
if(e==t)
{
break;
}
}
return 0;
}
|
46 | 22961 | int main(){
int row,col,i,j,time=0,n,a[100][100],max;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
if(row>col){
max=row;
}
else{
max=col;
}
for(n=0;n<max;n++){
for(j=n;j<col-n;j++){
printf("%d\n",a[n][j]);
time++;
}
if(time==row*col){
break;
}
for(i=n+1;i<row-n;i++){
printf("%d\n",a[i][col-n-1]);
time++;
}
if(time==row*col){
break;
}
for(j=col-n-2;j>=n;j--){
printf("%d\n",a[row-1-n][j]);
time++;
}
if(time==row*col){
break;
}
for(i=row-n-2;i>n;i--){
printf("%d\n",a[i][n]);
time++;
}
if(time==row*col){
break;
}
}
return 0;
} |
46 | 22962 | int main(){
int ROW,COL,a[100][100];
scanf("%d%d",&ROW,&COL);
for(int row=0;row<ROW;row++){
for(int col=0;col<COL;col++){
scanf("%d",&a[row][col]);
}
}
for(int k=0;k<(ROW<COL?(ROW+1)/2:(COL+1)/2);k++){
for(int col=k;col<COL-k-1;col++){
printf("%d\n",a[k][col]);
}
for(int row=k;row<ROW-k-1;row++){
printf("%d\n",a[row][COL-k-1]);
}
for(int col=COL-k-1;(col>k)&&(k!=1.0*(ROW+1)/2-1);col--){
printf("%d\n",a[ROW-k-1][col]);
}
for(int row=ROW-k-1;(row>k)&&(k!=1.0*(COL+1)/2-1);row--){
printf("%d\n",a[row][k]);
}
}
if((ROW%2!=0&&ROW<=COL)||(COL%2!=0&&COL<=ROW)){
printf("%d",a[ROW-(ROW<COL?(ROW+1)/2:(COL+1)/2)][COL-(ROW<COL?(ROW+1)/2:(COL+1)/2)]);
}
return 0;
} |
46 | 22963 | int main()
{
int row,col;
int i,j,n,time=0;
scanf("%d%d",&row,&col);
int array[R][C];
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-1;i++)
{
printf("%d\n",array[n][i]);
time++;
}
if(time==row*col) break;
for(j=n+1;j<=row-n-1;j++)
{
printf("%d\n",array[j][col-n-1]);
time++;
}
if(time==row*col) break;
for(i=col-n-2;i>=n;i--)
{
printf("%d\n",array[row-n-1][i]);
time++;
}
if(time==row*col) break;
for(j=row-n-2;j>=n+1;j--)
{
printf("%d\n",array[j][n]);
time++;
}
if(time==row*col) break;
}
return 0;
} |
46 | 22964 | int rp,re,lp,le;
int a[300][300];
int print(int rp,int re,int lp,int le,int r,int l)
{
int i,j;
if(rp>re||lp>le) return 0;
if(l==lp&&r==rp)
{
for(i=rp,j=lp;j<=le;j++)
printf("%d\n",a[i][j]);
print(rp+1,re,lp,le,rp+1,le);
return 0;
}
if(l==le&&r==rp)
{
for(i=rp,j=le;i<=re;i++)
printf("%d\n",a[i][j]);
print(rp,re,lp,le-1,re,le-1);
return 0;
}
if(l==le&&r==re)
{
for(i=re,j=le;j>=lp;j--)
printf("%d\n",a[i][j]);
print(rp,re-1,lp,le,re-1,lp);
return 0;
}
if(l==lp&&r==re)
{
for(i=re,j=lp;i>=rp;i--)
printf("%d\n",a[i][j]);
print(rp,re,lp+1,le,rp,lp+1);
return 0;
}
}
int main()
{
int r,l;
scanf("%d %d",&r,&l);
int i,j;
for(i=1;i<=r;i++)
for(j=1;j<=l;j++)
scanf("%d",&a[i][j]);
rp=1;
lp=1;
re=r;
le=l;
print(rp,re,lp,le,1,1);
return 0;
} |
46 | 22965 | int main()
{
int a[100][100];
int i,j,m,n,k,s=0,x,y;
double l=0;
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
i=0;
for(j=0;j<n;j++)
{
printf("%d\n",a[i][j]);
s++;
if(s==m*n)
return 0;
}
i=0;
j=n-1;
for(k=1;k>0;k++)
{
for(x=m-k;x>0;x--)
{
i+=(int)pow(-1,l);
printf("%d\n",a[i][j]);
s++;
if(s==m*n)
return 0;
}
for(x=n-k;x>0;x--)
{
j+=(int)pow(-1,l+1);
printf("%d\n",a[i][j]);
s++;
if(s==m*n)
return 0;
}
l++;
}
}
|
46 | 22966 | int array[99][99];
int x, y, row, col;
void out(int x0, int y0, int wid, int len)
{
x = x0;
y = y0;
for (; x < x0 + wid; x++)
{
cout << array[x][y] << endl;
}
x--;
for (y++; y < y0 + len; y++)
{
cout << array[x][y] << endl;
}
y--;
for (x--; x >= x0; x--)
{
if (wid == 1)
{
break;
}
if (len == 1)
{
break;
}
cout << array[x][y] << endl;
}
x++;
for (y--; y > y0; y--)
{
if (wid == 1)
{
break;
}
if (len == 1)
{
break;
}
cout << array[x][y] << endl;
}
y++;
if (wid <= 2 || len <= 2)
{
1;
}
else
{
out(x0 + 1, y0 + 1, wid - 2, len - 2);
}
}
int main()
{
cin >> row >> col;
for (y = 0; y < row; y++)
{
for (x = 0; x < col; x++)
{
cin >> array[x][y];
}
}
out(0, 0, col, row);
return 0;
} |
46 | 22967 | int main()
{
int array[100][100];
int row,col,m,n;
scanf("%d%d",&m,&n);
int a,x,y,z=0;
for(row=0;row<m;row++){
for(col=0;col<n;col++){
scanf("%d",&array[row][col]);
}
}
for(a=0;a<m+1/2&&a<n+1/2;a++){
x=m-a;
y=n-a;
for(col=a;col<y;col++){
printf("%d\n",array[a][col]);
z+=1;
}
if(z>=m*n){
break;
}
for(row=a+1;row<x;row++){
printf("%d\n",array[row][y-1]);
z+=1;
}
if(z>=m*n){
break;
}
for(col=y-2;col>a-1;col--){
printf("%d\n",array[x-1][col]);
z+=1;
}
if(z>=m*n){
break;
}
for(row=x-2;row>a;row--){
printf("%d\n",array[row][a]);
z+=1;
}
if(z>=m*n){
break;
}
}
return 0;
}
|
46 | 22968 | int main()
{
int i,j,sum=0,c,e,f,m,n,a[100][100];
scanf("%d %d",&m,&n);
for(i=0;i<m;i++){
scanf("%d",&a[i][0]);
for(j=1;j<n;j++){
scanf(" %d",&a[i][j]);
}
}
for(c=0,e=m,f=n;;c++,e--,f--){
for(j=c;j<f;j++){
printf("%d\n",a[c][j]);
sum++;
}
if(sum==m*n)
break;
for(i=c+1;i<e;i++){
printf("%d\n",a[i][f-1]);
sum++;
}
if(sum==m*n)
break;
for(j=f-2;j>c-1;j--){
printf("%d\n",a[e-1][j]);
sum++;
}
if(sum==m*n)
break;
for(i=e-2;i>c;i--){
printf("%d\n",a[i][c]);
sum++;
}
if(sum==m*n)
break;
}
return 0;
}
|
46 | 22969 | int main(){
int s[100][100];
int i=0,j,r,R,C,c,q;
scanf("%d%d",&R,&C);
for(r=0;r<R;r++){
for(c=0;c<C;c++){
scanf("%d",&s[r][c]);
}
}
for(q=0;i<R*C;q++){
for(j=q;j<C-q;j++){
printf("%d\n",s[q][j]);
i++;
if(i==R*C)
return 0;
}
for(j=q+1;j<R-q;j++){
printf("%d\n",s[j][C-1-q]);
i++;
if(i==R*C)
return 0;
}
for(j=C-2-q;j>q-1;j--){
printf("%d\n",s[R-1-q][j]);
i++;
if(i==R*C)
return 0;
}
for(j=R-2-q;j>q;j--){
printf("%d\n",s[j][q]);
i++;
if(i==R*C)
return 0;
}
}
return 0;
}
|
46 | 22970 |
void circle(int list[][100], int row_min, int row_max, int col_min, int col_max)
{
int i,j;
if (row_min==row_max || col_min==col_max) {
for (i=col_min; i<col_max; i++) {
printf("%d\n",list[row_min][i]);
}
for (i=row_min; i<=row_max; i++) {
printf("%d\n",list[i][col_max]);
}
} else {
for (i=col_min; i<col_max; i++) {
printf("%d\n",list[row_min][i]);
}
for (i=row_min; i<row_max; i++) {
printf("%d\n",list[i][col_max]);
}
for (i=col_max; i>col_min; i--) {
printf("%d\n",list[row_max][i]);
}
for (i=row_max; i>row_min; i--) {
printf("%d\n",list[i][col_min]);
}
}
}
int main()
{
int array[100][100];
int i,j;
int sumrow,sumcol;
scanf("%d %d",&sumrow,&sumcol);
for (i=0; i<sumrow; i++) {
for (j=0; j<sumcol; j++) {
scanf("%d",&array[i][j]);
}
}
int row_min=0, row_max=sumrow-1, col_min=0, col_max=sumcol-1;
while (row_min<=row_max && col_min<=col_max) {
circle(array, row_min, row_max, col_min, col_max);
row_min++;
row_max--;
col_min++;
col_max--;
}
return 0;
} |
46 | 22971 |
int main()
{
int a[100][100], b[100][100], row, col, p, q, dir;
cin >> row >> col;
for (int i = 0; i < 100; i++)
{
for (int i1 = 0; i1 < 100; i1++)
{
b[i][i1] = 1;
}
}
for (int i = 0; i < row; i++)
{
for (int i1 = 0; i1 < col; i1++)
{
cin >> a[i][i1];
b[i][i1] = 0;
}
}
p = 0;
q = 0;
dir = 1;
for (int i = 0; i < row * col; i++)
{
cout << a[p][q] << endl;
b[p][q] = 1;
switch(dir)
{
case 1:
if (b[p][q+1] == 0) q++;
else
{
p++;
dir = 2;
}
break;
case 2:
if (b[p+1][q] == 0) p++;
else
{
q--;
dir = 3;
}
break;
case 3:
if (b[p][q-1] == 0) q--;
else
{
p--;
dir = 4;
}
break;
case 4:
if (b[p-1][q] == 0) p--;
else
{
q++;
dir = 1;
}
break;
}
}
return 0;
} |
46 | 22972 | int main()
{
int a[100][100],row,col,i,j,m,k,n,x,y,s=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{scanf("%d",&a[i][j]);
}}
i=row-1;
j=col-1;
for(k=0;k<100;k++)
{x=k;
y=k;
m=k;
n=k;
for(x=k;x<=j-k;x++)
{printf("%d\n",a[k][x]);
s++;}
if(s==(i+1)*(j+1))
{break;}
for(y=k+1;y<=i-k;y++)
{printf("%d\n",a[y][j-k]);
s++;}
if(s==(i+1)*(j+1))
{ break;}
for(m=j-k-1;m>=k;m--)
{printf("%d\n",a[i-k][m]);
s++;}
if(s==(i+1)*(j+1))
{break;}
for(n=i-k-1;n>=k+1;n--)
{printf("%d\n",a[n][k]);
s++;}
if(s==(i+1)*(j+1))
{break;}}
return 0;} |
46 | 22973 | int main()
{
int m,n,a[100][100];
int p,i,j,k,q,s,ys,hs;
scanf("%d %d",&m,&n);
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
if(m<=n)
{
p=m/2;
ys=m%2;
hs=1;
}
else
{
p=n/2;
ys=n%2;
hs=2;
}
for(i=1;i<=p;i++)
{
for(j=i;j<=n-i;j++)
{
printf("%d\n",a[i][j]);
}
for(k=i;k<=m-i;k++)
{printf("%d\n",a[k][n+1-i]);}
for(q=n-i+1;q>=i+1;q--)
{printf("%d\n",a[m+1-i][q]);}
for(s=m+1-i;s>=i+1;s--)
{printf("%d\n",a[s][i]);}
}
if(ys==1)
{
if(hs==1)
{
for(i=(m+1)/2;i<=n-(m-1)/2;i++)
{printf("%d\n",a[(m+1)/2][i]);}
}
if(hs==2)
{
for(i=(n+1)/2;i<=m-(n-1)/2;i++)
{printf("%d\n",a[i][(n+1)/2]);}
}
}
scanf("%d %d",&m,&n);
return 0;
} |
46 | 22974 | int main()
{
int row,col,i,j,k,c=0,h;
cin>>row>>col;
cout<<endl;
k=row*col;
int a[row][col],b[row+2][col+2];
for(i=0;i<=row-1;i++)
{for(j=0;j<=col-1;j++)
{cin>>a[i][j];}
}
for(i=1;i<=row;i++)
{for(j=1;j<=col;j++)
{b[i][j]=1;}
}
for(i=0;i<=col+1;i++)
{b[0][i]=0;b[row+1][i]=0;}
for(j=1;j<=row;j++)
{b[j][0]=0;b[j][col+1]=0;}
i=0;
j=0;
h=1;
while(1>0)
{if(h%4==1&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
j=j+1;
}while(b[i+1][j+1]!=0);
h=h+1;
i=i+1;
j=j-1;
}
if(h%4==2&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
i=i+1;
}while(b[i+1][j+1]!=0);
h=h+1;
j=j-1;
i=i-1;
}
if(h%4==3&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
j=j-1;
}while(b[i+1][j+1]!=0);
h=h+1;
i=i-1;
j=j+1;
}
if(h%4==0&&c<k)
{do
{cout<<a[i][j]<<endl;
b[i+1][j+1]=0;
c=c+1;
i=i-1;
}while(b[i+1][j+1]!=0);
h=h+1;
j=j+1;
i=i+1;
}
if(c==k) break;
}
return 0;
}
|
46 | 22975 |
int main(){
int m,n,sz[100][100],x,y,z,a,b,w=0,i;
int bz[100][100],flag=0;
//bz????????flag=0?????=1?????=2?????=3????
scanf("%d %d",&m,&n);
for(int p=0;p<=m+1;p++)
for(int q=0;q<=n+1;q++)
bz[q][p]=1;//????
for(int p=1;p<=m;p++)
{
for(int q=1;q<=n;q++)
{
scanf("%d",&sz[q][p]);
bz[q][p]=0;
}
}
x=1;y=1;
while(w<m*n)
{
printf("%d\n",sz[x][y]);
bz[x][y]=1;
w++;
switch(flag)
{
case 0:
if(bz[x+1][y]==1)
{
flag=1;//???
y++;
}
else
x++;
break;
case 1:
if(bz[x][y+1]==1)
{
flag=2;//???
x--;
}
else
y++;
break;
case 2:
if(bz[x-1][y]==1)
{
flag=3;//???
y--;
}
else
x--;
break;
case 3:
if(bz[x][y-1]==1)
{
flag=0;//???
x++;
}
else
y--;
break;
}
}
return 0;
}
|
46 | 22976 | int main()
{
int a[100][100],b[10000],i,j,r,c,k=0,row,col,p;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
r=row;
c=col;
if(r>=c){
for(c=col;c>col/2;c--)
{
p=0;
for(j=col-c;j<c;j++)
{
b[k]=a[row-r][j];
k++;
p++;
}
if(p==0)
break;
else
p=0;
for(j=row-r+1;j<r;j++)
{
b[k]=a[j][c-1];
k++;
p++;
}
if(p==0)
break;
else
p=0;
for(j=c-2;j>=col-c;j--)
{
b[k]=a[r-1][j];
k++;
p++;
}
if(p==0)
break;
else
p=0;
for(j=r-2;j>row-r;j--)
{
b[k]=a[j][col-c];
k++;
p++;
}
if(p==0)
break;
else
p=0;
r--;
}
}
if(r<c){
for(r=row;r>row/2;r--)
{
p=0;
for(j=col-c;j<c;j++)
{
b[k]=a[row-r][j];
k++;
p++;
}
if(p==0)
break;
else
p=0;
for(j=row-r+1;j<r;j++)
{
b[k]=a[j][c-1];
k++;
p++;
}
if(p==0)
break;
else
p=0;
for(j=c-2;j>=col-c;j--)
{
b[k]=a[r-1][j];
k++;
p++;
}
if(p==0)
break;
else
p=0;
for(j=r-2;j>row-r;j--)
{
b[k]=a[j][col-c];
k++;
p++;
}
if(p==0)
break;
else
p=0;
c--;
}
}
printf("%d",b[0]);
for(i=1;i<k;i++)
printf("\n%d",b[i]);
return 0;
} |
46 | 22977 | int main()
{
int i,j,m,n,a[101][101],k=0;
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;k!=m*n;i++)
{
for(j=i;j<n-i;j++)
{
printf("%d\n",a[i][j]);
k++;
if(k==m*n)
break;
}
if(k==m*n)
break;
for(j=i+1;j<m-i;j++)
{
printf("%d\n",a[j][n-1-i]);
k++;
if(k==m*n)
break;
}
if(k==m*n)
break;
for(j=n-i-2;j>=i;j--)
{
printf("%d\n",a[m-1-i][j]);
k++;
if(k==m*n)
break;
}
if(k==m*n)
break;
for(j=m-i-2;j>i;j--)
{
printf("%d\n",a[j][i]);
k++;
if(k==m*n)
break;
}
if(k==m*n)
break;
}
return 0;
}
|
46 | 22978 | int main()
{
int array[110][110];
int row, col;
int rowup = 0, rowdown = 0, colleft = 0, colright = 0;
cin >> row >> col;
for (int i = 1; i <= row; i++)
{
for (int j = 1; j <= col; j++)
{
cin >> array[i][j];
}
}
while (1)
{
for (int k = colleft + 1; k <= col - colright; k++)
{
cout << array[rowup + 1][k] << endl;
}
rowup++;
if (rowup + rowdown >= row)
break;
for (int k = rowup + 1; k <= row - rowdown; k++)
{
cout << array[k][col - colright] << endl;
}
colright++;
if (colright + colleft >= col)
break;
for (int k = col - colright; k >= colleft + 1; k--)
{
cout << array[row - rowdown][k] << endl;
}
rowdown++;
if (rowup + rowdown >= row)
break;
for (int k = row - rowdown; k >= rowup + 1; k--)
{
cout << array[k][colleft + 1] << endl;
}
colleft++;
if (colright + colleft >= col)
break;
}
return 0;
} |
46 | 22979 |
int main(int argc, char* argv[])
{int a[100][100],row,col,i,j,n=0;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
j=0;
do
{
for(i=0+j;i<col-j;i++)
{
printf("%d\n",a[j][i]);
n++;
}if(n==row*col)break;
for(i=j+1;i<row-j;i++)
{
printf("%d\n",a[i][col-1-j]);
n++;
}if(n==row*col)break;
for(i=col-2-j;i>0+j;i--)
{
printf("%d\n",a[row-j-1][i]);
n++;
}if(n==row*col)break;
for(i=row-j-1;i>0+j;i--)
{
printf("%d\n",a[i][j]);
n++;
}if(n==row*col)break;
j++;
}
while(n!=row*col);
return 0;
} |
46 | 22980 | int main()
{
int i,j,k=0,b=1,h=1,l=1,x,y,a[100][100];
scanf("%d%d",&x,&y);
for(i=1;i<=x;i++)
{for(j=1;j<=y;j++)
{scanf("%d",&a[i][j]);}}
while(k<x*y-1)
{switch(b)
{case 1:
{for(i=h;i<=y-h;i++)
{printf("%d\n",a[h][i]);}
b=2;
k+=y-2*h+1;break;}
case 2:
{for(i=l;i<=x-l;i++)
{printf("%d\n",a[i][y-l+1]);}
b=3;
k+=x-2*l+1;break;}
case 3:
{for(i=y-h+1;i>=h+1;i--)
{printf("%d\n",a[x-h+1][i]);}
b=4;
k+=y-2*h+1;
h++;break;}
case 4:
{for(i=x-l+1;i>=l+1;i--)
{printf("%d\n",a[i][l]);}
b=1;
k+=x-2*l+1;
l++;break;}}}
if(x==y)
{printf("%d",a[h][l]);}
else if(b==2){printf("%d",a[h][y-h+1]);}
else if(b==3){printf("%d",a[x-l+1][y-l+1]);}
else if(b==4){printf("%d",a[x-h+1][h]);}
else if(b==1){printf("%d",a[l][l]);}
return 0;
}
|
46 | 22981 | int main()
{
int an[100][100];
int i,j,m,n,k,s;
scanf("%d%d",&n,&m);
for(j=0;j<n;j++)
{
for(i=0;i<m;i++) scanf("%d",&an[i][j]);
}
s=0;
for(k=0;k<m/2&&k<n/2;k++)
{
for(i=k;i<m-k-1;i++) printf("%d\n",an[i][k]);
for(j=k;j<n-k-1;j++) printf("%d\n",an[m-k-1][j]);
for(i=m-k-1;i>k;i--) printf("%d\n",an[i][n-k-1]);
for(j=n-k-1;j>k;j--) printf("%d\n",an[k][j]);
s=s+2*(m+n-4*k-2);
}
if(s!=m*n)
{
if(m<n) { for(j=k;j<n-k;j++) printf("%d\n",an[k][j]);}
if(m>n) { for(i=k;i<m-k;i++) printf("%d\n",an[i][k]);}
if(m==n) printf("%d\n",an[k][k]);
}
return 0;
} |
46 | 22982 | int main()
{
int array[100][100],s[10000],row,col,i,j,k,l,h,a,b,c;
scanf("%d%d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&array[i][j]);
}
}
b=row;
c=col;
if(b>c)
{
a=b;
b=c;
c=a;
}
a=b;
if(a%2==0)
{
l=a/2;
}
else
{
l=a/2+1;
}
k=0;
for(h=0;h<l;h++)
{
for(j=h;j<col-h;j++)
{
s[k]=array[h][j];
k++;
}
for(i=h+1;i<row-h;i++)
{
s[k]=array[i][col-1-h];
k++;
}
for(j=col-2-h;j>=h;j--)
{
s[k]=array[row-1-h][j];
k++;
}
for(i=row-2-h;i>h;i--)
{
s[k]=array[i][h];
k++;
}
}
for(k=0;k<row*col;k++)
{
printf("%d\n",s[k]);
}
return 0;
} |
46 | 22983 | int main(){
int row,col;
cin>>row>>col;
int a[105][105];
memset(a,-1,sizeof(a));//???????
int x=0,y=0,st=1;
for(int i=0;i<row;i++)//??
for(int j=0;j<col;j++)
cin>>a[i][j];
while(true){
if(st==1){//?
cout<<a[x][y]<<endl;
a[x][y]=-1;
y++;
if(a[x][y]==-1){//??
st=2;
y--;
x++;
if(a[x][y]==-1)//??
break;
}
}
else if(st==2){//?
cout<<a[x][y]<<endl;
a[x][y]=-1;
x++;
if(a[x][y]==-1){
st=3;
x--;
y--;
if(a[x][y]==-1)
break;
}
}
else if(st==3){//?
cout<<a[x][y]<<endl;
a[x][y]=-1;
y--;
if(y<0){//??
y=0;
st=4;
x--;
}
if(a[x][y]==-1){
st=4;
y++;
x--;
if(a[x][y]==-1)
break;
}
}
else if(st==4){//?
cout<<a[x][y]<<endl;
a[x][y]=-1;
x--;
if(a[x][y]==-1){
st=1;
x++;
y++;
if(a[x][y]==-1)
break;
}
}
}
return 0;
} |
46 | 22984 | void main()
{
int row,col,i,j,x=0,n;
int a[100][100];
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
{
scanf("%d",&a[i][j]);
}
}
for(n=0;;n++)
{
for(i=n;i<col-n;i++)
{
printf("%d\n",a[n][i]);
x++;
}
for(j=n+1;j<row-n;j++)
{
printf("%d\n",a[j][col-n-1]);
x++;
}
if(x==row*col)
break;
for(i=col-n-2;i>n-1;i--)
{
printf("%d\n",a[row-n-1][i]);
x++;
}
for(j=row-n-2;j>n;j--)
{
printf("%d\n",a[j][n]);
x++;
}
}
} |
46 | 22985 | /*????????
?????
??????
???????????????*/
int main()
{
int hang,lie;
cin>>hang>>lie;//?????
int a[100][100];
int i,j;
for(i=1;i<=hang;i++)
{
for(j=1;j<=lie;j++) cin>>a[i][j]; //????
}
int sum=0,quan=1;
while(sum<hang*lie)
{
for(i=quan;i<=lie-quan+1;i++) {cout<<a[quan][i]<<endl; sum++;} if(sum==hang*lie) break; //????????????????????????
for(i=quan+1;i<=hang-quan+1;i++){cout<<a[i][lie-quan+1]<<endl; sum++;} if(sum==hang*lie) break;
for(i=lie-quan;i>=quan;i--) {cout<<a[hang-quan+1][i]<<endl; sum++;} if(sum==hang*lie) break;
for(i=hang-quan;i>=quan+1;i--){cout<<a[i][quan]<<endl; sum++;} if(sum==hang*lie) break;
quan++;
}
return 0;
} |
46 | 22986 | void main()
{
int i,j,r,c,num=0,a[100][100],k;
scanf("%d%d",&r,&c);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
k=r*c;
for(i=0;;i++)
{
for(j=i;j<=c-1-i;j++)
{
printf("%d\n",a[i][j]);
num=num+1;
if(num==k)
break;
}
if(num==k)
break;
for(j=i+1;j<=r-1-i;j++)
{
printf("%d\n",a[j][c-i-1]);
num=num+1;
if(num==k)
break;
}
if(num==k)
break;
for(j=c-i-2;j>=i;j--)
{
printf("%d\n",a[r-1-i][j]);
num=num+1;
if(num==k)
break;
}
if(num==k)
break;
for(j=r-i-2;j>=(i+1);j--)
{
printf("%d\n",a[j][i]);
num=num+1;
if(num==k)
break;
}
if(num==k)
break;
}
} |
46 | 22987 | int main()
{
int ROW,COL,b[100][100],row,col;
scanf("%d",&ROW);
scanf("%d",&COL);
for(row=0;row<ROW;row++)
{
for(col=0;col<COL;col++)
{
scanf("%d",&(b[row][col]));
}
}
row=0;
col=0;
int i=0,k=0;
while(i<ROW&&k<COL)
{
for(col=k;col<COL-k;col++)
{
if(b[row][col]!=0)
{
printf("%d\n",b[row][col]);
b[row][col]=0;
}
else
{
return 0;
}
}
col--;
for(row=1+i;row<ROW-i;row++)
{
if(b[row][col]!=0)
{
printf("%d\n",b[row][col]);
b[row][col]=0;
}
else
{
return 0;
}
}
row--;
for(col=col-1;col>=k;col--)
{
if(b[row][col]!=0)
{
printf("%d\n",b[row][col]);
b[row][col]=0;
}
else
{
return 0;
}
}
col++;
i++;
for(row=row-1;row>=i;row--)
{
if(b[row][col]!=0)
{
printf("%d\n",b[row][col]);
b[row][col]=0;
}
else
{
return 0;
}
}
row++;
k++;
}
return 0;
}
|
46 | 22988 | int main()
{
int a[100][100]={0},row,col,i=0,j=0,t=0,s=0;
scanf("%d %d",&row,&col);
for(i=0;i<row;i++)
{
for(j=0;j<col;j++)
scanf("%d",&a[i][j]);
}
i=0;
j=0;
do
{
for(j=t;j<col-t;j++)
printf("%d\n",a[i][j]);
j-=1;
if(2*s+1==row) break;
for(i=s+1;i<row-s;i++)
printf("%d\n",a[i][j]);
i-=1;
t+=1;
if(col==t+s) break;
for(j=col-t-1;j>=s;j--)
printf("%d\n",a[i][j]);
j+=1;
s+=1;
if(row==s+t) break;
for(i=row-s-1;i>=t;i--)
printf("%d\n",a[i][j]);
i+=1;
if(col==2*t) break;
}
while(t!=col && s!=row);
return 0;
}
|
46 | 22989 |
int main()
{
int row,col,k=1,l=0,i,j;
scanf("%d %d",&row,&col);
int sz[100][100];
for(i=0;i<row;i++){
for(j=0;j<col;j++){
scanf("%d",&sz[i][j]);
}
}
if(row==1&&col==1)
printf("%d",sz[0][0]);
else{
for(i=0;i<row*col;)
{
for(j=l;j<col-l;j++)
{
printf("%d\n",sz[l][j]);
i++;if(i==row*col) break;
}
if(i==row*col) break;
for(j=l+1;j<row-1-l;j++)
{
printf("%d\n",sz[j][col-1-l]);
i++;if(i==row*col) break;
} if(i==row*col) break;
for(j=col-1-l;j>=l;j--)
{
printf("%d\n",sz[row-1-l][j]);
i++;if(i==row*col) break;
} if(i==row*col) break;
for(j=row-2-l;j>l;j--)
{
printf("%d\n",sz[j][l]);
i++;if(i==row*col) break;
} if(i==row*col) break;
l++;
}
}
return 0;
}
|
46 | 22990 | int main()
{
int m,n,i,j,k,a,b,c;
int sz[100][100];
scanf("%d %d",&m,&n);
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&sz[i][j]);
}
}
for(i=0,a=0,b=1,j=0,k=0;i<m*n;i++,j+=a,k+=b)
{
printf("%d\n",sz[j][k]);
if(a==0&&b==1&&j+k==n-1)
{
a=1;
b=0;
}
else if(a==1&&b==0&&j-k==m-n)
{
a=0;
b=-1;
}
else if(a==0&&b==-1&&j+k==m-1)
{
a=-1;
b=0;
}
else if(a==-1&&b==0&&j-k==1)
{
a=0;
b=1;
}
}
return 0;
}
|
46 | 22991 |
int main()
{
int col,row,n,t,j,m,i,k,l;
int a[101][101]={0},b[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=1;i<=row;i++)
{
b[i][0]=1;
b[i][col+1]=1;
}
for (j=1;j<=col;j++)
{
b[0][j]=1;
b[row+1][j]=1;
}
m=0;i=1;j=1;
while (m<col*row)
{
printf("%d\n",a[i][j]);
m=m+1;
b[i][j]=1;
if (b[i-1][j]==1)
{
if (b[i][j-1]==1)
{
if (b[i][j+1]==0)
j++;
else
i++;
}
else
if (b[i+1][j]==0)
i++;
else
j--;
}
else
if (b[i][j-1]==0)
j--;
else
i--;
}
return 0;
} |
46 | 22992 | int main()
{
int row,col;
scanf("%d %d",&row,&col);
int sz[100][100];
int p,q;
for(p=0;p<row;p++)
{
for(q=0;q<col;q++)
{
scanf("%d",&sz[p][q]);
}
}
int ROW,COL;
int row1=0,row2=row-1;
int col1=0,col2=col-1;
for(;(row1<=row2)&&(col1<=col2);)
{
if((row1<=row2)&&(col1<=col2))
{
for(COL=col1;COL<=col2;COL++)
{
printf("%d\n",sz[row1][COL]);
}
row1=row1+1;
}
if((row1<=row2)&&(col1<=col2))
{
for(ROW=row1;ROW<=row2;ROW++)
{
printf("%d\n",sz[ROW][col2]);
}
col2=col2-1;
}
if((row1<=row2)&&(col1<=col2))
{
for(COL=col2;COL>=col1;COL--)
{
printf("%d\n",sz[row2][COL]);
}
row2=row2-1;
}
if((row1<=row2)&&(col1<=col2))
{
for(ROW=row2;ROW>=row1;ROW--)
{
printf("%d\n",sz[ROW][col1]);
}
col1=col1+1;
}
}
return 0;
}
|
46 | 22993 | int main(){
int row,col;
int a[110][110];
int i,j;
int r,l,u,d,cntr,cntc,g;
scanf("%d%d",&row,&col);
for (i=0;i<row;i++){
for (j=0;j<col;j++){
scanf("%d",&a[i][j]);
}
}
r=0;
u=0;
l=row-1;
d=col-1;
cntr=0;
cntc=0;
i=0;
j=0;
g=0;
for(g=0;(g<=row/2+1)&&(g<=col/2+1);g++){
while ((cntr!=row)&&(cntc!=col)&&(cntr%2==0)&&(cntr-cntc==0)){
printf("%d\n",a[i][j]);
if (j==d){
r++;
cntr++;
i++;
}
else if(j!=d){
j++;
}
}
while((cntr!=row)&&(cntc!=col)&&(cntc%2==0)){
printf("%d\n",a[i][j]);
if (i==l){
d--;
cntc++;
j--;
}
else{
i++;
}
}
while((cntr!=row)&&(cntc!=col)&&(cntr%2!=0)){
printf("%d\n",a[i][j]);
if (j==u){
u++;
cntr++;
i--;
}
else{
j--;
}
}
while((cntr!=row)&&(cntc!=col)&&(cntc%2!=0)){
printf("%d\n",a[i][j]);
if (i==r){
l--;
cntc++;
j++;
}
else{
i--;
}
}
}
return 0;
} |
46 | 22994 | void main()
{
int a[100][100];
int rowm,coln,i,j,row,col;
rowm=1;
coln=0;
scanf("%d %d",&row,&col);
for(i=1;i<=row;i++)
for(j=1;j<=col;j++)
scanf("%d",&a[i][j]);
i=1;j=0;
while(1){
if(coln>=col) break;
for(i=rowm,j++;j<=col;j++)
printf("%d\n",a[i][j]);
coln++;
if(rowm>=row) break;
for(j=col,i++;i<=row;i++)
printf("%d\n",a[i][j]);
rowm++;
if(coln>=col) break;
for(i=row,j--;j>=coln;j--)
printf("%d\n",a[i][j]);
col--;
if(rowm>=row) break;
for(j=coln,i--;i>=rowm;i--)
printf("%d\n",a[i][j]);
row--;
}
} |
46 | 22995 |
int main()
{
int row,col,i,j,k,l,m;
int a[100][100];
int b[10000];
cin>>row>>col;
for( i=0 ; i<row ; i++ )
{
for( j=0 ; j<col ; j++ )
{
cin>>a[i][j];
}
}
for( i=0 ; i<=row/2 ; i++ )
{
for( j=i ; j<col-i ; j++ )
{
cout<<a[i][j]<<endl;
if( j==col-i-1 )
{
for( k=i+1 ; k<row-i ; k++ )
{
cout<<a[k][j]<<endl;
if( k==row-i-1 )
{
for( l=col-i-2 ; l>=i ; l-- )
{
cout<<a[k][l]<<endl;
if( l==i )
{
for( m=row-i-2 ; m>i ; m-- )
{
cout<<a[m][l]<<endl;
}
}
}
}
}
}
}
}
} |
46 | 22996 | void main()
{int a,s,k,i,j,x[100][100],row,col;
scanf("%d", &row);
scanf("%d", &col);
a=0;
for (i=1;i<=row;i++)
{for (j=1;j<=col;j++)
scanf("%d", &x[i][j]);}
for (k=1;k<=(row+1)/2&&k<=(col+1)/2;k++)
{if (k<=row/2&&k<=col/2) s=0;
else s=1;
for (i=k;i<=col-k+1;i++,a++)
{printf("%d\n", x[k][i]);
}if (a>=col*row) break;
for (j=k+1;j<=row-k;j++,a++)
{printf("%d\n", x[j][col-k+1]);
}if (a>=col*row) break;
for (i=col-k+1;i>=k;i--,a++)
{printf("%d\n", x[row-k+1][i]);
}if (a>=col*row) break;
for (j=row-k;j>k;j--,a++)
{printf("%d\n", x[j][k]);
}if (a>=col*row) break;
}
} |
46 | 22997 | int main()
{
int m,n;
scanf("%d%d",&m,&n);
int sz[m+2][n+2];
for(int i=0;i<m+2;i++)
{
for(int k=0;k<n+2;k++)
{
sz[i][k]=0;
}
}
for(int i=1;i<m+1;i++)
{
for(int k=1;k<n+1;k++)
{
scanf("%d",&sz[i][k]);
}
}
int i=1,j=1;
while(i<m+1&&j<n+1)
{
printf("%d\n",sz[i][j]);
sz[i][j]=0;
if(sz[i][j+1]!=0&&sz[i][j-1]==0&&sz[i-1][j]==0)
{
j++;
}
else if(sz[i+1][j]!=0&&sz[i][j+1]==0&&sz[i-1][j]==0)
{
i++;
}
else if(sz[i+1][j]==0&&sz[i][j-1]!=0&&sz[i][j+1]==0)
{
j--;
}
else if(sz[i][j-1]==0&&sz[i+1][j]==0&&sz[i-1][j]!=0)
{
i--;
}
else if(sz[i][j-1]==0&&sz[i+1][j]==0&&sz[i-1][j]==0&&sz[i][j+1]==0)
{
break;
}
}
return 0;
}
|
46 | 22998 | int main()
{
int a[100][100] = { 0 } , b[10000] = { 0 } ;
int r , l ;
int i , j = 0 , k = 0 ;
cin >> r >> l ;
int n = 0 , s = r - 1 , e = l - 1 , w = 0 ;
for ( i = 0 ; i < r ; i++ )
for ( j = 0 ; j < l ; j++ )
cin >> a[i][j] ;
i = 0 ;
while ( i <= r * l )
{
k = n ; j = w ;
for ( j = w ; j <= e ; j++ )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
}// j = e + 1
if ( i == r * l )
break ;
j-- ;
for ( k = n + 1 ; k <= s - 1 ; k++ )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
}// j=e , k = s - 1 ;
if ( i == r * l )
break ;
for ( j = e ; j >= w ; j-- )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
} // j = w - 1
if ( i == r * l )
break ;
j++ ;
for ( k = s - 1 ; k >= n + 1 ; k-- )
{
cout << a[k][j] << endl ;
i++ ;
if ( i == r * l )
break ;
}
// k = n
if ( i == r * l )
break ;
n++ ; s-- ; e-- ; w++ ;
}
return 0 ;
} |
46 | 22999 | //********************************
//*??????????? **
//*?????? 1300012957 **
//*???2013.11.12 **
//********************************
int main ( )
{
int array[100][100]; //????????????????
int row, col; //row?????col????
cin >> row >> col;
int i,j,k,a,b,c,d; //k?????ij???????a,b,c,d??????????
int A=0,B=0,C=0; //A?B?C?????????????????
int sum=0; //sum ???????????????
for( i = 0 ; i <= row - 1 ; i++ )
{
for( j = 0 ; j <= col - 1 ; j++ )
{
cin >> array[i][j] ; //??????
}
}
for( k = 0 ; ; k++ ) //?k?????
{
for( a = k ; a <= col - k - 1 ; a++ )
{
cout << array[k][a] << endl ; //???k+1? ?a+1???
sum++ ; //sum????
if( a == col - k - 1 )
A = array[k][a] ; //?????????????????????
}
if( sum == row * col )
break ; //?????????????????????????????
for( b = k ; b <= row - k - 1 ; b++ )
{
if( array[b][col-k-1] == A )
continue ; //???????????
cout << array[b][col-k-1] << endl ; //???k+1??b+1???
sum++ ; //sum??????????
if(b == row - k - 1 )
B = array[b][col-k-1] ; //????????????????????
}
if( sum == row * col )
break; //?????????????????????????????
for( c = col - k - 1 ; c >= k ; c-- )
{
if( array[row-k-1][c] == B )
continue ; //???????????
cout << array[row-k-1][c] << endl ;
sum++ ; //sum??????????
if( c == k )
C = array[row-k-1][c] ; //????????????????????
}
if( sum == row * col )
break ; //?????????????????????????????
for( d = row - k - 1 ; d >= k+1 ; d-- )
{
if( array[d][k] == C )
continue ; //???????????
cout << array[d][k] << endl ;
sum++ ; //sum??????????
}
if( sum == row*col )
break ; //?????????????????????????????
}
return 0 ;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.