PS [03] | Team Codeforces Solution using C++ - شرح بالعربي
Problem Link: https://codeforces.com/problemset/problem/231/A
(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.
=============================
📺 Playlist Link: https://www.youtube.com/playlist?list=PLu9xARoolRsYGJKwkttrLUnJ5VD9TR6e_
👤 Connect with me on LinkedIn: https://www.linkedin.com/in/abdallafadl/
Видео PS [03] | Team Codeforces Solution using C++ - شرح بالعربي канала Abdalla Fadl
(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.
=============================
📺 Playlist Link: https://www.youtube.com/playlist?list=PLu9xARoolRsYGJKwkttrLUnJ5VD9TR6e_
👤 Connect with me on LinkedIn: https://www.linkedin.com/in/abdallafadl/
Видео PS [03] | Team Codeforces Solution using C++ - شرح بالعربي канала Abdalla Fadl
عبدالله فضل Abdalla Fadl برمجة flowgorithm C++ كورس Problem Solving شرح موقع Codeforces Codeforces شرح موقع Leetcode Hackerrank Problem solving شرح problem solving c# عربي problem solving كورس كورس مهارة حل المشكلات حل المشكلات خطوات حل المشكلات حل مسائل برمجة مهارات حل المشاكل حل مسائل codeforces C++ codeforces C++ ACM ECPC Team Codeforces Solution Team team codeforces c++ codeforces team solution in c++ A. Team(c++) A.team موقع codeforces لغة ++c 231A
Комментарии отсутствуют
Информация о видео
14 февраля 2024 г. 23:00:10
00:17:42
Другие видео канала