Codeforces Round 196 (Div. 1)

2 problems from Codeforces Round 196 (Div. 1) (contest 338), difficulty 2600-2900. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 196 (Div. 1)

Div. 1 | 2 problems | 2/2 verified | Difficulty 2600-2900 | 3m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
D	GCD Table	2900	chinese-remainder-theorem, math, number-theory	1,403	1m 33s	✓
E	Optimize!	2600	data-structures	1,186	1m 53s	✓

Practice › Codeforces Solutions › Codeforces Round 196 (Div. 1) ›

CF 338E - Optimize!

We are given two arrays: one long array a of size up to 150,000, and a shorter array b of length up to 150,000 but used as a multiset that we may permute and temporarily “consume”. A threshold value h is also given.

Practice › Codeforces Solutions › Codeforces Round 196 (Div. 1) ›

CF 338D - GCD Table

We are asked to determine whether a given sequence of numbers appears as consecutive elements in some row of a hypothetical GCD table. The table has n rows and m columns, where each element at row i and column j is the greatest common divisor of i and j.