### PROBLEM LINK:

**Author:** Hasan Jaddouh

**Tester:** Hussain Kara Fallah

**Editorialist:** Hussain Kara Fallah

### PROBLEM

Chef wrote a problem for his contest. He prepared the test-set. Initially he has solutions for his problem (some correct and some incorrect solutions). For each solution he knows the judge verdict (correct/incorrect) and also the feedback (which cases it passed and which it failed).

You need to help him decide the state of his test-set.

A test-set is invalid if some correct solution fails.

A test-set is weak if it’s valid but some incorrect solution passes all the tests.

A test-set is fine if it’s not weak and valid.

### DIFFICULTY

Cakewalk

### EXPLANATION

This is a straightforward implementation problem where you need to implement what’s written in the problem statement.

Read the information given to you, (each solution and its verdict). Count the number of zeroes (failed tests) and ones (passed tests) from each solution feedback. After that you can decide the state of the test-set by checking each the conditions stated above.

It’s highly recommended to check the implementation in the solutions below if you have any problems.

### AUTHOR’S AND TESTER’S SOLUTIONS:

**AUTHOR’s solution**: Can be found [here][]

**TESTER/EDITORIALIST’s solution**: Can be found [here][]