Codeforces Round 146 (Div. 2)

Solutions for Codeforces Round 146 (Div. 2) (contest 236). 2/2 problems verified against sample I/O. Difficulty range: 800-1300.

2 items

Codeforces Round 146 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1300 | Time: 5m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Boy or Girl	800	brute-force, implementation, strings	3m 27s	✓
B	Easy Number Challenge	1300	implementation, number-theory	1m 45s	✓

Practice › Codeforces Solutions › Codeforces Round 146 (Div. 2) ›

CF 236A - Boy or Girl

We are given a username consisting only of lowercase English letters. The task is to count how many different characters appear in that username. The decision rule is simple. If the number of distinct characters is even, we print "CHAT WITH HER!".

Practice › Codeforces Solutions › Codeforces Round 146 (Div. 2) ›

CF 236B - Easy Number Challenge

We need to compute the sum of the number of divisors of every product i j k, where i ranges from 1 to a, j ranges from 1 to b, and k ranges from 1 to c. For each triple (i, j, k), we evaluate d(i j k), where d(x) means the number of positive divisors of x.