Codeforces Round 257 (Div. 2)

2 problems from Codeforces Round 257 (Div. 2) (contest 450), difficulty 1000-1300. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 257 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 1000-1300 | 2m 25s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Jzzhu and Children	1000	implementation	44,340	1m 34s	✓
B	Jzzhu and Sequences	1300	implementation, math	28,823	51s	✓

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

CF 450A - Jzzhu and Children

We have a line of children. Child i wants a[i] candies in total. Every time a child reaches the front of the line, they receive exactly m candies. If the child has still not received enough candies after that distribution, they move to the back of the line.

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

CF 450B - Jzzhu and Sequences

The problem defines a linear sequence $fn$ with two initial values $x = f1$ and $y = f2$, and a recurrence that repeats every six terms: $f{n} = f{n-1} - f{n-2}$.