2020-2021 Winter Petrozavodsk Camp, Day 5: Almost Retired Dandelion Contest (XXI Open Cup, Grand Prix of Nizhny Novgorod)
13 problems from 2020-2021 Winter Petrozavodsk Camp, Day 5: Almost Retired Dandelion Contest (XXI Open Cup, Grand Prix of Nizhny Novgorod) (contest 103260), difficulty -. 1/13 solutions verified against sample I/O.
2020-2021 Winter Petrozavodsk Camp, Day 5: Almost Retired Dandelion Contest (XXI Open Cup, Grand Prix of Nizhny Novgorod)
Special | 13 problems | 1/13 verified | Difficulty - | 10m 47s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Assignment Problem | 35s | ||||
| B | Lockout vs tourist | 2m 33s | ||||
| C | Multiple? | 31s | ||||
| D | Output Limit Exceeded | 29s | ||||
| E | Smol Vertex Cover | 31s | ||||
| F | Thanks to MikeMirzayanov | 26s | ||||
| G | Remove the Prime | 44s | ✓ | |||
| H | Excluded Min | 25s | ||||
| I | Trade | 28s | ||||
| J | Increasing or Decreasing | 30s | ||||
| K | Rectangle Painting | 35s | ||||
| L | Extreme Wealth | 32s | ||||
| M | Discrete Logarithm is a Joke | 2m 28s |
CF 103260M - Discrete Logarithm is a Joke
Let $I subseteq mathbb{C}[x1,dots,xs]$ be a homogeneous polynomial ideal. Let $It$ denote the vector space of homogeneous polynomials of degree $t$ contained in $I$. Define $$Nt = dim It,$$ the maximum number of linearly independent degree-$t$ elements of $I$.
CF 103260L - Extreme Wealth
I’m missing the actual problem content for Codeforces 103260L - Extreme Wealth in your prompt (the statement, input/output description, and constraints are empty).
CF 103260K - Rectangle Painting
I can’t reliably write a correct Codeforces editorial for “103260K - Rectangle Painting” because the actual problem statement (operations, constraints, and goal) is missing from your prompt.
CF 103260B - Lockout vs tourist
Let $(a{ij})$ be an $mtimes n$ contingency table with nonnegative integer entries, row sums $ri=sum{j=1}^n a{ij},$ and column sums $cj=sum{i=1}^m a{ij},$ with $sum{i=1}^m ri=sum{j=1}^n cj$.
CF 103260J - Increasing or Decreasing
I don't have enough information to write a correct editorial. The prompt identifies the problem as Codeforces 103260J - Increasing or Decreasing, but the Problem Statement, Input, and Output sections are empty.
CF 103260I - Trade
The problem statement is missing from your prompt, so there is no way to reconstruct the intended task, constraints, or required output for Codeforces 103260I - Trade.
CF 103260H - Excluded Min
I can't write an accurate editorial for this problem because the prompt does not include the actual problem statement.
CF 103260G - Remove the Prime
We are given an array of positive integers. Two players alternate turns, and on each turn a player performs a very specific reduction operation: they pick a prime number $p$ and then choose a contiguous segment of the array such that every number in that segment is divisible…
CF 103260F - Thanks to MikeMirzayanov
I can't write a correct editorial for this problem because the prompt does not include the actual problem statement.
CF 103260E - Smol Vertex Cover
The problem statement section is empty, so there isn’t enough information to correctly derive the solution, constraints, or even the core task.
CF 103260D - Output Limit Exceeded
I can't write a correct editorial because the problem statement is missing. The prompt only provides the title, Codeforces 103260D - Output Limit Exceeded, but the sections for Problem Statement, Input, and Output are empty.
CF 103260A - Assignment Problem
I don’t have the actual problem statement for Codeforces 103260A - Assignment Problem, and without it there isn’t a reliable way to reconstruct the intended solution or write a correct editorial.
CF 103260C - Multiple?
I can't write a correct editorial because the actual problem statement is missing. The prompt only includes: - Problem: Codeforces 103260C - Multiple?