Run ID:127823

提交时间:2025-07-29 14:19:37

#include<iostream> using namespace std; int main() { int m, n; int n1; scanf("%d %d", &m, &n); int m1 = m % n; int matrix1[n][n]; int matrix2[n][n]; for (int i = 0; i <= n - 1; i++) { for (int j = 0; j <= n - 1; j++) { scanf("%d", &matrix1[i][j]); } } for (int i = 0; i <= n - 1; i++) { for (int j = 0; j <= n - 1; j++) { if (j + m1 > n - 1) { matrix2[i][j + m1 - n] = matrix1[i][j]; } else if (j + m1 < n - 1) { matrix2[i][j + m1] = matrix1[i][j]; } } } for (int i = 0; i <= n - 1; i++) { for (int j = 0; j <= n - 1; j++) { printf("%d", matrix2[i][j]); printf(" "); } if (i == n - 1)break; printf("\n"); } return 0; }