Asu Coding Cup 4

10 problems from Asu Coding Cup 4 (contest 102397), difficulty -. 10/10 solutions verified against sample I/O.

10 items

Asu Coding Cup 4

Special | 10 problems | 10/10 verified | Difficulty - | 44m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Bashar and SHAWERMA!				4m 15s	✓
B	Calculate The Area				1m 35s	✓
C	The Ending Point				3m 46s	✓
D	Bashar and the bad land (Easy)				6m 54s	✓
E	Bashar and the bad land (Hard)				1m 31s	✓
F	Weird Game				6m 52s	✓
G	Super Weird Game				4m 45s	✓
H	Mahmoud and the flagstones				4m 29s	✓
I	Dr.Hjjawi and the MCQ				5m 22s	✓
J	AbuTahun and Flash Memories				4m 39s	✓

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397E - Bashar and the bad land (Hard)

The invariant is that before processing each new right endpoint, left points to the smallest possible left boundary after all previous shrinking.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397B - Calculate The Area

We need to reconstruct the dimensions of a rectangular piece of land from its area. The input contains a single integer n, representing the rectangle's area. We need to print two positive integers height and width whose product is exactly n.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397F - Weird Game

There are n cupcakes on the table, and Mahmoud makes the first move. On each turn, the current player may eat exactly one cupcake. If the current number of cupcakes is even, the player also has the option to eat exactly half of them.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397C - The Ending Point

We start at a grid point (x, y) and receive a string describing a sequence of unit moves. Each character changes exactly one coordinate: U increases y, D decreases y, L decreases x, and R increases x.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397J - AbuTahun and Flash Memories

We have n solution files, and every file occupies exactly x GB. A single flash memory can hold at most a GB, and a file must stay entirely inside one memory. The goal is to find the smallest number of flash memories needed to store all n files.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397I - Dr.Hjjawi and the MCQ

There are n multiple-choice questions, and Ayoub answered each question with one letter from a through e. The crucial extra information is that the correct answer is the same letter for every question. We do not know which of the five letters it is.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397H - Mahmoud and the flagstones

We have a sequence of n flagstones, and each flagstone has a color a[i]. We need to count every nonempty subset of positions whose flagstones all have exactly the same color.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397G - Super Weird Game

Each player owns an array of length n. For a fixed target sum k, a pair of positions (i, j) is good when i < j and the two values add up to k. We need to count the good pairs independently in Mahmoud's array and Bashar's array, then compare the two counts.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397D - Bashar and the bad land (Easy)

There are n houses arranged in a line, and house i contains a[i] coins. Bashar may choose any house as his starting point and any house as his stopping point. While walking between them, he visits every house on that segment and collects all its coins.

Practice › Codeforces Solutions › Asu Coding Cup 4 ›

CF 102397A - Bashar and SHAWERMA!

Bashar wants to buy exactly x shawerma sandwiches. Every sandwich costs exactly 2 JDs, so the required amount of money is the price of one sandwich multiplied by the number of sandwiches. The input contains one integer x, representing the number of sandwiches Bashar wants to buy.