Datasets:

evanellis
/

codeforces_gemma_3_27b_it_human_with_Llama-3.1-8B-Instruct_eta0.5_f

Modalities:

Formats:

Size:

Libraries:

Dataset card Data Studio Files Files and versions

Dataset Viewer

Auto-converted to Parquet Duplicate

Split (2)

train · 2.65k rows

question_title stringlengths 2 58	question_content stringlengths 92 7.2k	platform stringclasses 1 value	question_id stringclasses 35 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 47 40k	iids_state listlengths 0 1.31k	iids_null_code listlengths 5 5	iids_code listlengths 14 1.59k	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
Hyperspace Jump (hard)	It is now 125 years later, but humanity is still on the run from a humanoid-cyborg race determined to destroy it. Or perhaps we are getting some stories mixed up here... In any case, the fleet is now smaller. However, in a recent upgrade, all the navigation systems have been outfitted with higher-dimensional, linear-al...	codeforces	D2	958	2025-01-20 20:58:05.360400		hard	[]	[]	[]	def solve(): n, k = map(int, input().split()) s = input() available_times = [] for i in range(n): if s[i] == '0': available_times.append(i) if k == 2: print(available_times[-1] - available_times[0] - 1) return bars_eaten = [available_ti...	[ 128000, 755, 11886, 4019, 262, 308, 11, 597, 284, 2472, 1577, 11, 1988, 1020, 7105, 2455, 262, 274, 284, 1988, 746, 1084, 262, 2561, 23155, 284, 4260, 262, 369, 602, 304, 2134, 1471, 997, 286, 422, 274, 1004, 60, 624, 364, 15, 3730,...	[ [ 128000, 755, 11886, 4019, 262, 308, 11, 597, 284, 2472, 1577, 11, 1988, 1020, 7105, 2455, 262, 274, 284, 1988, 746, 1084, 262, 2561, 23155, 284, 4260, 262, 369, 602, 304, 2134, 1471,...	[ 128000, 755, 11886, 4019, 262, 308, 11, 597, 284, 2472, 1577, 11, 1988, 1020, 7105, 2455, 262, 274, 284, 1988, 746, 1084, 262, 2561, 23155, 284, 4260, 262, 369, 602, 304, 2134, 1471, 997, 286, 422, 274, 1004, 60, 624, 364, 15, 3730,...	[ 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, 11, 597, 284, 2472, 1577, 11, 1988, 1020, 7105, 2455, 262, 274, 284, 1988, 746, 1084, 262, 2561, 23155, 284, 4260, 262, 369, 602, 304, 2134, 1471, 997, 286, 422, 274, 1004, 60, 624, 364, 15, 3730,...
Suffix Structures	Bizon the Champion isn't just a bison. He also is a favorite of the "Bizons" team. At a competition the "Bizons" got the following problem: "You are given two distinct words (strings of English letters), s and t. You need to transform word s into word t". The task looked simple to the guys because they know th...	codeforces	B	448	2025-01-20 20:58:05.360400		medium	[]	[]	[]	def solve(): s = input() n = len(s) def is_valid_email(email): if "@" not in email: return False parts = email.split("@") if len(parts)!= 2: return False return True def find_solutions(index, current_solution): if index == n: ...	[ 128000, 755, 11886, 4019, 262, 274, 284, 1988, 746, 262, 308, 284, 2479, 1161, 340, 1084, 262, 711, 374, 8501, 9351, 18411, 997, 286, 422, 97948, 539, 304, 2613, 512, 310, 471, 3641, 198, 286, 5596, 284, 2613, 5402, 10889, 1158, 286, ...	[ [ 128000, 755, 11886, 4019, 262, 274, 284, 1988, 746, 262, 308, 284, 2479, 1161, 340, 1084, 262, 711, 374, 8501, 9351, 18411, 997, 286, 422, 97948, 539, 304, 2613, 512, 310, 471, 3641,...	[ 128000, 755, 11886, 4019, 262, 274, 284, 1988, 746, 262, 308, 284, 2479, 1161, 340, 1084, 262, 711, 374, 8501, 9351, 18411, 997, 286, 422, 97948, 539, 304, 2613, 512, 310, 471, 3641, 198, 286, 5596, 284, 2613, 5402, 10889, 1158, 286, ...	[ 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, 274, 284, 1988, 746, 262, 308, 284, 2479, 1161, 340, 1084, 262, 711, 374, 8501, 9351, 18411, 997, 286, 422, 97948, 539, 304, 2613, 512, 310, 471, 3641, 198, 286, 5596, 284, 2613, 5402, 10889, 1158, 286, ...
Возможно, вы знаете этих людей?	"Основой любой социальной сети является отношение дру(...TRUNCATED)	codeforces	A	524	2025-01-20 20:58:05.360400		medium	[]	[]	[]	"def solve():\n n = int(input())\n trips = []\n for _ in range(n):\n trips.append(in(...TRUNCATED)	[128000,755,11886,4019,262,308,284,528,5498,2455,262,23277,284,4260,262,369,721,304,2134,1471,997,28(...TRUNCATED)	[[128000,755,11886,4019,262,308,284,528,5498,2455,262,23277,284,4260,262,369,721,304,2134,1471,997,2(...TRUNCATED)	[128000,755,11886,4019,262,308,284,528,5498,2455,262,23277,284,4260,262,369,721,304,2134,1471,997,28(...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,23277,284,4260,262,369,721,304,2134,1471,997,28(...TRUNCATED)
Luxurious Houses	"The capital of Berland has n multifloor buildings. The architect who built up the capital was ver(...TRUNCATED)	codeforces	B	581	2025-01-20 20:58:05.360400		medium	[]	[]	[]	"def solve():\n n = int(input())\n t = list(map(int, input().split()))\n \n visited = se(...TRUNCATED)	[128000,755,11886,4019,262,308,284,528,5498,2455,262,259,284,1160,9325,1577,11,1988,1020,7105,12419,(...TRUNCATED)	[[128000,755,11886,4019,262,308,284,528,5498,2455,262,259,284,1160,9325,1577,11,1988,1020,7105,12419(...TRUNCATED)	[128000,755,11886,4019,262,308,284,528,5498,2455,262,259,284,1160,9325,1577,11,1988,1020,7105,12419,(...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,259,284,1160,9325,1577,11,1988,1020,7105,12419,(...TRUNCATED)
Mister B and Astronomers	"After studying the beacons Mister B decided to visit alien's planet, because he learned that they l(...TRUNCATED)	codeforces	D	819	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 b (...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)
Mages and Monsters	"Vova plays a computer game known as Mages and Monsters. Vova's character is a mage. Though as he ha(...TRUNCATED)	codeforces	F	792	2025-01-20 20:58:05.360400		hard	[]	[]	[]	"def solve():\n n = int(input())\n a = list(map(int, input().split()))\n \n bonus = 0\n (...TRUNCATED)	[128000,755,11886,4019,262,308,284,528,5498,2455,262,264,284,1160,9325,1577,11,1988,1020,7105,12419,(...TRUNCATED)	[[128000,755,11886,4019,262,308,284,528,5498,2455,262,264,284,1160,9325,1577,11,1988,1020,7105,12419(...TRUNCATED)	[128000,755,11886,4019,262,308,284,528,5498,2455,262,264,284,1160,9325,1577,11,1988,1020,7105,12419,(...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,264,284,1160,9325,1577,11,1988,1020,7105,12419,(...TRUNCATED)
Xor-matic Number of the Graph	"You are given an undirected graph, constisting of n vertices and m edges. Each edge of the grap(...TRUNCATED)	codeforces	G	724	2025-01-20 20:58:05.360400		hard	[]	[]	[]	"def solve():\n s = input()\n n = len(s)\n \n def is_beautiful(x):\n x_str = str((...TRUNCATED)	[128000,755,11886,4019,262,274,284,1988,746,262,308,284,2479,1161,340,1084,262,711,374,21960,35777,2(...TRUNCATED)	[[128000,755,11886,4019,262,274,284,1988,746,262,308,284,2479,1161,340,1084,262,711,374,21960,35777,(...TRUNCATED)	[128000,755,11886,4019,262,274,284,1988,746,262,308,284,2479,1161,340,1084,262,711,374,21960,35777,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,274,284,1988,746,262,308,284,2479,1161,340,1084,262,711,374,21960,35777,2(...TRUNCATED)
Reachability from the Capital	"There are $n$ cities and $m$ roads in Berland. Each road connects a pair of cities. The roads in Be(...TRUNCATED)	codeforces	E	999	2025-01-20 20:58:05.360400		hard	[]	[]	[]	"def solve():\n n, m = map(int, input().split())\n edges = []\n for _ in range(m):\n (...TRUNCATED)	[128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,13116,284,4260,262,36(...TRUNCATED)	[[128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,13116,284,4260,262,3(...TRUNCATED)	[128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,13116,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,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,13116,284,4260,262,36(...TRUNCATED)
Cut 'em all!	"You're given a tree with $n$ vertices.\n\nYour task is to determine the maximum possible number of (...TRUNCATED)	codeforces	C	982	2025-01-20 20:58:05.360400		medium	[]	[]	[]	"def solve():\n n, m = map(int, input().split())\n islands = []\n for _ in range(n):\n (...TRUNCATED)	[128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,30100,284,4260,262,36(...TRUNCATED)	[[128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,30100,284,4260,262,3(...TRUNCATED)	[128000,755,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,30100,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,11886,4019,262,308,11,296,284,2472,1577,11,1988,1020,7105,2455,262,30100,284,4260,262,36(...TRUNCATED)
Robots protection	"Company \"Robots industries\" produces robots for territory protection. Robots protect triangle ter(...TRUNCATED)	codeforces	I	575	2025-01-20 20:58:05.360400		hard	[]	[]	[]	"def solve():\n n, x = map(int, input().split())\n s = input()\n \n def fibonacci(x):\n (...TRUNCATED)	[128000,755,11886,4019,262,308,11,865,284,2472,1577,11,1988,1020,7105,2455,262,274,284,1988,746,1084(...TRUNCATED)	[[128000,755,11886,4019,262,308,11,865,284,2472,1577,11,1988,1020,7105,2455,262,274,284,1988,746,108(...TRUNCATED)	[128000,755,11886,4019,262,308,11,865,284,2472,1577,11,1988,1020,7105,2455,262,274,284,1988,746,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,308,11,865,284,2472,1577,11,1988,1020,7105,2455,262,274,284,1988,746,1084(...TRUNCATED)

End of preview. Expand in Data Studio

README.md exists but content is empty.

Downloads last month: 4

Number of rows:

Total file size: