【Henu ACM Round#14 A】Vitaly and Night
and 14 round ACM Henu
2023-09-14 09:03:45 时间
【链接】 我是链接,点我呀:)
【题意】
【题解】
连续两个如果不全是0就递增cnt【代码】
#include <bits/stdc++.h>
using namespace std;
int n,m;
int main()
{
cin >> n >>m;
int cnt = 0;
for (int i = 1;i <= n;i++){
int x,y;
for (int j = 1;j <= m;j++){
cin >>x >>y;
if (!(x==0 && y==0)) cnt++;
}
}
cout <<cnt<<endl;
return 0;
}
相关文章
- 【Maven错误】 Non-resolvable parent POM for ...... Return code is: 500 , ReasonPhrase:Internal Server Error. and 'parent.relativePath' points at no local POM @ line 14, column 11
- [Ramda] Difference between R.converge and R.useWith
- [Javascript] Private, public variables and method in Name Space
- [Prostgres] Select Grouped and Aggregated Data with SQL
- [Cypress] install, configure, and script Cypress for JavaScript web applications -- part2
- TypeError: unsupported operand type(s) for |: 'str' and 'str'
- between...and..
- atitit.编程语言 程序语言 的 工具性 和 材料性 双重性 and 语言无关性 本质
- 【Henu ACM Round#14 C】Duff and Weight Lifting
- 【AtCoder Beginner Contest 073 C】Write and Erase
- hdu 5066 Harry And Physical Teacher(Bestcoder Round #14)
- 迁移学习(JDDA) 《Joint domain alignment and discriminative feature learning for unsupervised deep domain adaptation》
- wgcna 官网教程II.Consensus analysis of female and male liver expression data