📘 Day 9 – Teacher's Day Challenge | Team

🗓️ Date: August 02, 2025
🧩 Platform: Codeforces
🔢 Problems Solved Today: 1
🎯 Focus Topic: Conditional Logic, Input Handling, Majority Voting

---

🔗 Table of Contents

• Problem 1 – Team

• Daily Summary

---

🧩 Problem 1 – Team

📚 Difficulty: Easy
🧠 Concepts: Majority Check, Conditional Logic, Input/Output

---

📄 Problem Statement (Summary):
Three friends — Petya, Vasya, and Tonya — will solve a problem only if at least two of them are sure about it.
You’re given n problems and each problem has 3 integers (0 or 1) indicating whether each friend is sure.
Count how many problems they will implement.

---

💡 Approach:

• Input number of problems n.

• For each problem, take 3 values (0 or 1) for Petya, Vasya, Tonya.

• Sum the three values. If the sum is ≥ 2, increment the answer count.

• Finally, print the count.

---

🧪 Code (C++):

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

---

📸 Submission Screenshot:

---

📝 Example:
Input:

3  
1 1 0  
1 1 1  
1 0 0

Output:

2

---

✅ Key Takeaways:

• Sum of binary values (0/1) is a quick way to perform majority check.

• if (a + b + c >= 2) is clean and efficient.

• Looping with while (n--) is commonly used in competitive programming.

• Input format understanding is critical in Codeforces problems.

---

📈 Daily Summary

---

🏷️ Tags:
#codeforces #conditional #logic #majority #cpp #dsa #43DaysChallenge