Codeforces--231A--Team

题目描述：
One day three best friends Petya, Vasya and Tonya decided to form a team and take part in programming contests. Participants are usually offered several problems during programming contests. Long before the start the friends decided that they will implement a problem if at least two of them are sure about the solution. Otherwise, the friends won’t write the problem’s solution.
This contest offers n problems to the participants. For each problem we know, which friend is sure about the solution. Help the friends find the number of problems for which they will write a solution.
输入描述:
The first input line contains a single integer n (1 ≤ n ≤ 1000) — the number of problems in the contest. Then n lines contain three integers each, each integer is either 0 or 1. If the first number in the line equals 1, then Petya is sure about the problem’s solution, otherwise he isn’t sure. The second number shows Vasya’s view on the solution, the third number shows Tonya’s view. The numbers on the lines are separated by spaces.
输出描述:
Print a single integer — the number of problems the friends will implement on the contest.
输入：
3
1 1 0
1 1 1
1 0 0
2
1 0 0
0 1 1
输出：
2
1
题意：
统计有多少行中1的个数大于等于2
题解：
直接搞
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        int ans = 0;
        int x,y,z;
        for(int i = 1; i <= n; i ++){
            scanf("%d%d%d",&x,&y,&z);
            if(x + y + z > 1) ans ++;
        }
        cout<<ans<<endl;
    }
    return 0;
}