AtCoder Beginner Contest 121 题解
题目链接:https://atcoder.jp/contests/abc121
A White Cells
分析:题目数据规模很小,直接暴力修改都可以。或者可以推出公式.
代码:
1 #include <iostream> 2 #include <cstdio> 3 4 using namespace std; 5 6 int main() 7 { 8 int a[25][25] = {0}; 9 int H, W, h, w; 10 scanf("%d %d", &H, &W); 11 scanf("%d %d", &h, &w); 12 for(int i = 0; i < h; ++i) 13 for(int j = 0; j < W; ++j) 14 a[i][j] = 1; 15 for(int i = 0; i < w; ++i) 16 for(int j = 0; j < H; ++j) 17 a[j][i] = 1; 18 int ans = 0; 19 for(int i = 0; i < H; ++i) 20 { 21 for(int j = 0; j < W; ++j) 22 { 23 if(a[i][j] == 0) 24 ++ans; 25 } 26 } 27 printf("%d ", ans); 28 return 0; 29 }
B Can you solve this?
分析:模拟即可。
代码:
1 #include <iostream> 2 #include <cstdio> 3 4 using namespace std; 5 6 int main() 7 { 8 int n, m, c; 9 scanf("%d %d %d", &n, &m, &c); 10 int b[25]; 11 for(int i = 0; i < m; ++i) 12 scanf("%d", &b[i]); 13 int ans = 0; 14 for(int i = 0; i < n; ++i) 15 { 16 int tmp, sum = 0; 17 for(int j = 0; j < m; ++j) 18 { 19 scanf("%d", &tmp); 20 sum += tmp * b[j]; 21 } 22 if(sum + c > 0) 23 ++ans; 24 } 25 printf("%d ", ans); 26 return 0; 27 }