3 solutions

  • 0
    @ 2024-12-21 11:52:41
    #include<bits/stdc++.h>
    using namespace std;
    const int N=1010;
    int a[N][N];
    int main()
    {
        int n;
        cin>>n;
        for(int q=1;q<=n;q++){
            for(int w=1;w<=n;w++){
                int z=min(min(q,w),min(n-q+1,n-w+1));
                cout<<z;
            }
            cout<<endl;
        }
        return 0;
    }
    
    • 0
      @ 2024-12-1 9:28:36
      #include<bits/stdc++.h>
      using namespace std;
      int a[110][110];
      int main(){
          int n,ai,aj;
          cin>>n;
          for(int i=1;i<=n;i++){
              for(int j=1;j<=n;j++){
                  ai=i<=(n+1)/2?i:n+1-i;
                  aj=j<=(n+1)/2?j:n+1-j;
                  cout<<(ai<aj?ai:aj)<<" ";
              }
              cout<<endl;
          }
          return 0;
      }
      • -4
        @ 2024-6-8 18:56:26

        #include<bits/stdc++.h> using namespace std; int main() { int n; cin>>n; int a[n+10][n+10]; for(int t=1;t<=(n+2-1)/2;t++){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if((i>=t && i<=n+1-t) && (j>=t && j<=n+1-t)){ a[i][j]=t; } }

        }
        }
        for(int i=1;i<=n;i++){
        	for(int j=1;j<=n;j++){
        		cout<<a[i][j]<<" ";
        	}
        	cout<<"\n";
        	}
        

        return 0; }

      • 1

      Information

      ID
      72
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      (None)
      # Submissions
      90
      Accepted
      40
      Uploaded By