Codeforces Round 257 (Div. 2)

Solutions for Codeforces Round 257 (Div. 2) (contest 450). 2/2 problems verified against sample I/O. Difficulty range: 1000-1300.

2 items

Codeforces Round 257 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 1000-1300 | Time: 2m 25s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Jzzhu and Children	1000	implementation	1m 34s	✓
B	Jzzhu and Sequences	1300	implementation, math	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}$.