ASU Coding Cup 10

13 problems from ASU Coding Cup 10 (contest 105940), difficulty -. 3/13 solutions verified against sample I/O.

13 items

ASU Coding Cup 10

Special | 13 problems | 3/13 verified | Difficulty - | 6m 28s

#	Problem	Rating	Tags	Accepted	Time	✓
A	The Giraffe and the Beautiful number				30s
B	The Great Zebra Quest at ASZoo (Easy)				28s
C	The Great Zebra Quest at ASZoo (Hard)				43s	✓
D	ASZoo Animals				41s	✓
E	Kilani The Tiger (Easy)				28s
F	Kilani The Tiger (Hard)				25s
G	Cheetahs Hunting Deers (Easy)				25s
H	Cheetahs Hunting Deers (Hard)				21s
I	The Youngest in ASZoo				27s
J	Zmeh The ASZoo Keeper				32s
K	The Cage in ASZoo				37s	✓
L	The Elephant and the Array				24s
M	The Smartest at ASZoo				27s

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940M - The Smartest at ASZoo

The problem statement section is empty, so there isn’t enough information to reconstruct what Codeforces 105940M - The Smartest at ASZoo is actually asking.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940K - The Cage in ASZoo

The cage can hold exactly k animals. There are n animal families, and a family can contribute any nonnegative number of animals because every family has infinitely many members. Family i contributes animals of weight a[i].

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940L - The Elephant and the Array

I can’t reliably write a correct editorial for this yet because the actual problem statement for Codeforces 105940L - The Elephant and the Array is missing from your prompt.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940J - Zmeh The ASZoo Keeper

The problem statement for “Codeforces 105940J - Zmeh The ASZoo Keeper” is not included in your prompt, so there isn’t enough information to construct a correct editorial.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940I - The Youngest in ASZoo

I can’t reliably reconstruct the statement of “Codeforces 105940I - The Youngest in ASZoo” from the available context.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940H - Cheetahs Hunting Deers (Hard)

I can write the full editorial, but I need the actual problem details first. The prompt includes the title “Codeforces 105940H - Cheetahs Hunting Deers (Hard)” but the Problem Statement, Input, and Output sections are empty, and I do not have enough information to…

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940G - Cheetahs Hunting Deers (Easy)

The problem statement for “Codeforces 105940G - Cheetahs Hunting Deers (Easy)” is missing from your prompt, so I don’t have enough information to write a correct editorial.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940D - ASZoo Animals

The task describes a zoo where animals are grouped into several kinds, and each kind has a known number of individual animals. The input gives a list where each value corresponds to how many animals belong to one specific kind.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940F - Kilani The Tiger (Hard)

Sure. Please provide the Codeforces problem statement (or link, title, constraints, and any examples). I’ll write a detailed competitive programming editorial with: - Problem restatement and observations - Key insight / derivation - Algorithm explanation - Proof of correctness…

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940E - Kilani The Tiger (Easy)

I can’t responsibly write the full editorial yet because the actual problem statement for Codeforces 105940E - Kilani The Tiger (Easy) is not available in your prompt and it is not reliably accessible from the contest listing alone.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940C - The Great Zebra Quest at ASZoo (Hard)

This problem asks us to work on an undirected, unweighted graph that represents the paths inside a zoo. Some vertices contain zebra enclosures. For every vertex, we need the shortest number of edges needed to reach any vertex containing a zebra enclosure.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940A - The Giraffe and the Beautiful number

The problem statement section is empty, so I don’t have the actual task (inputs, outputs, or rules). Without that, I can’t produce a correct editorial or derive any algorithmic solution.

Practice › Codeforces Solutions › ASU Coding Cup 10 ›

CF 105940B - The Great Zebra Quest at ASZoo (Easy)

I’m missing the actual problem statement, and for Codeforces tasks that makes it impossible to write a correct editorial without guessing.