Codeforces Round 115

Solutions for Codeforces Round 115 (contest 175). 5/5 problems verified against sample I/O. Difficulty range: 1400-3000.

5 items

Codeforces Round 115

Type: Special | Problems: 5 | Verified: 5/5 | Rating range: 1400-3000 | Time: 9m 1s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Robot Bicorn Attack	1400	brute-force, implementation	1m 3s	✓
B	Plane of Tanks: Pro	1400	implementation	2m 15s	✓
C	Geometry Horse	1600	greedy, implementation, sortings	1m 21s	✓
D	Plane of Tanks: Duel	2400	brute-force, dp, math	2m 32s	✓
F	Gnomes of Might and Magic	3000	data-structures, graphs, implementation	1m 50s	✓

Practice › Codeforces Solutions › Codeforces Round 115 ›

CF 175A - Robot Bicorn Attack

We are given a string of digits, which represents the concatenation of the scores Vasya achieved in three rounds of Robot Bicorn Attack. Each round produces a non-negative integer not exceeding 1,000,000, and numbers cannot have leading zeros unless the number itself is zero.

Practice › Codeforces Solutions › Codeforces Round 115 ›

CF 175B - Plane of Tanks: Pro

The problem asks whether an integer remains unchanged after performing the digit reversal operation twice. A reversal operation takes the decimal representation of a number and reverses the order of its digits.

Practice › Codeforces Solutions › Codeforces Round 115 ›

CF 175C - Geometry Horse

We are asked to maximize Vasya's score in a game where destroying geometric figures earns points based on a per-figure cost and a global factor. Each figure type has a quantity and a point value.

Practice › Codeforces Solutions › Codeforces Round 115 ›

CF 175D - Plane of Tanks: Duel

Two tanks fight each other. Each tank has hit points, a reload time, a damage interval, and a probability that its shot fails to penetrate armor. Whenever a tank fires, one of two things happens.

Practice › Codeforces Solutions › Codeforces Round 115 ›

CF 175F - Gnomes of Might and Magic

The kingdom of gnomes consists of castles connected by a very specific graph structure. There is a cycle of m castles called the Good Path, connected sequentially with roads and forming a closed loop.