随笔—邀请赛前训— Codeforces Round #330 (Div. 2) Vitaly and Night

题意:给你很多对数,要么是0要么是1。不全0则ans++。

思路即题意。

#include<cstdio>
#include<cstring>
#include<iostream> using namespace std; #define MAX(x,y) (((x)>(y)) ? (x) : (y))
#define MIN(x,y) (((x) < (y)) ? (x) : (y))
#define ABS(x) ((x)>0?(x):-(x)) const int inf = 0x7fffffff;
const int N=; int win[N][*N];
int state[N];Z int main()
{
int n,m;
while(cin>>n>>m)
{
int cnt=;
for(int i=; i<=n; i++)
{
for(int j=; j<=*m; j++)
{
scanf("%d",&win[i][j]);
if(j% == ){
if(win[i][j-] == || win[i][j] == ){
cnt++;
}
}
}
}
cout<<cnt<<endl;
}
return ;
}
上一篇:sdut 2840 Best string Orz~ (dp)


下一篇:Codeforces Round #330 (Div. 2)