9 条题解
-
3
#include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; #define LL long long const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[10][10]; int main() { for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cin >> a[i][j]; if(i == j) { a[i][j] += 10; } if(i + j == 7) { a[i][j] += 10; } } } for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cout << a[i][j] << " "; } puts(""); } return 0; } -
2
ts2024stu008 LV 9 @ 2025-1-24 10:43:14
#include <bits/stdc++.h> using namesapce std; const int N = 1e3 + 10; const int INF = 0x3f3f3f3f; int a[10][10]; int main() { for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cin >> a[i][j]; if(i == j) { a[i][j] += 10; } if(i + j == 7) { a[i][j] += 10; } } } for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cout << a[i][j] << " "; } cout << endI; } return o; }有标志认证，属三无产品，请大家放心食用
-
1
using namespace std; #define LL long long const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[10][10]; int main(){ for(int i = 1; i <= 6; i++){ for(int j = 1; j <= 6; j++){ cin >> a[i][j]; if(i == j){ a[i][j] += 10; } if(i + j == 7){ a[i][j] += 10; } } } for(int i = 1; i <= 6; i++){ for(int j = 1; j <= 6; j++){ cout << a[i][j] << " "; } puts(""); } return 0; } -
1
#include<stdio.h>
#include
using namespace std;
#define LL long long
const int N=1e6+10;
const int INF=0x3f3f3f3f;
int a[15][15];
int main(){
for(int i=1;i<=6;i++)
for(int j=1;j<=6;j++)
cin>>a[i][j];
int sum=1,pro=1,x=6;
for(int i=1;i<=6;i++){
for(int j=1;j<=6;j++){
a[sum][pro]+=10;
a[sum][x]+=10;
sum++;
pro++;
x--;
}
}
for(int i=1;i<=6;i++){
for(int j=1;j<=6;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
} -
0
lianglicheng LV 8 @ 2026-4-19 19:30:55
#include<bits/stdc++.h> using namespace std; const int N=1e5+5; int a[10][10]; int main() { for(int i=1;i<=6;i++) for(int j=1;j<=6;j++) cin>>a[i][j]; for(int i=1;i<=6;i++) { for(int j=1;j<=6;j++) { if(ij) a[i][j]+=10; if(i+j7) a[i][j]+=10; cout <<a[i][j]<<" "; } cout <<endl; } return 0; }************
-
0
cuiyangyang1
LV 7
@ 2024-10-25 18:08:57
#include<bits/stdc++.h> using namespace std; int a[15][15]; int main(){ for(int i=1;i<=6;i++){ for(int j=1;j<=6;j++){ cin>>a[i][j]; if(i==j){ a[i][j]+=10; } if(i+j==7){ a[i][j]+=10; } } } for(int i=1;i<=6;i++){ for(int j=1;j<=6;j++){ cout<<a[i][j]<<" "; } cout<<endl; } return 0; } -
0
#include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; #define LL long long const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[10][10]; int main() { for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cin >> a[i][j]; if(i == j) { a[i][j] += 10; } if(i + j == 7) { a[i][j] += 10; } } } for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cout << a[i][j] << " "; } puts(""); } return 0; } -
0
水题解了
#include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; #define LL long long const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[10][10]; int main() { for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cin >> a[i][j]; if(i == j) { a[i][j] += 10; } } }//一条对角线+输入 for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { if(i + j == 7)//稍微观察一下便知 { a[i][j] += 10; } } }//另一条对角线 for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cout << a[i][j] << " "; } puts(""); }//输出 return 0; }可以缩减成这样
#include <queue> #include <math.h> #include <stack> #include <stdio.h> #include <iostream> #include <vector> #include <iomanip> #include <string.h> #include <algorithm> using namespace std; #define LL long long const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; int a[10][10]; int main() { for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cin >> a[i][j]; if(i == j) { a[i][j] += 10; } if(i + j == 7) { a[i][j] += 10; } } } for(int i = 1; i <= 6; i++) { for(int j = 1; j <= 6; j++) { cout << a[i][j] << " "; } puts(""); } return 0; }
2022ts280
LV 8
@ 2023-4-9 20:01:53
- 1