code stringlengths 35 7.09k | question_title stringlengths 2 58 | question_id stringclasses 45
values | contest_id int64 0 1.01k | platform stringclasses 1
value | question_content stringlengths 92 7.2k | difficulty stringclasses 3
values | public_test_cases stringclasses 1
value | private_test_cases stringclasses 1
value | metadata stringclasses 1
value | starter_code stringclasses 1
value | contest_date stringdate 2025-01-20 20:58:05 2025-01-20 20:58:05 | state stringlengths 0 6.38k | correct_completion stringlengths 0 6.55k | null_code sequencelengths 5 5 | input_ids_code sequencelengths 2k 2k | attention_mask_code sequencelengths 2k 2k | input_ids_null_code sequencelengths 5 5 | attention_mask_null_code sequencelengths 5 5 | id int64 0 59.6k | empowerment float64 -2.72 7.6 | empowerment_q float64 -2.72 7.6 | empowerment_a float64 -2.72 7.6 | empowerment_v int64 0 0 | assistant_prompt_response stringlengths 2.3k 15.2k | chat_template_state stringlengths 2.3k 15.1k | input_ids sequencelengths 4.1k 4.1k | attention_mask sequencelengths 4.1k 4.1k | labels sequencelengths 4.1k 4.1k |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
"import sys\nfrom itertools import permutations\n\n# Read input\nn, m = map(int, sys.stdin.readline((...TRUNCATED) | Circling Round Treasures | C | 375 | codeforces | "You have a map as a rectangle table. Each cell of the table is either an obstacle, or a treasure wi(...TRUNCATED) | hard | [] | [] | {} | 2025-01-20T20:58:05.360400 | "import sys\nfrom itertools import permutations\n\n# Read input\nn, m = map(int, sys.stdin.readline((...TRUNCATED) | "import sys\nfrom itertools import permutations\n\n# Read input\nn, m = map(int, sys.stdin.readline((...TRUNCATED) | ["import sys\nfrom itertools import permutations\n\n# Read input\nn, m = map(int, sys.stdin.readline(...TRUNCATED) | [128000,475,5826,198,1527,42431,1179,73049,271,2,4557,1988,198,77,11,296,284,2472,1577,11,5826,44284(...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,42431,1179,73049,271,2,4557,1988,198,77,11,296,284,2472,1577,11,5826,4428(...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) | 0 | -0.959536 | -0.959536 | -0.959536 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"from sys import stdin\n\n# Read the inputs\nA = stdin.readline().strip()\nn = int(stdin.readline())(...TRUNCATED) | Selling Numbers | E | 778 | codeforces | "Boris really likes numbers and even owns a small shop selling interesting numbers. He has *n* decim(...TRUNCATED) | hard | [] | [] | {} | 2025-01-20T20:58:05.360400 | "from sys import stdin\n\n# Read the inputs\nA = stdin.readline().strip()\nn = int(stdin.readline())(...TRUNCATED) | "from sys import stdin\n\n# Read the inputs\nA = stdin.readline().strip()\nn = int(stdin.readline())(...TRUNCATED) | ["from sys import stdin\n\n# Read the inputs\nA = stdin.readline().strip()\nn = int(stdin.readline()(...TRUNCATED) | [128000,1527,5826,1179,32469,271,2,4557,279,11374,198,32,284,32469,32900,1020,13406,746,77,284,528,7(...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,5826,1179,32469,271,2,4557,279,11374,198,32,284,32469,32900,1020,13406,746,77,284,528,(...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) | 1 | -1.079952 | -1.079952 | -1.079952 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"def can_sell_tickets(n, bills):\n \"\"\"\n Checks if the booking clerk can sell a ticket to e(...TRUNCATED) | Cinema Line | A | 349 | codeforces | "The new \"Die Hard\" movie has just been released! There are *n* people at the cinema box office st(...TRUNCATED) | medium | [] | [] | {} | 2025-01-20T20:58:05.360400 | "def can_sell_tickets(n, bills):\n \"\"\"\n Checks if the booking clerk can sell a ticket to e(...TRUNCATED) | "def can_sell_tickets(n, bills):\n \"\"\"\n Checks if the booking clerk can sell a ticket to e(...TRUNCATED) | ["def can_sell_tickets(n, bills):\n \"\"\"\n Checks if the booking clerk can sell a ticket to (...TRUNCATED) | [128000,755,649,72172,92936,1471,11,19123,997,262,3270,262,25884,422,279,22615,45357,649,4662,264,11(...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,649,72172,92936,1471,11,19123,997,262,3270,262,25884,422,279,22615,45357,649,4662,264,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) | 2 | -1.025023 | -1.025023 | -1.025023 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"def calculate_moves(r1, c1, r2, c2):\n \"\"\"\n Calculate the minimum number of moves for a r(...TRUNCATED) | Rook, Bishop and King | A | 370 | codeforces | "Little Petya is learning to play chess. He has already learned how to move a king, a rook and a bis(...TRUNCATED) | medium | [] | [] | {} | 2025-01-20T20:58:05.360400 | "def calculate_moves(r1, c1, r2, c2):\n \"\"\"\n Calculate the minimum number of moves for a r(...TRUNCATED) | "def calculate_moves(r1, c1, r2, c2):\n \"\"\"\n Calculate the minimum number of moves for a r(...TRUNCATED) | ["def calculate_moves(r1, c1, r2, c2):\n \"\"\"\n Calculate the minimum number of moves for a (...TRUNCATED) | [128000,755,11294,46490,2666,16,11,272,16,11,436,17,11,272,17,997,262,3270,262,21157,279,8187,1396,3(...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,11294,46490,2666,16,11,272,16,11,436,17,11,272,17,997,262,3270,262,21157,279,8187,1396,(...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) | 3 | -1.059156 | -1.059156 | -1.059156 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"import sys\n\ndef find_ki(ai):\n \"\"\"\n Find ki such that the last min(100, length(2*ki)) d(...TRUNCATED) | Power Substring | G | 913 | codeforces | "You are given *n* positive integers *a*1,<=*a*2,<=...,<=*a**n*.\n\nFor every *a**i* you need to fin(...TRUNCATED) | hard | [] | [] | {} | 2025-01-20T20:58:05.360400 | "import sys\n\ndef find_ki(ai):\n \"\"\"\n Find ki such that the last min(100, length(2*ki)) d(...TRUNCATED) | "import sys\n\ndef find_ki(ai):\n \"\"\"\n Find ki such that the last min(100, length(2*ki)) d(...TRUNCATED) | ["import sys\n\ndef find_ki(ai):\n \"\"\"\n Find ki such that the last min(100, length(2*ki)) (...TRUNCATED) | [128000,475,5826,271,755,1505,4803,72,75192,997,262,3270,262,7531,20548,1778,430,279,1566,1332,7,104(...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,755,1505,4803,72,75192,997,262,3270,262,7531,20548,1778,430,279,1566,1332,7,10(...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) | 4 | -0.793249 | -0.793249 | -0.793249 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"# Read the two dwarf genomes from stdin\ngenome1 = input()\ngenome2 = input()\n\n# Check if the gen(...TRUNCATED) | Comparing Strings | A | 186 | codeforces | "Some dwarves that are finishing the StUDY (State University for Dwarven Youngsters) Bachelor course(...TRUNCATED) | medium | [] | [] | {} | 2025-01-20T20:58:05.360400 | "# Read the two dwarf genomes from stdin\ngenome1 = input()\ngenome2 = input()\n\n# Check if the gen(...TRUNCATED) | "# Read the two dwarf genomes from stdin\ngenome1 = input()\ngenome2 = input()\n\n# Check if the gen(...TRUNCATED) | ["# Read the two dwarf genomes from stdin\ngenome1 = input()\ngenome2 = input()\n\n# Check if the ge(...TRUNCATED) | [128000,2,4557,279,1403,50561,85381,505,32469,198,89045,16,284,1988,746,89045,17,284,1988,2892,2,434(...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,279,1403,50561,85381,505,32469,198,89045,16,284,1988,746,89045,17,284,1988,2892,2,43(...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) | 5 | -1.230165 | -1.230165 | -1.230165 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"import sys\n\ndef floyd_warshall(graph):\n \"\"\"\n This function implements the Floyd Warsha(...TRUNCATED) | Out of Controls | E | 656 | codeforces | "You are given a complete undirected graph. For each pair of vertices you are given the length of th(...TRUNCATED) | hard | [] | [] | {} | 2025-01-20T20:58:05.360400 | "import sys\n\ndef floyd_warshall(graph):\n \"\"\"\n This function implements the Floyd Warsha(...TRUNCATED) | "import sys\n\ndef floyd_warshall(graph):\n \"\"\"\n This function implements the Floyd Warsha(...TRUNCATED) | ["import sys\n\ndef floyd_warshall(graph):\n \"\"\"\n This function implements the Floyd Warsh(...TRUNCATED) | [128000,475,5826,271,755,282,26881,91639,19549,25301,997,262,3270,262,1115,734,5280,279,46899,5111,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,271,755,282,26881,91639,19549,25301,997,262,3270,262,1115,734,5280,279,46899,5111,(...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) | 6 | -0.641438 | -0.641438 | -0.641438 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"import math\n\ndef find_divisors(n):\n \"\"\"\n Finds all divisors of a given number n.\n (...TRUNCATED) | k-th divisor | A | 762 | codeforces | "You are given two integers *n* and *k*. Find *k*-th smallest divisor of *n*, or report that it does(...TRUNCATED) | medium | [] | [] | {} | 2025-01-20T20:58:05.360400 | "import math\n\ndef find_divisors(n):\n \"\"\"\n Finds all divisors of a given number n.\n (...TRUNCATED) | "import math\n\ndef find_divisors(n):\n \"\"\"\n Finds all divisors of a given number n.\n (...TRUNCATED) | ["import math\n\ndef find_divisors(n):\n \"\"\"\n Finds all divisors of a given number n.\n (...TRUNCATED) | [128000,475,7033,271,755,1505,16635,42314,1471,997,262,3270,262,51730,682,3512,42314,315,264,2728,13(...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,7033,271,755,1505,16635,42314,1471,997,262,3270,262,51730,682,3512,42314,315,264,2728,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) | 7 | -0.687615 | -0.687615 | -0.687615 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"def find_suffixes(s):\n \"\"\"\n Find all distinct strings with the length 2 or 3, \n whic(...TRUNCATED) | Reberland Linguistics | A | 666 | codeforces | "First-rate specialists graduate from Berland State Institute of Peace and Friendship. You are one o(...TRUNCATED) | medium | [] | [] | {} | 2025-01-20T20:58:05.360400 | "def find_suffixes(s):\n \"\"\"\n Find all distinct strings with the length 2 or 3, \n whic(...TRUNCATED) | "def find_suffixes(s):\n \"\"\"\n Find all distinct strings with the length 2 or 3, \n whic(...TRUNCATED) | ["def find_suffixes(s):\n \"\"\"\n Find all distinct strings with the length 2 or 3, \n whi(...TRUNCATED) | [128000,755,1505,38251,288,1161,997,262,3270,262,7531,682,12742,9246,449,279,3160,220,17,477,220,18,(...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,1505,38251,288,1161,997,262,3270,262,7531,682,12742,9246,449,279,3160,220,17,477,220,18(...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) | 8 | -1.318244 | -1.318244 | -1.318244 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) | |
"def find_nth_digit(n):\n length = 1\n count = 9\n start = 1\n\n # Calculate the length (...TRUNCATED) | Summer Camp | A | 672 | codeforces | "Every year, hundreds of people come to summer camps, they learn new algorithms and solve hard probl(...TRUNCATED) | easy | [] | [] | {} | 2025-01-20T20:58:05.360400 | "def find_nth_digit(n):\n length = 1\n count = 9\n start = 1\n\n # Calculate the length (...TRUNCATED) | "def find_nth_digit(n):\n length = 1\n count = 9\n start = 1\n\n # Calculate the length (...TRUNCATED) | ["def find_nth_digit(n):\n length = 1\n count = 9\n start = 1\n\n # Calculate the length(...TRUNCATED) | [128000,755,1505,79442,49503,1471,997,262,3160,284,220,16,198,262,1797,284,220,24,198,262,1212,284,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,755,1505,79442,49503,1471,997,262,3160,284,220,16,198,262,1797,284,220,24,198,262,1212,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) | 9 | -0.720326 | -0.720326 | -0.720326 | 0 | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | "<|begin_of_text|><|start_header_id|>system<|end_header_id|>\n\nCutting Knowledge Date: December 202(...TRUNCATED) | [128000,128000,128006,9125,128007,271,38766,1303,33025,2696,25,6790,220,2366,18,198,15724,2696,25,22(...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) | [-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100,-100(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 2