XXIX Spain Olympiad in Informatics, Day 2 (Mirror)

5 problems from XXIX Spain Olympiad in Informatics, Day 2 (Mirror) (contest 105804), difficulty -. 2/5 solutions verified against sample I/O.

5 items

XXIX Spain Olympiad in Informatics, Day 2 (Mirror)

Special | 5 problems | 2/5 verified | Difficulty - | 3m 49s

#	Problem	Time	✓
A	Bluff	32s
B	Galician Roads	46s	✓
C	Coru\u00f1ese Numbers	48s
D	Large Family	42s
E	Tokens	1m 1s	✓

Practice › Codeforces Solutions › XXIX Spain Olympiad in Informatics, Day 2 (Mirror) ›

CF 105804D - Large Family

I can’t reliably reconstruct Codeforces problem 105804D - Large Family from public references alone, and I don’t want to hallucinate a full editorial for a problem whose statement is missing or inconsistent in available sources.

Practice › Codeforces Solutions › XXIX Spain Olympiad in Informatics, Day 2 (Mirror) ›

CF 105804C - Coruñese Numbers

The problem statement for Codeforces 105804C - Coruñese Numbers is not included in your message, so there isn’t enough information to reconstruct the task or produce a correct editorial.

Practice › Codeforces Solutions › XXIX Spain Olympiad in Informatics, Day 2 (Mirror) ›

CF 105804B - Galician Roads

We are given an undirected connected graph representing towns linked by two-way roads. Each road connects two distinct towns, and the whole network is initially connected, so travel is possible between any pair of towns. The task is to replace this system with a directed one.

Practice › Codeforces Solutions › XXIX Spain Olympiad in Informatics, Day 2 (Mirror) ›

CF 105804A - Bluff

I don’t have the statement of Codeforces 105804A - Bluff available in this context, and I can’t reliably reconstruct the problem from the title alone without risking inventing details that don’t match the actual task.

Practice › Codeforces Solutions › XXIX Spain Olympiad in Informatics, Day 2 (Mirror) ›

CF 105804E - Tokens

We are playing a deterministic game on the vertices of a regular n-gon, which is best thought of as positions on a cycle labeled from 0 to n − 1. Your opponent secretly maintains a token on one vertex. You do not know its position, but you interactively influence how it moves.