Codeforces Round 129 (Div. 2)

2 problems from Codeforces Round 129 (Div. 2) (contest 205), difficulty 900-1400. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 129 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 900-1400 | 2m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Little Elephant and Rozdil	900	brute-force, implementation	25,221	54s	✓
B	Little Elephant and Sorting	1400	brute-force, greedy	6,477	1m 30s	✓

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

CF 205A - Little Elephant and Rozdil

We are given a list of travel times from the town Rozdil to each of n other towns. Each town has a positive integer time, and the towns are numbered from 1 to n. The goal is to find which town has the smallest travel time.

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

CF 205B - Little Elephant and Sorting

We are given an array of integers, and one operation consists of choosing a contiguous segment and increasing every element inside that segment by exactly one. We may repeat this operation any number of times.