Codeforces Round 129 (Div. 2)

Solutions for Codeforces Round 129 (Div. 2) (contest 205). 2/2 problems verified against sample I/O. Difficulty range: 900-1400.

2 items

Codeforces Round 129 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 900-1400 | Time: 2m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Little Elephant and Rozdil	900	brute-force, implementation	54s	✓
B	Little Elephant and Sorting	1400	brute-force, greedy	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.