Codechef•May 26, 2025
Recent contest problems
Hazrat Ali
Codechef
CodeChef recently revamped its pratice page to make it easier for users to identify the next problems they should solve by introducing some new features:
- Recent Contest Problems - Contains only problems from the last 2 contests
- Separate Un-Attempted, Attempted, and All tabs
- Problem Difficulty Rating - The Recommended dropdown menu has various difficulty ranges so that you can attempt the problems most suited to your experience
- Popular Topics and Tags
Chef has been participating regularly in rated contests but missed the last two contests due to his college exams. He now wants to solve them and so he visits the practice page to view these problem.
Given a list of NN contest codes, where each contest code is either START38
or LTIME108
, help Chef count how many problems were featured in each of the contests.
Input Format
- First line will contain TT, number of test cases. Then the test cases follow.
- Each test case contains of two lines of input.
- First line of input contains the total count of problems that appeared in the two recent contests - NN.
- Second line of input contains the list of NN contest codes. Each code is either
START38
orLTIME108
, to which each problem belongs.
Output Format
For each test case, output two integers in a single new line - the first integer should be the number of problems in START38
, and the second integer should be the number of problems in LTIME108
.
Constraints
- 1≤T≤10
- 1≤N≤1000
- Each of the contest codes will be either
START38
orLTIME108
.
Sample 1:
Input
4 3 START38 LTIME108 START38 4 LTIME108 LTIME108 LTIME108 START38 2 LTIME108 LTIME108 6 START38 LTIME108 LTIME108 LTIME108 START38 LTIME108
Output
2 1 1 3 0 2 2 4
Solution
m = int(input())
for i in range(m):
n = int(input())
s = input()
b = s.split()
temp = 0
contest = 0
for j in range(n):
if b[j] == "START38":
temp += 1
else:
contest += 1
print(temp, contest)