目录
//二维数组 [列] [行]//二维数组题没有必要非要用[0][0]//只要输出时,控制范围即可
P5729 【深基5.例7】工艺品制作
P5729 【深基5.例7】工艺品制作 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)https://www.luogu.com.cn/problem/P5729
#include<iostream>
using namespace std;
int sum=0;
int main() {
int ans[25][25][25]{};
int w, x, h, q, x1, x2, y1, y2, z1, z2;
cin >> w >> x >> h>>q;
for (int i = 1; i <= w; i++) {
for (int k = 1; k <= x; k++) {
for (int g = 1; g <= h; g++) {
ans[i][k][g] = 1;
}
}
}
while (q) {
cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
for (int i = x1; i <= x2; i++) {
for (int k = y1; k <= y2; k++) {
for (int g = z1; g <= z2; g++) {
ans[i][k][g] = 0;
}
}
}
q--;
}
for (int i = 1; i <= w; i++) {
for (int k = 1; k <= x; k++) {
for (int g = 1; g <= h; g++) {
sum +=ans[i][k][g] ;
}
}
}
cout << sum << endl;
return 0;
}
olol
//二维数组 [行] [列]
//二维数组题没有必要非要用[0][0]
//只要输出时,控制范围即可
P2550 [AHOI2001]彩票摇奖
P2550 [AHOI2001]彩票摇奖 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)https://www.luogu.com.cn/problem/P2550
#include<iostream>
using namespace std;
int main() {
int n, ans[10],arr[10]={0};
cin >> n;
for(int i = 0; i < 7; i++) {
cin >> ans[i];
}
while (n--) {
int sum = 0;
for (int i = 0; i < 7; i++) {
int a;
cin >> a;
for (int k = 0; k < 7; k++) {
if (a == ans[k]) {
sum++;
break;
}
}
}
arr[sum]++;
}
for (int i=7;i; i--) //i>=1等价于i
cout << arr[i] << ' ';
return 0;
}