Codeforces Round 196 (Div. 1)

Solutions for Codeforces Round 196 (Div. 1) (contest 338). 1/1 problems verified against sample I/O. Difficulty range: 2900-2900.

1 items

Codeforces Round 196 (Div. 1)

Type: Div. 1 | Problems: 1 | Verified: 1/1 | Rating range: 2900-2900 | Time: 1m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
D	GCD Table	2900	chinese-remainder-theorem, math, number-theory	1m 33s	✓

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.