Run ID:49310
提交时间:2023-06-25 15:07:49
# include<iostream> # include<cmath> //abs() 导入库后求绝对值 # include<cstdio> using namespace std; int main(){ //OJ1481 /*int n,i,j,sum=0,k=1; cin>>n; int a[n][n]; for (i=1;i<=n;i++){ for (j=1;j<=n;j++){ cin>>a[i][j]; } } for (i=1;i<=n;i++){ sum=0; for (j=1;j<=n;j++){ if (a[i][j]==1){ sum++; } } if (sum%2!=0){ k=0; } } for (i=1;i<=n;i++){ sum=0; for (j=1;j<=n;j++){ if (a[j][i]==1){ sum++; } } if (sum%2!=0){ k=0; } } if (k==1){ cout<<"OK"<<endl; } else{ cout<<"Corrupt"<<endl; }*/ /*int i=0,j=0,n,num=0; int arr[100][100]={0}; scanf("%d",&n); for (i=0;i<n;i++){ for (j=0;j<n;j++){ scanf("%d",&arr[i][j]); } } for (i=0;i<n;i++){ num=0; for (j=0;j<n;j++){ if (arr[i][j]==1){ num++; } } if (num%2!=0){ printf("Corrupt\n"); return 0; } } for (i=0;i<n;i++){ num=0; for (j=0;j<n;j++){ if (arr[j][i]==1){ num++; } } if (num%2!=0){ printf("Corrupt\n"); return 0; } } printf("OK\n");*/ //OJ1482 /*int i,j,n,k; cin>>n; int a[n][n]; for (k=1;k<=n;k++){ for (i=k;i<=n;i++){ for (j=k;j<=n;j++){ a[i][j]=k; } } } for (i=1;i<=n;i++){ for (j=1;j<n;j++){ cout<<a[i][j]<<" "; } cout<<a[i][n]<<endl; }*/ //OJ1483 /*int n,i,j,t=1; cin>>n; int a[n][n]; for (i=0;i<n;i++){ if (i%2==0){ for (j=0;j<n;j++){ a[j][i]=t++; } } else{ for (j=n-1;j>=0;j--){ a[j][i]=t++; } } } for (i=0;i<n;i++){ for (j=0;j<n;j++){ printf("%d",a[i][j]); } cout<<endl; }*/ //作业:OJ1484 int n,i=0,j,t=1; cin>>n; int a[n][n]; while (t<=n*n){ for (j=i;j<n-i && t<=n*n;j++){ a[i][j]=t++; } for (j=i+1;j<n-i && t<=n*n;j++){ a[j][n-i-1]=t++; } for (j=n-i-2;j>=i && t<=n*n;j--){ a[n-i-1][j]=t++; } for (j=n-i-2;j>i && t<=n*n;j--){ a[j][i]=t++; } i++; } for (i=0;i<n;i++){ for(j=0;j<n;j++){ printf("%4d",a[i][j]); } cout<<endl; } return 0; }