codeforces 231 A Team(水题)
2014-05-26 22:43
513 查看
A. Team
点击打开
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
Print a single integer — the number of problems the friends will implement on the contest.
Sample test(s)
input
output
input
output
Note
In the first sample Petya and Vasya are sure that they know how to solve the first problem and all three of them know how to solve the second problem. That means that they will write solutions for these problems. Only Petya is sure about the solution for the
third problem, but that isn't enough, so the friends won't take it.
In the second sample the friends will only implement the second problem, as Vasya and Tonya are sure about the solution.
代码:
点击打开
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
Print a single integer — the number of problems the friends will implement on the contest.
Sample test(s)
input
3 1 1 0 1 1 1 1 0 0
output
2
input
21 0 0
0 1 1
output
1
Note
In the first sample Petya and Vasya are sure that they know how to solve the first problem and all three of them know how to solve the second problem. That means that they will write solutions for these problems. Only Petya is sure about the solution for the
third problem, but that isn't enough, so the friends won't take it.
In the second sample the friends will only implement the second problem, as Vasya and Tonya are sure about the solution.
代码:
#include <iostream> using namespace std; int main() { int n,s,ans,a[4],i; while(cin>>n) { s=0; while(n--) { ans=0; for(i=0;i<3;i++) { cin>>a[i]; if(a[i]==1) ans++; } if(ans>=2) s++; } cout<<s<<endl; } return 0; }
相关文章推荐
- codeforces水题100道 第十一题 Codeforces Round #143 (Div. 2) A. Team (brute force)
- CodeForces 231 A.Team(水~)
- codeforces 798a Mike and palindrome 水题
- codeforces水题100道 第十四题 Codeforces Round #321 (Div. 2) A. Kefa and First Steps (brute force)
- codeforces 158A Next Round (水题)
- Codeforces 459B Pashmak and Flowers(水题)
- codeforces 702C C. Cellular Network(水题)
- CodeForces-698A Vacations(水题)
- CodeForces 703A Mishka and Game(玩骰子游戏,水题)
- Codeforces 588B Duff in Love【暴力】水题
- Codeforces--616B--Dinner with Emma(模拟水题)
- codeforces 558B B. Amr and The Large Array(水题)
- codeforces 664A A. Complicated GCD(水题)
- Codeforces 476A - Dreamoon and Stairs 水题
- CodeForces 107 B.Basketball Team(水~)
- codeforces 711A A. Bus to Udayland(水题)
- CodeForces 32C. Flea 水题
- Codeforces 598B Queries on a String 【水题】
- Codeforces 382A Ksenia and Pan Scales(水题)
- Drazil and Factorial - CodeForces 513 C 水题