Codeforces Round 278 (Div. 1)

Solutions for Codeforces Round 278 (Div. 1) (contest 487). 0/4 problems verified against sample I/O. Difficulty range: 1800-3200.

4 items

Codeforces Round 278 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1800-3200 | Time: 27m 2s

Problem Name Rating Tags Solve Time Verified
A Fight the Monster 1800 binary-search, brute-force, implementation 5m 21s ✗
C Prefix Product Sequence 2300 constructive-algorithms, math, number-theory 5m 22s ✗
D Conveyor Belts 2700 data-structures 5m 24s ✗
E Tourists 3200 data-structures, dfs-and-similar, graphs 10m 55s ✗
Practice › Codeforces Solutions › Codeforces Round 278 (Div. 1) ›

CF 487A - Fight the Monster

Codeforces 487A: Fight the Monster
codeforces competitive-programming binary-search brute-force implementation May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 278 (Div. 1) ›

CF 487C - Prefix Product Sequence

Codeforces 487C: Prefix Product Sequence
codeforces competitive-programming constructive-algorithms math number-theory May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 278 (Div. 1) ›

CF 487D - Conveyor Belts

Codeforces 487D: Conveyor Belts
codeforces competitive-programming data-structures May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 278 (Div. 1) ›

CF 487E - Tourists

We are given a network of cities connected by roads, where each city sells a souvenir at a certain price. Queries can either change the souvenir price in a city or ask for the minimum possible price a tourist can pay when traveling from one city to another along a path that…
codeforces competitive-programming data-structures dfs-and-similar graphs trees May 31, 2026