Team(CodeForces - 231A)

最新推荐文章于 2022-12-31 19:42:21 发布

小张喝奶茶了吗

最新推荐文章于 2022-12-31 19:42:21 发布

阅读量271

点赞数 1

分类专栏： C++

本文链接：https://blog.csdn.net/ITzz_qqzi/article/details/112797021

版权

三个好朋友Petya、Vasya和Tonya组队参加编程比赛。他们决定，只有当至少两个人确定问题解决方案时，才会解答一个问题。输入包含比赛中的问题数及每个人对每个问题的确定情况。输出他们将在比赛中解决的问题数量。例如，当Petya和Vasya确定第一个问题，三人都确定第二个问题，而只有Petya确定第三个问题时，他们将解答前两个问题。

摘要由CSDN通过智能技术生成

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.

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