Team

简介: Team

文章目录

一、Team

总结


一、Team

本题链接:Team


题目:

A. Team

time limit per test2 seconds

memory limit per test256 megabytes

inputstandard input

outputstandard 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.


本博客给出本题截图:

image.png

AC代码

#include <iostream>
using namespace std;
int  main()
{
  int n, res = 0;
  cin >> n;
  while (n -- )
  {
    int a, b, c;
    cin >> a >> b >> c;
    if ((a + b + c) > 1) res ++;
  }
  cout << res << endl;
  return 0;
}

题意:两个人都是1则过,否则不过

总结

contest竞赛

participant 参与者

offer 提出

implement 执行

solution 解决方案

水题,不解释


目录
相关文章
|
1月前
|
人工智能 安全
openAI的Red Team
openAI的Red Team
46 3
uva540 team queue
uva540 team queue
40 0
|
网络安全 数据安全/隐私保护
Ansible之 Tower使用User和Team管理访问权限的笔记
写在前面 这部分内容没有太大的差别,所以用旧版本的 Ansible Tower 博文内容涉及: 创建 Tower 用户即角色添加 创建 Tower 团队 即角色添加 食用方式: 需要了解 Ansible 理解不足小伙伴帮忙指正
207 0
Ansible之 Tower使用User和Team管理访问权限的笔记
Team Olympiad
Team Olympiad
117 0
Team Olympiad
The Famous ICPC Team Again
题目描述 When Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collected a large set of contest problems for their daily training. When they decided to take training, Mr. B would choose one of them from the problem set.
102 0

热门文章

最新文章