Codeforces Round 187 (Div. 2)

2 problems from Codeforces Round 187 (Div. 2) (contest 315), difficulty 1200-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 187 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1200-1400 | 4m 3s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Sereja and Bottles	1400	brute-force	12,290	1m 54s	✓
B	Sereja and Array	1200	implementation	7,721	2m 9s	✓

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

CF 315B - Sereja and Array

We have an array of integers and a sequence of operations. One operation changes a single position to a new value. Another operation adds the same number to every element in the array. The third operation asks for the current value at a specific position.

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

CF 315A - Sereja and Bottles

Each bottle has two properties. The value a[i] is the bottle's own brand. The value b[i] is the brand of bottles that this bottle can open. A bottle can be opened if there exists some other bottle whose opening capability matches its brand.