csp202406模拟

1.矩阵重塑
AC！

#include<iostream>
#include<cmath>
using namespace std;

int main() {
	int n, m, p, q, i, j;
	cin>>n>>m>>p>>q;
	int M[n][m], N[p][q], A[m*n];
	int a = 0, b = 0;
	for(i = 0; i < n; i++) {
		for(j = 0; j < m; j++) {
			cin>>M[i][j];
			b = i*m+j-a*q;
			N[a][b] = M[i][j];
			a++;
			if(a == p) a = 0;
		}
	}
	for(i = 0; i < p; i++) {
		for(j = 0; j < q; j++) {
			cout<<N[i][j]<<" ";
			if(j == q-1) cout<<endl;
		}
	}

	
    return 0;
}