Codeforces——231A Team
小聲BB
又回到800了,感覺是很不錯的,不過自己程式碼能力有夠弱的,思維也很差,很多特例經常考慮不到
題幹
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.
Examples
Input
3
1 1 0
1 1 1
1 0 0
Output
2
Input
2
1 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.
分析
我心目中的送分題沒跑了,一點坑都沒有很舒服,反正就是個有限行輸入,判斷和大於1就好
程式碼
#include<iostream>
using namespace std;
int main()
{
int a,b,c,sum = 0,n;
cin >> n;
while(n--)
{
cin >> a >> b >> c;
if(a + b + c > 1)
sum++;
}
cout << sum;
return 0;
}
相關文章
- Codeforces 410C.Team[構造]
- Codeforces Round #235 (Div. 2)C、Team
- Team BuildingUI
- team building planUI
- Team Queue(佇列)佇列
- Joe Harris is a real problem with this team
- Best Team With No Conflicts
- Linux網路卡teamLinux
- 構建之法——Team & Scrum & MSFScrum
- Go team 訪談上線Go
- 採用Hexo 搭建Team BlogHexo
- css best practice for big team and projectCSSProject
- 招聘web development team leader!(上海)Webdev
- Team Foundation Server 安裝配置教程Server
- Team - 協同工具Confluence
- [BT]Visual Studio Team System 2010 Team Suite Beta 1 (x86) - DVD (English)UI
- Hacking Team攻擊程式碼分析
- rhel7網路卡bond和team
- iOS signing for "***" requires a development team.iOSUIdev
- AKM專案逸事之Team BuildingUI
- Codeforces
- Hacking Team系列 Flash 0Day分析
- Hacking Team 新 Flash 0day分析
- Team Queue (佇列的一種應用)佇列
- POJ 2259 Team Queue【模擬佇列】佇列
- but youre quickly Fifa 14 ultimate team coins bombardedUI
- 招PHP開發的team leader(北京)PHP
- CF1316E Team BuildingUI
- 【內推】上海微軟Azure Java Team熱招中微軟Java
- iOS - No account with iTunes Connect access have been found for the teamiOS
- Team Foundation Server 2005 (Chs) Setup Step by StepServer
- CF1886E I Wanna be the Team Leader
- codeforces Mafia
- codeforces Winner
- codeforces Educational Codeforces Round 33 (Rated for Div. 2)
- 【CodeForces訓練記錄】Codeforces Global Round 27
- 簡要分析Hacking Team 遠端控制系統
- SCRUM: 敏捷團隊的故事(SCRUM: The Story of an Agile Team)——(3)Scrum敏捷