I SBC São Paulo Programming Marathon

14 problems from I SBC São Paulo Programming Marathon (contest 105904), difficulty -. 7/14 solutions verified against sample I/O.

14 items

I SBC São Paulo Programming Marathon

Special | 14 problems | 7/14 verified | Difficulty - | 11m 1s

#	Problem	Time	✓
A	Amount of food for tigers	53s	✓
B	Bicycle in Ibirapuera	31s
C	Cities in Sao Paulo	49s	✓
D	Dealing with S\u00e3o Paulo Hot Dogs	23s
E	Enhancing 25 de Mar\u00e7o deliveries	37s
F	Fleeing from the Heat	45s	✓
G	Guaranteeing SP	31s
H	Hacker in the system	49s	✓
I	If SSP-SP was longer	33s
J	Joining Polynomials	1m 57s
K	Kickboxing	49s	✓
L	Leaving books at their correct piles	24s
M	Machine for picking shells	42s	✓
N	Number of Steps	1m 18s	✓

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904J - Joining Polynomials

Sure - please paste the Codeforces problem (statement + constraints, or a link + key details), and I’ll write a full competitive programming editorial for it.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904M - Machine for picking shells

We are given a line of shells, each at a fixed position from 1 to N, and each shell has a type represented by an integer.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904L - Leaving books at their correct piles

I don’t have the actual statement of Codeforces 105904L - Leaving books at their correct piles, so I can’t reliably derive the logic, constraints, or even what operations are allowed.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904H - Hacker in the system

The system starts as an infinite array where position i initially contains the value i. You can think of it as a perfect identity mapping stretched infinitely to the right. This array is grouped into consecutive blocks of fixed length K.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904I - If SSP-SP was longer

The problem statement for Codeforces 105904I - If SSP-SP was longer is missing from your message, so I don’t have the actual rules, input format, or what needs to be computed.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904F - Fleeing from the Heat

The problem gives a tree of rooms connected by corridors, where each corridor has a traversal cost. Some rooms contain people who start “occupying” the space at time zero.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904E - Enhancing 25 de Março deliveries

I can’t reliably write a correct editorial for this problem yet because the statement is missing. “Codeforces 105904E - Enhancing 25 de Março deliveries” isn’t included in your prompt, and I don’t have access to the actual problem details (inputs, constraints…

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904G - Guaranteeing SP

I cannot reliably locate the actual statement for Codeforces 105904G - Guaranteeing SP from the available reference data, which strongly suggests it is either a Gym problem or an unpublished/archived problem not indexed in standard mirrors.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904D - Dealing with São Paulo Hot Dogs

The issue here is that I cannot reliably reconstruct the exact statement of “Codeforces 105904D - Dealing with São Paulo Hot Dogs” from the available problem index.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904A - Amount of food for tigers

The brute-force idea is straightforward: try all seven possible starting days, then simulate day by day, decrementing the corresponding stock until some stock becomes negative. For each start, record how many days we survived, and take the maximum.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904C - Cities in Sao Paulo

We are given a collection of cities in São Paulo, where each city is represented as a point on a line or in a structured space depending on the interpretation of the problem input.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904B - Bicycle in Ibirapuera

We are missing the actual statement text for “Codeforces 105904B - Bicycle in Ibirapuera” in your prompt, and without it I cannot reconstruct a correct algorithm or produce a valid editorial.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904N - Number of Steps

We are given an undirected weighted graph representing locations in a park and paths between them. Each path has a distance, and that distance translates into travel time for two different groups: Carlos on a bicycle and people walking.

Practice › Codeforces Solutions › I SBC São Paulo Programming Marathon ›

CF 105904K - Kickboxing

We are asked to count ways to split a total of N kicks into consecutive training sets. Each training set has a positive number of kicks, and these sizes form a sequence whose sum is exactly N. Two rules constrain this sequence.