JPC 4.0

12 problems from JPC 4.0 (contest 105315), difficulty -. 12/12 solutions verified against sample I/O.

12 items

JPC 4.0

Special | 12 problems | 12/12 verified | Difficulty - | 10m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Marble's Birthday				1m	✓
B	Noorhan's Birthday				45s	✓
C	Iyaad's Birthday				48s	✓
D	Manar's Birthday				49s	✓
E	Rama's Birthday				50s	✓
F	Osama's Birthday				50s	✓
G	Nagham's Birthday				55s	✓
H	Abdulrahman's Birthday				52s	✓
I	Zain's Birthday				47s	✓
J	Hamza's Birthday				1m 2s	✓
K	Ka3bool's Birthday				55s	✓
L	Monther's Birthday				51s	✓

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315L - Monther's Birthday

We are given multiple independent test cases. Each test case consists of several pairs of integers. For each pair $(a, b)$, we compute a value defined as $a^b$.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315K - Ka3bool's Birthday

We are maintaining a dynamic set of integers where elements are inserted and deleted one operation at a time. After every update, we need to compute how “fragmented” the set is when viewed on the number line.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315I - Zain's Birthday

We are given a row of tiles numbered from 0 up to n, and a cat starts at tile 0. From any tile i, the cat can jump forward to any tile j as long as j is strictly ahead and does not exceed k steps away, meaning 1 ≤ j − i ≤ k.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315H - Abdulrahman's Birthday

We are given a collection of items, each item has two values, a and b. From these items we must choose exactly k distinct indices i1 < i2 < ... < ik. The score of a chosen sequence is the sum of the selected a-values minus the maximum b-value among the selected elements.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315G - Nagham's Birthday

We are given a directed or undirected weighted graph for each test case, together with a designated start node and a target node.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315E - Rama's Birthday

We are given a sequence that describes cumulative gcd information of another hidden array. For each position $i$, the value $bi$ equals the gcd of the first $i$ elements of an unknown array $a$.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315A - Marble's Birthday

We are given several directed graphs, each described by nodes and directed edges. A directed edge from one node to another means you can travel only in that direction.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315D - Manar's Birthday

We are given several independent test cases. In each test case, there is a list of strings, and we want to count ordered pairs of distinct indices such that when we concatenate the first string with the second, the resulting string reads the same forward and backward.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315C - Iyaad's Birthday

We are given several independent experiments. In each experiment, there is a reference integer $D$ that represents the DNA of a specific cat, and a list of other cats represented by integers $ai$. Each integer encodes genetic traits as bits.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315J - Hamza's Birthday

Each test case describes a collection of dishes, where every dish belongs to a specific restaurant and has a numeric taste value. The key constraint is that you cannot mix restaurants. You must pick exactly one restaurant and take all dishes belonging to it.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315F - Osama's Birthday

We are given several collections of flower types, where each collection (called a bouquet) is essentially a set of allowed flower labels drawn from a universe of size at most 60. For each test case, Osama chooses exactly one bouquet and then builds a garden of length $m$.

Practice › Codeforces Solutions › JPC 4.0 ›

CF 105315B - Noorhan's Birthday

We are given a number of independent queries. Each query provides an integer n, and we must output a single integer a, where a is the prime number closest to n. If two primes are equally close, the smaller one must be chosen.