Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
127823 左维哲 矩阵右移动 C++ Wrong Answer 1 MS 264 KB 705 2025-07-29 14:19:37

Tests(0/2):


Code:

#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; }


Run Info:

------Input------
2 3 1 2 3 4 5 6 7 8 9
------Answer-----
2 3 1 5 6 4 8 9 7
------Your output-----
2 3 15775231 5 6 0 8 9 0