1105. Spiral Matrix (25) 模拟
2018-03-17 15:19
375 查看
#include<bits/stdc++.h> using namespace std; int a[10010][10010],arr[100010]; int main() { int N; cin>>N; for(int i=1;i<=N;i++) cin>>arr[i]; sort(arr+1,arr+1+N); int m=1000000,n=1; for(int i=1;i*i<=N;i++){ if(N%i==0){ if(abs(N/i-i)<abs(m-n)){ m = max(N/i,i); n = min(N/i,i); } } } int cnt=N; for(int c=0;;c++){ for(int i=c;i<n-c;i++){ a[c][i] = arr[cnt--]; } if(cnt<=0)break; for(int i=c+1;i<m-c;i++){ a[i][n-c-1] = arr[cnt--]; } if(cnt<=0)break; for(int i=n-c-2;i>=c;i--){ a[m-c-1][i] = arr[cnt--]; } if(cnt<=0)break; for(int i=m-c-2;i>c;i--){ a[i][c] = arr[cnt--]; } if(cnt<=0)break; } for(int i=0;i<m;i++){ for(int j=0;j<n;j++){ cout<<a[i][j]; if(j==n-1)cout<<endl; else cout<<" "; } } return 0; }
螺旋矩阵
嗯 由于内层的下表和圈数有些关系 所以我们可以外层循环圈数 内层跑四个方向
就是四个方向的index容易出错
相关文章推荐
- PAT甲题题解-1105. Spiral Matrix (25)-(模拟顺时针矩阵)
- PAT - 甲级 - 1105. Spiral Matrix (25)(模拟)
- 1105. Spiral Matrix (25)【模拟】——PAT (Advanced Level) Practise
- 1105. Spiral Matrix (25) 排序、模拟
- 1105. Spiral Matrix (25) -- 模拟
- PAT 1105. Spiral Matrix (25) 螺旋矩阵,二维数组的一维应用及边界模拟
- 1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- PAT1105【Spiral Matrix】 简单模拟
- PAT (Advanced Level) Practise 1105 Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- PTA甲 1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- 【PAT】【Advanced Level】1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- 1105. Spiral Matrix (25)
- PAT (Advanced Level) Practise 1105. Spiral Matrix (25) 蛇形填数