矩阵的移动

最新推荐文章于 2024-10-02 20:11:23 发布

Java~~

最新推荐文章于 2024-10-02 20:11:23 发布

阅读量52

点赞数

分类专栏： # PTA 文章标签：矩阵算法 java

本文链接：https://blog.csdn.net/qq_27378595/article/details/131214180

版权

PTA 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

矩阵的移动

在这里插入图片描述

import java.util.Scanner;
public class Main63 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m,n;
        m = sc.nextInt();
        n = sc.nextInt();
        int arr[][] = new int[15][15];
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                arr[i][j] = sc.nextInt();
            }
        }
        m %= n;
        for (int i = 1; i <= n; i++) {
            for (int j = n; j >= 1; j--) {
                arr[i][j+m] = arr[i][j];
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = n + m; j >= n + 1; j--) {
                arr[i][j-n] = arr[i][j];
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                System.out.print(arr[i][j] +" ");
            }
            System.out.println();
        }
    }
}