question_title stringlengths 2 58 | question_content stringlengths 92 7.2k | platform stringclasses 1
value | question_id stringclasses 36
values | contest_id int64 1 1.01k | contest_date stringdate 2025-01-20 20:58:05 2025-01-20 20:58:05 | starter_code stringclasses 1
value | difficulty stringclasses 3
values | public_test_cases stringclasses 1
value | private_test_cases stringclasses 1
value | metadata stringclasses 1
value | code stringlengths 45 40k | iids_state listlengths 0 1.31k | iids_null_code listlengths 5 5 | iids_code listlengths 14 1.6k | input_ids listlengths 4.1k 4.1k | labels listlengths 4.1k 4.1k | attention_mask listlengths 4.1k 4.1k | iids_correct_completion listlengths 0 1.35k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Berland Square | Last year the world's largest square was built in Berland. It is known that the square can be represented as an infinite plane with an introduced Cartesian system of coordinates. On that square two sets of concentric circles were painted. Let's call the set of concentric circles with radii 1,<=2,<=...,<=*K* and the cen... | codeforces | C | 40 | 2025-01-20 20:58:05.360400 | hard | [] | [] | [] | def solve():
n = int(input())
a = list(map(int, input().split()))
MOD = 10**9 + 7
fact = [1] * (n + 1)
for i in range(2, n + 1):
fact[i] = (fact[i-1] * i) % MOD
total_sum = 0
import itertools
for perm in itertools.permutations(a):
f_a = 0
... | [
128000,
755,
11886,
4019,
262,
308,
284,
528,
5498,
2455,
262,
264,
284,
1160,
9325,
1577,
11,
1988,
1020,
7105,
12419,
1084,
262,
19186,
284,
220,
605,
334,
24,
489,
220,
22,
7361,
262,
2144,
284,
510,
16,
60,
353,
320,
77,
489,
... | [
[
128000,
755,
11886,
4019,
262,
308,
284,
528,
5498,
2455,
262,
264,
284,
1160,
9325,
1577,
11,
1988,
1020,
7105,
12419,
1084,
262,
19186,
284,
220,
605,
334,
24,
489,
220,
22,
7361,
... | [
128000,
755,
11886,
4019,
262,
308,
284,
528,
5498,
2455,
262,
264,
284,
1160,
9325,
1577,
11,
1988,
1020,
7105,
12419,
1084,
262,
19186,
284,
220,
605,
334,
24,
489,
220,
22,
7361,
262,
2144,
284,
510,
16,
60,
353,
320,
77,
489,
... | [
128000,
128006,
9125,
128007,
271,
38766,
1303,
33025,
2696,
25,
6790,
220,
2366,
18,
198,
15724,
2696,
25,
220,
1627,
10263,
220,
2366,
19,
271,
2675,
527,
46927,
264,
3823,
304,
264,
10344,
2082,
9659,
3465,
13,
4718,
3560,
374,
311,
... | [
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100,
-100... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | [
128000,
755,
11886,
4019,
262,
308,
284,
528,
5498,
2455,
262,
264,
284,
1160,
9325,
1577,
11,
1988,
1020,
7105,
12419,
1084,
262,
19186,
284,
220,
605,
334,
24,
489,
220,
22,
7361,
262,
2144,
284,
510,
16,
60,
353,
320,
77,
489,
... | |
The Great Mixing | "Sasha and Kolya decided to get drunk with Coke, again. This time they have *k* types of Coke. *i*-t(...TRUNCATED) | codeforces | C | 788 | 2025-01-20 20:58:05.360400 | hard | [] | [] | [] | "def solve():\n doctor_picture = []\n for _ in range(7):\n doctor_picture.append(list(i(...TRUNCATED) | [128000,755,11886,4019,262,10896,43506,284,4260,262,369,721,304,2134,7,22,997,286,10896,43506,2102,7(...TRUNCATED) | [[128000,755,11886,4019,262,10896,43506,284,4260,262,369,721,304,2134,7,22,997,286,10896,43506,2102,(...TRUNCATED) | [128000,755,11886,4019,262,10896,43506,284,4260,262,369,721,304,2134,7,22,997,286,10896,43506,2102,7(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,10896,43506,284,4260,262,369,721,304,2134,7,22,997,286,10896,43506,2102,7(...TRUNCATED) | |
Berzerk | "Rick and Morty are playing their own version of Berzerk (which has nothing in common with the famou(...TRUNCATED) | codeforces | A | 786 | 2025-01-20 20:58:05.360400 | hard | [] | [] | [] | "def solve():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n q (...TRUNCATED) | [128000,755,11886,4019,262,308,11,597,284,2472,1577,11,1988,1020,7105,2455,262,264,284,1160,9325,157(...TRUNCATED) | [[128000,755,11886,4019,262,308,11,597,284,2472,1577,11,1988,1020,7105,2455,262,264,284,1160,9325,15(...TRUNCATED) | [128000,755,11886,4019,262,308,11,597,284,2472,1577,11,1988,1020,7105,2455,262,264,284,1160,9325,157(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,308,11,597,284,2472,1577,11,1988,1020,7105,2455,262,264,284,1160,9325,157(...TRUNCATED) | |
Congruence Equation | "Given an integer $x$. Your task is to find out how many positive integers $n$ ($1 \\leq n \\leq x$)(...TRUNCATED) | codeforces | E | 919 | 2025-01-20 20:58:05.360400 | hard | [] | [] | [] | "def solve():\n s = input()\n n = len(s)\n ans = list(s)\n \n for i in range(n - 1):\(...TRUNCATED) | [
128000,
755,
11886,
4019,
262,
274,
284,
1988,
746,
262,
308,
284,
2479
] | [[128000,755,11886,4019,262,274,284,1988,746,262,308,284,2479,1161,8,220,674,41070,291,2479,311,2479(...TRUNCATED) | [128000,755,11886,4019,262,274,284,1988,746,262,308,284,2479,1161,340,262,8261,284,1160,1161,340,108(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [
128000,
755,
11886,
4019,
262,
274,
284,
1988,
746,
262,
308,
284,
2479,
1161,
340,
262
] | |
Mahmoud and Ehab and another array construction task | "Mahmoud has an array *a* consisting of *n* integers. He asked Ehab to find another array *b* of the(...TRUNCATED) | codeforces | D | 959 | 2025-01-20 20:58:05.360400 | medium | [] | [] | [] | "def solve():\n n, m = map(int, input().split())\n segments = []\n for _ in range(n):\n (...TRUNCATED) | [
128000,
755
] | [[128000,755,11294,15380,3659,72415,4019,262,3270,262,1115,734,48517,279,3158,315,2204,21483,627,108(...TRUNCATED) | [128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,21282,284,4260,262,36(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [
128000,
755
] | |
Oh Sweet Beaverette | "— Oh my sweet Beaverette, would you fancy a walk along a wonderful woodland belt with me? \n\n (...TRUNCATED) | codeforces | A2 | 331 | 2025-01-20 20:58:05.360400 | medium | [] | [] | [] | "def solve():\n n = int(input())\n perm = list(map(int, input().split()))\n \n original (...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,14175,284,1160,9325,1577,11,1988,1020,7105,1241(...TRUNCATED) | [[128000,755,11886,4019,262,308,284,528,5498,2455,262,14175,284,1160,9325,1577,11,1988,1020,7105,124(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,14175,284,1160,9325,1577,11,1988,1020,7105,1241(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,14175,284,1160,9325,1577,11,1988,1020,7105,1241(...TRUNCATED) | |
Water Taps | "Consider a system of *n* water taps all pouring water into the same container. The *i*-th water tap(...TRUNCATED) | codeforces | E | 954 | 2025-01-20 20:58:05.360400 | hard | [] | [] | [] | "def solve():\n n = int(input())\n names = []\n for _ in range(n):\n names.append(in(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,5144,284,4260,262,369,721,304,2134,1471,997,286(...TRUNCATED) | [[128000,755,11886,4019,262,308,284,528,5498,2455,262,5144,284,4260,262,369,721,304,2134,1471,997,28(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,5144,284,4260,262,369,721,304,2134,1471,997,286(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,5144,284,4260,262,369,721,304,2134,1471,997,286(...TRUNCATED) | |
Five-In-a-Row | "Alice and Bob play 5-in-a-row game. They have a playing field of size 10<=×<=10. In turns they put(...TRUNCATED) | codeforces | B | 825 | 2025-01-20 20:58:05.360400 | medium | [] | [] | [] | "def solve():\n n = int(input())\n \n if n == 0:\n print(0)\n return\n \n (...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,1084,262,422,308,624,220,15,512,286,1194,7,15,340,2(...TRUNCATED) | [[128000,755,11886,4019,262,308,284,528,5498,2455,1084,262,422,308,624,220,15,512,286,1194,7,15,340,(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,1084,262,422,308,624,220,15,512,286,1194,7,15,340,2(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,1084,262,422,308,624,220,15,512,286,1194,7,15,340,2(...TRUNCATED) | |
Nikita and stack | "Nikita has a stack. A stack in this problem is a data structure that supports two operations. Opera(...TRUNCATED) | codeforces | C | 756 | 2025-01-20 20:58:05.360400 | hard | [] | [] | [] | "def solve():\n n = int(input())\n digits = list(map(int, input().split()))\n \n def is_(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,19016,284,1160,9325,1577,11,1988,1020,7105,1241(...TRUNCATED) | [[128000,755,11886,4019,262,308,284,528,5498,2455,262,19016,284,1160,9325,1577,11,1988,1020,7105,124(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,19016,284,1160,9325,1577,11,1988,1020,7105,1241(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,308,284,528,5498,2455,262,19016,284,1160,9325,1577,11,1988,1020,7105,1241(...TRUNCATED) | |
Dragons | "Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to def(...TRUNCATED) | codeforces | A | 230 | 2025-01-20 20:58:05.360400 | medium | [] | [] | [] | "def solve():\n l, d, v, g, r = map(int, input().split())\n \n time_to_lights = d / v\n (...TRUNCATED) | [128000,755,11886,4019,262,326,11,294,11,348,11,342,11,436,284,2472,1577,11,1988,1020,7105,2455,1084(...TRUNCATED) | [[128000,755,11886,4019,262,326,11,294,11,348,11,342,11,436,284,2472,1577,11,1988,1020,7105,2455,108(...TRUNCATED) | [128000,755,11886,4019,262,326,11,294,11,348,11,342,11,436,284,2472,1577,11,1988,1020,7105,2455,1084(...TRUNCATED) | [128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,220,1627,(...TRUNCATED) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | [1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED) | [128000,755,11886,4019,262,326,11,294,11,348,11,342,11,436,284,2472,1577,11,1988,1020,7105,2455,1084(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4