Copa Do Matão, University Of São Paulo Programming Contest

15 problems from Copa Do Matão, University Of São Paulo Programming Contest (contest 103485), difficulty -. 5/15 solutions verified against sample I/O.

15 items

Copa Do Matão, University Of São Paulo Programming Contest

Special | 15 problems | 5/15 verified | Difficulty - | 9m 15s

#	Problem	Time	✓
A	Trying to Impress Cleopatra	34s
B	Carlitos and the end of the world!	36s
C	Construction of precious stones	33s
D	Circular Pharaoh	49s	✓
E	Protecting Roads	53s	✓
F	Ramesses, Ra, and Roots	47s	✓
G	The Diversity of the Library of Alexandria	35s
H	On the Way to Shopping - Easy	45s	✓
I	On The Way To Shopping	31s
J	Feedback Meetings	35s
K	Tributes to the Pharaohs	52s	✓
L	A tale of two cities	29s
M	Constellation collection	27s
N	Game Show	25s
O	The perfect base	24s

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485M - Constellation collection

The problem statement section is empty, so there’s not enough information to write a correct editorial for “Codeforces 103485M - Constellation collection”.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485O - The perfect base

I can’t write a correct editorial for Codeforces 103485O - The perfect base because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485N - Game Show

I’m missing the actual statement for Codeforces 103485N - Game Show, and without it I can’t reliably reconstruct the intended model, constraints, or solution.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485K - Tributes to the Pharaohs

We are given one year model with a circular calendar of length k, where days repeat every k steps. There are n pharaohs, and each pharaoh is assigned a region with two phases: planting takes p[i] time units, and harvesting takes c[i] time units.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485L - A tale of two cities

I can write the full editorial in exactly that format, but I am missing the most important piece: the actual problem statement.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485J - Feedback Meetings

The statement is missing, so there’s nothing concrete to restate or derive a solution from. “Codeforces 103485J - Feedback Meetings” is referenced, but the actual problem definition (input, output, constraints, and rules) is empty in your prompt.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485H - On the Way to Shopping - Easy

We are given a shopping scenario on a line of locations, where each position represents a point on a path and some of these positions are special.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485I - On The Way To Shopping

I don’t have the actual statement for Codeforces 103485I - On The Way To Shopping in your prompt, and I can’t reliably reconstruct it from the title alone without risking inventing details.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485G - The Diversity of the Library of Alexandria

I can’t produce a correct editorial yet because the problem statement is missing. Right now, I only see the title “Codeforces 103485G - The Diversity of the Library of Alexandria” but no description of the task, inputs, outputs, or constraints.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485E - Protecting Roads

We are given a tree of villages connected by weighted roads. Each road has a length, and the entire structure allows travel between any two villages along unique simple paths. On top of this tree, we receive two kinds of online operations.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485D - Circular Pharaoh

We are given a string placed on a circle, so its last character is adjacent to its first. This string is formed by repeatedly concatenating copies of some unknown base word, the pharaoh’s original name.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485F - Ramesses, Ra, and Roots

We are given a list of integers, and for each query value $r$, we must count how many of those integers are perfect $r$-th powers. In other words, for a fixed $r$, we want to know how many values $ai$ can be written as $x^r$ for some integer $x$.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485B - Carlitos and the end of the world!

I can’t reliably write a correct, detailed editorial for this problem yet because the actual problem statement content is not fully available from what I retrieved.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485A - Trying to Impress Cleopatra

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title and empty Input/Output sections, but no description of what “Trying to Impress Cleopatra” is asking us to compute.

Practice › Codeforces Solutions › Copa Do Matão, University Of São Paulo Programming Contest ›

CF 103485C - Construction of precious stones

I can’t write a correct editorial for this yet because the problem statement is missing. “Codeforces 103485C - Construction of precious stones” isn’t enough to reconstruct the task reliably, and guessing would risk producing a completely incorrect solution.