1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 | #include<iostream> using namespace std; int main() { int n, m, i, j, ti, tj, num, rsum, csum; int arr1[10], arr[100][100]; int f[2][2] = { {-1,1},{1,0} }; cin >> n; for (int k = 0; k < n; k++) cin >> arr1[k]; for (int k = 0; k < n; k++) { m = arr1[k]; for (int a = 0; a < m; a++) for (int b = 0; b < m; b++) arr[a][b] = 0; i = 0; j = m / 2; num = 2; rsum = 0; csum = 0; arr[i][j] = 1; for (int a = 1; a < m*m; a++) { ti = i + f[0][0]; tj = j + f[0][1]; if ((ti < 0 && tj > m - 1) || (ti >= 0 && tj <= m - 1 && arr[ti][tj] != 0)) { arr[i + f[1][0]][j + f[1][1]] = num; i += f[1][0]; j += f[1][1]; } else if (ti < 0 && tj <= m - 1) { arr[m - 1][tj] = num; i = m - 1; j = tj; } else if (ti >= 0 && tj > m - 1) { arr[ti][0] = num; i = ti; j = 0; } else { arr[ti][tj] = num; i = ti; j = tj; } num++; } for (int a = 0; a < arr1[k]; a++) { for (int b = 0; b < arr1[k]; b++) { if (b > 0) cout << " "; cout << arr[a][b]; } cout << endl; } if (k != n - 1) cout << '-' << endl; } return 0; } |
2019年8月31日 星期六
itsa [C_AR220-易]奇數魔方陣
訂閱:
文章 (Atom)