zoukankan      html  css  js  c++  java

  • A. 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
    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>
 2 using namespace std;
 3 int main(){
 4     int n,i,sum=0,a[1002][3];
 5     ios::sync_with_stdio(false);
 6     cin>>n;
 7     for(i=0;i<n;i++){
 8         cin>>a[i][0]>>a[i][1]>>a[i][2];
 9         if((a[i][0]+a[i][1]+a[i][2])>=2) sum++;
10     }
11     cout<<sum<<endl;
12     return 0;
13 }
  • 相关阅读:
    csrf攻击 xss区别
    同源策略
    JavaScript中数组的排序——sort()
    箭头函数
    bind()，call()，apply()
    异步操作
    slice()， splice()，split()，indexOf()，join()，replace()
    04-Linux系统编程-第01天（文件IO、阻塞非阻塞）
    03-Linux命令基础-第03天（makefile、静态库、动态库、gdb调试工具）
    02-Linux命令基础-第02天（压缩包管理、服务器搭建与使用、vim）
  • 原文地址：https://www.cnblogs.com/z-712/p/7307520.html
Copyright © 2011-2022 走看看