question_title
string | question_content
string | platform
string | question_id
string | contest_id
int64 | contest_date
string | starter_code
string | difficulty
string | output
string | code
string | verdict
string | state
string | correct_completion
string | t
int64 | id
int64 | completion
string | null_code
sequence | hn_code
sequence | input_ids_code
sequence | attention_mask_code
sequence | input_ids_null_code
sequence | attention_mask_null_code
sequence | input_ids_hn_code
sequence | attention_mask_hn_code
sequence | input_ids_state
sequence | attention_mask_state
sequence | input_ids_state_ar
sequence | attention_mask_state_ar
sequence | input_ids_next_state
sequence | attention_mask_next_state
sequence | empowerment
sequence |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Two Subsequences
| "On an IT lesson Valera studied data compression. The teacher told about a new method, which we shal(...TRUNCATED)
|
codeforces
|
E
| 83
|
2025-01-20T20:58:05.360400
|
hard
| "```python\nimport sys\nimport functools\nfrom itertools import accumulate\n\ndef find_min_length(se(...TRUNCATED)
| "import sys\nimport functools\nfrom itertools import accumulate\n\ndef find_min_length(seq):\n @f(...TRUNCATED)
|
OK
| "import sys\nimport functools\nfrom itertools import accumulate\n\ndef find_min_length(seq):\n @f(...TRUNCATED)
|
* (max_len + 1) for _ in range(n+1)]
for i in range(1, n+1):
for
| 117
| 0
|
* (max_len + 1) for _ in range(n+1)]
for i in range(1, n+1):
for
| ["import sys\nimport functools\nfrom itertools import accumulate\n\ndef find_min_length(seq):\n @(...TRUNCATED)
| ["import sys\nimport functools\nfrom itertools import accumulate\n\ndef find_min_length(seq):\n @(...TRUNCATED)
| [128000,475,5826,198,475,57566,198,1527,42431,1179,47376,271,755,1505,7408,5228,35920,997,262,571,12(...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,475,5826,198,475,57566,198,1527,42431,1179,47376,271,755,1505,7408,5228,35920,997,262,571,1(...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,(...TRUNCATED)
| [[128000,475,5826,198,475,57566,198,1527,42431,1179,47376,271,755,1505,7408,5228,35920,997,262,571,1(...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,(...TRUNCATED)
| [128000,475,5826,198,475,57566,198,1527,42431,1179,47376,271,755,1505,7408,5228,35920,997,262,571,12(...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,475,5826,198,475,57566,198,1527,42431,1179,47376,271,755,1505,7408,5228,35920,997,262,571,12(...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,475,5826,198,475,57566,198,1527,42431,1179,47376,271,755,1505,7408,5228,35920,997,262,571,12(...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)
| [[[-0.11135204881429672,0.07182767242193222,-0.32121139764785767,-0.05655825510621071,-0.43913930654(...TRUNCATED)
|
|
Letter
| "Patrick has just finished writing a message to his sweetheart Stacey when he noticed that the messa(...TRUNCATED)
|
codeforces
|
C
| 180
|
2025-01-20T20:58:05.360400
|
medium
| "```python\ndef solve(message):\n count_upper = 0\n count_lower = 0\n operations = 0\n\n (...TRUNCATED)
| "def solve(message):\n count_upper = 0\n count_lower = 0\n operations = 0\n\n for char i(...TRUNCATED)
|
OK
| "def solve(message):\n count_upper = 0\n count_lower = 0\n operations = 0\n\n for char i(...TRUNCATED)
| " for i in range(len(message)):\n if message[i].isupper():\n if index > count_lowe(...TRUNCATED)
| 64
| 1
| " for i in range(len(message)):\n if message[i].isupper():\n if index > count_lowe(...TRUNCATED)
| ["def solve(message):\n count_upper = 0\n count_lower = 0\n operations = 0\n\n for char (...TRUNCATED)
| ["def solve(message):\n count_upper = 0\n count_lower = 0\n operations = 0\n\n for char (...TRUNCATED)
| [128000,755,11886,7483,997,262,1797,35545,284,220,15,198,262,1797,31525,284,220,15,198,262,7677,284,(...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,7483,997,262,1797,35545,284,220,15,198,262,1797,31525,284,220,15,198,262,7677,284(...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,(...TRUNCATED)
| [[128000,755,11886,7483,997,262,1797,35545,284,220,15,198,262,1797,31525,284,220,15,198,262,7677,284(...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,(...TRUNCATED)
| [128000,755,11886,7483,997,262,1797,35545,284,220,15,198,262,1797,31525,284,220,15,198,262,7677,284,(...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,7483,997,262,1797,35545,284,220,15,198,262,1797,31525,284,220,15,198,262,7677,284,(...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,7483,997,262,1797,35545,284,220,15,198,262,1797,31525,284,220,15,198,262,7677,284,(...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)
| [[[2.209988594055176,1.6733111143112183,2.07871675491333,1.7452064752578735,2.2456705570220947,2.394(...TRUNCATED)
|
|
Burning Midnight Oil
| "One day a highly important task was commissioned to Vasya — writing a program in a night. The pro(...TRUNCATED)
|
codeforces
|
B
| 165
|
2025-01-20T20:58:05.360400
|
medium
| "```python\n# Read input from the user\nn, k = map(int, input().split())\n\n# Initialize the minimum(...TRUNCATED)
| "# Read input from the user\nn, k = map(int, input().split())\n\n# Initialize the minimum allowed va(...TRUNCATED)
|
OK
| "# Read input from the user\nn, k = map(int, input().split())\n\n# Initialize the minimum allowed va(...TRUNCATED)
| " equal to n\nwhile total_lines < n:\n # Increment the minimum allowed value of v\n min_v += 1(...TRUNCATED)
| 67
| 2
| " equal to n\nwhile total_lines < n:\n # Increment the minimum allowed value of v\n min_v += 1(...TRUNCATED)
| ["# Read input from the user\nn, k = map(int, input().split())\n\n# Initialize the minimum allowed v(...TRUNCATED)
| ["# Read input from the user\nn, k = map(int, input().split())\n\n# Initialize the minimum allowed v(...TRUNCATED)
| [128000,2,4557,1988,505,279,1217,198,77,11,597,284,2472,1577,11,1988,1020,7105,12647,2,9185,279,8187(...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,2,4557,1988,505,279,1217,198,77,11,597,284,2472,1577,11,1988,1020,7105,12647,2,9185,279,818(...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,(...TRUNCATED)
| [[128000,2,4557,1988,505,279,1217,198,77,11,597,284,2472,1577,11,1988,1020,7105,12647,2,9185,279,818(...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,(...TRUNCATED)
| [128000,2,4557,1988,505,279,1217,198,77,11,597,284,2472,1577,11,1988,1020,7105,12647,2,9185,279,8187(...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,2,4557,1988,505,279,1217,198,77,11,597,284,2472,1577,11,1988,1020,7105,12647,2,9185,279,8187(...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,2,4557,1988,505,279,1217,198,77,11,597,284,2472,1577,11,1988,1020,7105,12647,2,9185,279,8187(...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)
| [[[-0.6401770710945129,-0.17556717991828918,-0.562056303024292,-0.5736585855484009,0.365394800901412(...TRUNCATED)
|
|
Little Elephant and Strings
| "The Little Elephant loves strings very much. \n\nHe has an array *a* from *n* strings, consisting o(...TRUNCATED)
|
codeforces
|
E
| 204
|
2025-01-20T20:58:05.360400
|
hard
| "```python\nimport sys\ninput = sys.stdin.readline\nfrom collections import defaultdict, deque\n\ncl(...TRUNCATED)
| "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict, deque\n\nclass ACtrie:(...TRUNCATED)
|
OK
| "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict, deque\n\nclass ACtrie:(...TRUNCATED)
|
n, k = map(int, input().split())
a = [input().strip() for _ in range(n)]
trie = AC
| 251
| 3
|
n, k = map(int, input().split())
a = [input().strip() for _ in range(n)]
trie = AC
| ["import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict, deque\n\nclass ACtrie(...TRUNCATED)
| ["import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict, deque\n\nclass ACtrie(...TRUNCATED)
| [128000,475,5826,198,1379,284,5826,44284,32900,198,1527,15661,1179,44008,11,43050,271,1058,10807,910(...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,475,5826,198,1379,284,5826,44284,32900,198,1527,15661,1179,44008,11,43050,271,1058,10807,91(...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,(...TRUNCATED)
| [[128000,475,5826,198,1379,284,5826,44284,32900,198,1527,15661,1179,44008,11,43050,271,1058,10807,91(...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,(...TRUNCATED)
| [128000,475,5826,198,1379,284,5826,44284,32900,198,1527,15661,1179,44008,11,43050,271,1058,10807,910(...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,475,5826,198,1379,284,5826,44284,32900,198,1527,15661,1179,44008,11,43050,271,1058,10807,910(...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,475,5826,198,1379,284,5826,44284,32900,198,1527,15661,1179,44008,11,43050,271,1058,10807,910(...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)
| [[[1.1240723133087158,0.9929758310317993,0.5859008431434631,0.20935973525047302,0.12433840334415436,(...TRUNCATED)
|
|
Coin Troubles
| "In the Isle of Guernsey there are *n* different types of coins. For each *i* (1<=≤<=*i*<=≤<=*n*(...TRUNCATED)
|
codeforces
|
C
| 283
|
2025-01-20T20:58:05.360400
|
hard
| "```python\nimport sys\n\n# Define the modulo value\nMOD = 1000000007\n\n# Define a class to represe(...TRUNCATED)
| "import sys\n\n# Define the modulo value\nMOD = 1000000007\n\n# Define a class to represent a monoid(...TRUNCATED)
|
OK
| "import sys\n\n# Define the modulo value\nMOD = 1000000007\n\n# Define a class to represent a monoid(...TRUNCATED)
|
= MapFunction(cmap[i + 1].m, cmap[i + 1].c, r // gcd(r, coins[i]), coins[i
| 359
| 4
|
= MapFunction(cmap[i + 1].m, cmap[i + 1].c, r // gcd(r, coins[i]), coins[i
| ["import sys\n\n# Define the modulo value\nMOD = 1000000007\n\n# Define a class to represent a monoi(...TRUNCATED)
| ["import sys\n\n# Define the modulo value\nMOD = 1000000007\n\n# Define a class to represent a monoi(...TRUNCATED)
| [128000,475,5826,271,2,19127,279,60964,907,198,27557,284,220,1041,931,931,22,271,2,19127,264,538,311(...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,475,5826,271,2,19127,279,60964,907,198,27557,284,220,1041,931,931,22,271,2,19127,264,538,31(...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,(...TRUNCATED)
| [[128000,475,5826,271,2,19127,279,60964,907,198,27557,284,220,1041,931,931,22,271,2,19127,264,538,31(...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,(...TRUNCATED)
| [128000,475,5826,271,2,19127,279,60964,907,198,27557,284,220,1041,931,931,22,271,2,19127,264,538,311(...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,475,5826,271,2,19127,279,60964,907,198,27557,284,220,1041,931,931,22,271,2,19127,264,538,311(...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,475,5826,271,2,19127,279,60964,907,198,27557,284,220,1041,931,931,22,271,2,19127,264,538,311(...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)
| [[[0.07336507737636566,-0.19413816928863525,-0.19794052839279175,-0.23370103538036346,-0.37002068758(...TRUNCATED)
|
|
Vanya and Fence
| "Vanya and his friends are walking along the fence of height *h* and they do not want the guard to n(...TRUNCATED)
|
codeforces
|
A
| 677
|
2025-01-20T20:58:05.360400
|
easy
| "```python\nn, h = map(int, input().split())\na = list(map(int, input().split()))\n\n# Sort the arra(...TRUNCATED)
| "n, h = map(int, input().split())\na = list(map(int, input().split()))\n\n# Sort the array in descen(...TRUNCATED)
|
OK
|
n, h = map(int, input
| "().split())\na = list(map(int, input().split()))\n\n# Sort the array in descending order to priorit(...TRUNCATED)
| 9
| 5
| "().split())\na = list(map(int, input().split()))\n\n# Sort the array in descending order to priorit(...TRUNCATED)
| ["n, h = map(int, input().split())\nx = list(map(int, input().split()))\nx.sort()\n\na = h - x[0]\nb(...TRUNCATED)
| ["n, h = map(int, input().split())\na = list(map(int, input().split()))\ncurr_width = 0\nmax_width =(...TRUNCATED)
| [128000,77,11,305,284,2472,1577,11,1988,1020,7105,2455,64,284,1160,9325,1577,11,1988,1020,7105,51062(...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,77,11,305,284,2472,1577,11,1988,77,11,305,284,2472,1577,11,1988,1020,7105,2455,87,284,1160,(...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,(...TRUNCATED)
| [[128000,77,11,305,284,2472,1577,11,1988,1020,7105,2455,64,284,1160,9325,1577,11,1988,1020,7105,1241(...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,(...TRUNCATED)
| [128000,77,11,305,284,2472,1577,11,1988,128001,128001,128001,128001,128001,128001,128001,128001,1280(...TRUNCATED)
| [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0(...TRUNCATED)
| [128000,77,11,305,284,2472,1577,11,1988,1020,7105,2455,64,284,1160,9325,1577,11,1988,1020,7105,51062(...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,0,0,0,0,0,0,0,0,0,0,0(...TRUNCATED)
| [128000,77,11,305,284,2472,1577,11,1988,1020,7105,2455,64,284,1160,9325,1577,11,1988,1020,7105,51062(...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)
| [[[0.7481697201728821,-0.11998312920331955,0.3787635862827301,4.469226360321045,4.221975326538086,2.(...TRUNCATED)
|
|
Berland Elections
| "The elections to Berland parliament are happening today. Voting is in full swing!\n\nTotally there (...TRUNCATED)
|
codeforces
|
F
| 847
|
2025-01-20T20:58:05.360400
|
hard
| "```python\nfrom collections import defaultdict\nimport sys\n\ndef solution():\n n, k, m, a = map(...TRUNCATED)
| "from collections import defaultdict\nimport sys\n\ndef solution():\n n, k, m, a = map(int, input(...TRUNCATED)
|
OK
| "from collections import defaultdict\nimport sys\n\ndef solution():\n n, k, m, a = map(int, input(...TRUNCATED)
| " seats[i] = 3\n\n result = [str(seats[i]) for i in range(n)]\n print(\" \".join(re(...TRUNCATED)
| 211
| 6
| " seats[i] = 3\n\n result = [str(seats[i]) for i in range(n)]\n print(\" \".join(re(...TRUNCATED)
| ["from collections import defaultdict\nimport sys\n\ndef solution():\n n, k, m, a = map(int, inpu(...TRUNCATED)
| ["from collections import defaultdict\nimport sys\n\ndef solution():\n n, k, m, a = map(int, inpu(...TRUNCATED)
| [128000,1527,15661,1179,44008,198,475,5826,271,755,6425,4019,262,308,11,597,11,296,11,264,284,2472,1(...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,1527,15661,1179,44008,198,475,5826,271,755,6425,4019,262,308,11,597,11,296,11,264,284,2472,(...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,(...TRUNCATED)
| [[128000,1527,15661,1179,44008,198,475,5826,271,755,6425,4019,262,308,11,597,11,296,11,264,284,2472,(...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,(...TRUNCATED)
| [128000,1527,15661,1179,44008,198,475,5826,271,755,6425,4019,262,308,11,597,11,296,11,264,284,2472,1(...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,1527,15661,1179,44008,198,475,5826,271,755,6425,4019,262,308,11,597,11,296,11,264,284,2472,1(...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,1527,15661,1179,44008,198,475,5826,271,755,6425,4019,262,308,11,597,11,296,11,264,284,2472,1(...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)
| [[[0.4826664328575134,-0.032168153673410416,1.552646517753601,1.1300466060638428,1.173048496246338,0(...TRUNCATED)
|
|
Ice Skating
| "Bajtek is learning to skate on ice. He's a beginner, so his only mode of transportation is pushing (...TRUNCATED)
|
codeforces
|
A
| 217
|
2025-01-20T20:58:05.360400
|
medium
| "```python\nimport sys\nfrom collections import deque\nfrom typing import Set, List\n\ndef read_inpu(...TRUNCATED)
| "import sys\nfrom collections import deque\nfrom typing import Set, List\n\ndef read_inputs() -> (Se(...TRUNCATED)
|
OK
| "import sys\nfrom collections import deque\nfrom typing import Set, List\n\ndef read_inputs() -> (Se(...TRUNCATED)
| " return True\n\ndef is_connected(graph: Dict[Tuple[Tuple[int, int], Tuple[int, int]], int], n: int)(...TRUNCATED)
| 277
| 7
| " return True\n\ndef is_connected(graph: Dict[Tuple[Tuple[int, int], Tuple[int, int]], int], n: int)(...TRUNCATED)
| ["import sys\nfrom collections import deque\nfrom typing import Set, List\n\ndef read_inputs() -> (S(...TRUNCATED)
| ["import sys\nfrom collections import deque\nfrom typing import Set, List\n\ndef read_inputs() -> (S(...TRUNCATED)
| [128000,475,5826,198,1527,15661,1179,43050,198,1527,20061,1179,2638,11,1796,271,755,1373,29657,368,1(...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,475,5826,198,1527,15661,1179,43050,198,1527,20061,1179,2638,11,1796,271,755,1373,29657,368,(...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,(...TRUNCATED)
| [[128000,475,5826,198,1527,15661,1179,43050,198,1527,20061,1179,2638,11,1796,271,755,1373,29657,368,(...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,(...TRUNCATED)
| [128000,475,5826,198,1527,15661,1179,43050,198,1527,20061,1179,2638,11,1796,271,755,1373,29657,368,1(...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,475,5826,198,1527,15661,1179,43050,198,1527,20061,1179,2638,11,1796,271,755,1373,29657,368,1(...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,475,5826,198,1527,15661,1179,43050,198,1527,20061,1179,2638,11,1796,271,755,1373,29657,368,1(...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)
| [[[0.8348053693771362,1.1412632465362549,1.1206616163253784,0.9318076372146606,0.9024810791015625,0.(...TRUNCATED)
|
|
Points
| "Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian co(...TRUNCATED)
|
codeforces
|
D
| 19
|
2025-01-20T20:58:05.360400
|
hard
| "```python\nimport sys\n\nclass Point:\n def __init__(self, x, y):\n self.x = x\n s(...TRUNCATED)
| "import sys\n\nclass Point:\n def __init__(self, x, y):\n self.x = x\n self.y = y\n(...TRUNCATED)
|
OK
| "import sys\n\nclass Point:\n def __init__(self, x, y):\n self.x = x\n self.y = y\n(...TRUNCATED)
| " tree[p] = None\n else:\n tree[p] = p\n return\n\n mid = (lo + hi) // 2(...TRUNCATED)
| 242
| 8
| " tree[p] = None\n else:\n tree[p] = p\n return\n\n mid = (lo + hi) // 2(...TRUNCATED)
| ["import sys\n\nclass Point:\n def __init__(self, x, y):\n self.x = x\n self.y = y\(...TRUNCATED)
| ["import sys\n\nclass Point:\n def __init__(self, x, y):\n self.x = x\n self.y = y\(...TRUNCATED)
| [128000,475,5826,271,1058,5236,512,262,711,1328,2381,3889,726,11,865,11,379,997,286,659,2036,284,865(...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,475,5826,271,1058,5236,512,262,711,1328,2381,3889,726,11,865,11,379,997,286,659,2036,284,86(...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,(...TRUNCATED)
| [[128000,475,5826,271,1058,5236,512,262,711,1328,2381,3889,726,11,865,11,379,997,286,659,2036,284,86(...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,(...TRUNCATED)
| [128000,475,5826,271,1058,5236,512,262,711,1328,2381,3889,726,11,865,11,379,997,286,659,2036,284,865(...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,475,5826,271,1058,5236,512,262,711,1328,2381,3889,726,11,865,11,379,997,286,659,2036,284,865(...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,475,5826,271,1058,5236,512,262,711,1328,2381,3889,726,11,865,11,379,997,286,659,2036,284,865(...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)
| [[[0.07361335307359695,0.3635956943035126,0.11191963404417038,0.3045228123664856,0.2031753808259964,(...TRUNCATED)
|
|
Walking!
| "There is a sand trail in front of Alice's home.\n\nIn daytime, people walk over it and leave a foot(...TRUNCATED)
|
codeforces
|
E
| 578
|
2025-01-20T20:58:05.360400
|
hard
| "```python\nimport sys\n\ns = input()\n\nleft = [i for i in s if i == 'L']\nright = [i for i in s if(...TRUNCATED)
| "import sys\n\ns = input()\n\nleft = [i for i in s if i == 'L']\nright = [i for i in s if i == 'R']\(...TRUNCATED)
|
OK
| "import sys\n\ns = input()\n\nleft = [i for i in s if i == 'L']\nright = [i for i in s if i == 'R']\(...TRUNCATED)
| "answer = []\n\nfor L, R in zip(left, right):\n if L.index(R) > R.index(L):\n answer.appen(...TRUNCATED)
| 36
| 9
| "answer = []\n\nfor L, R in zip(left, right):\n if L.index(R) > R.index(L):\n answer.appen(...TRUNCATED)
| ["import sys\n\ns = input()\n\nleft = [i for i in s if i == 'L']\nright = [i for i in s if i == 'R'](...TRUNCATED)
| ["import sys\n\ns = input()\n\nleft = [i for i in s if i == 'L']\nright = [i for i in s if i == 'R'](...TRUNCATED)
| [128000,475,5826,271,82,284,1988,2892,2414,284,510,72,369,602,304,274,422,602,624,364,43,4532,1315,2(...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,475,5826,271,82,284,1988,2892,2414,284,510,72,369,602,304,274,422,602,624,364,43,4532,1315,(...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,(...TRUNCATED)
| [[128000,475,5826,271,82,284,1988,2892,2414,284,510,72,369,602,304,274,422,602,624,364,43,4532,1315,(...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,(...TRUNCATED)
| [128000,475,5826,271,82,284,1988,2892,2414,284,510,72,369,602,304,274,422,602,624,364,43,4532,1315,2(...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,0,0,0,0,0,0,0,0,0,0,0,0,0,0(...TRUNCATED)
| [128000,475,5826,271,82,284,1988,2892,2414,284,510,72,369,602,304,274,422,602,624,364,43,4532,1315,2(...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,475,5826,271,82,284,1988,2892,2414,284,510,72,369,602,304,274,422,602,624,364,43,4532,1315,2(...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)
| [[[1.5389751195907593,0.9878368973731995,1.0227441787719727,0.8791872262954712,1.4096474647521973,1.(...TRUNCATED)
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 42