Here's your approach:
Read (number of problems).
Initialize a counter to .
Loop times, once for each problem.
For each iteration, read three integers representing the three friends' certainty levels.
Compute the sum of these three integers.
Use an if statement to check if the sum is at least .
If true, increment your counter.
After the loop finishes, output the counter. The control flow is simple: repeat a check times, counting successes. This loop-and-count pattern is one of the most common structures in programming. You'll see it again and again.