PTA L1-7 矩阵列平移
#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int a[N][N];
int n, k, x;
void solve() {
int t = 0;
/*for (int i = 1; i <= n; i++) {
}*/
for (int i = 2; i <= n; i += 2) {
t = (t + 1) % (k + 1);
if (t == 0)
t++;
for (int j = n; j - t >= 1; j--) {
a[j][i] = a[j - t][i];
}
for (int j = 1; j <= t; j++) {
a[j][i] = x;
}
}
}
int main() {
cin >> n>>k>>x;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
}
}
solve();
int res = 0;
for (int i = 1; i <= n; i++) {
res = 0;
for (int j = 1; j <= n; j++) {
res += a[i][j];
}
if (i != 1) cout << " ";
cout << res ;
}
}
凉心哥哥的小宝藏 文章被收录于专栏
c++
