2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC

10 problems from 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC (contest 102282), difficulty -. 10/10 solutions verified against sample I/O.

10 items

2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC

ICPC/IOI | 10 problems | 10/10 verified | Difficulty - | 13m 31s

# Problem Rating Tags Accepted Time ✓
A \u041f\u0435\u0440\u0432\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430 1m 5s ✓
B \u0415\u0449\u0451 \u043e\u0434\u043d\u0430 1m 16s ✓
C \u041d\u0435\u0443\u0442\u0435\u0448\u0438\u0442\u0435\u043b\u044c\u043d\u0430\u044f \u0437\u0430\u0434\u0430\u0447\u0430 54s ✓
D \u0420\u043e\u0431\u043e\u0442 \u0432 \u043b\u0430\u0431\u0438\u0440\u0438\u043d\u0442\u0435 1m 11s ✓
E \u041e \u0434\u0440\u0443\u0436\u0431\u0435 1m 9s ✓
F \u041c\u0430\u0441\u0442\u0435\u0440 \u0443\u0433\u0430\u0434\u044b\u0432\u0430\u043d\u0438\u044f \u0446\u0438\u0444\u0440 1m 8s ✓
G \u0411\u0430\u044f\u043d 1m 12s ✓
H \u0411\u0435\u0437 \u0438\u043c\u0435\u043d\u0438 1m 13s ✓
I \u041f\u0440\u043e\u0438\u0437\u0432\u0435\u0434\u0435\u043d\u0438\u044f 3m 24s ✓
J \u041f\u043e\u0441\u043b\u0435\u0434\u043d\u044f\u044f \u0437\u0430\u0434\u0430\u0447\u0430 59s ✓
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282A - Первая задача

We need to choose a positive integer (x) such that (x^n) is divisible by (m), and among all such positive integers we need the smallest one. If no such (x) exists, we print ABSENT.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282B - Ещё одна

We need to count the positive integers from 1 through r that are coprime with n. Two numbers are coprime when their greatest common divisor is exactly 1. The input contains two integers, n and r, each at most 10^9.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282J - Последняя задача

We have two strings, s1 and s2. The first string is the text that should have been copied, while the second is the text that was actually written. During copying, two kinds of mistakes are allowed: a character can be omitted, or a character can be replaced by another character.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282I - Произведения

We have an (n times n) grid. Some cells contain positive integers and the rest contain zero. Every row and every column must contain exactly two nonzero cells.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282H - Без имени

We have two circles in the Cartesian plane. Each circle is described by the integer coordinates of its center and its positive integer radius. The task is to determine how many points belong to both circles and to print those points with sufficient numerical precision.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282G - Баян

The building is organized into entrances, floors, and apartments. Every entrance contains exactly n floors, and every floor contains exactly m apartments.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282F - Мастер угадывания цифр

The task looks like an ordinary arithmetic problem, but the central difficulty is deliberately hidden in the statement. For test number (k), the author generated the answer as the last decimal digit of [ g(k)=nk+c, ] where (n) and (c) are fixed integers chosen by the author.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282E - О дружбе

The input describes an undirected graph whose vertices are people and whose edges represent pairs of people who are "true friends". The company is guaranteed to be connected, meaning that for every pair of people there is a chain of true-friend relationships between them.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282D - Робот в лабиринте

We have a rectangular grid of at most (100 times 100) cells. Some cells are walls and cannot be entered, while the remaining cells are traversable. One traversable cell contains the robot initially.
codeforces competitive-programming Aug 13, 2026
Practice › Codeforces Solutions › 2011, Отборочный контест СГАУ на четвертьфинал ACM ICPC ›

CF 102282C - Неутешительная задача

A snail starts at height 0 and climbs Mount Fuji, whose height is fixed at 3776 meters. During each day it climbs exactly n meters. If it has not reached the summit after that climb, the following night makes it slide down m meters.
codeforces competitive-programming Aug 13, 2026