Datasets:

TheFactoryX
/

edition_3105_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_stringlengths 31 8.62k	public_tests dict	private_tests dict	generated_tests dict	source int64 1 6	difficulty int64 0 21	solutions dict	incorrect_solutions dict	cf_contest_id int64 0 1.55k	cf_index large_stringclasses 23 values	cf_points float64 0 3.75k	cf_rating int64 0 3.5k	cf_tags listlengths 0 7	is_description_translated bool 2 classes	untranslated_description large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
79_D. Password	"There are n cows playing poker at a table. For the current betting phase, each player's status is e(...TRUNCATED)	{ "input": [ "1 30 0\n-1 -1 -1" ], "output": [ "00:30:00\n01:30:00" ] }	{ "input": [ "2\nacxz\nbcxz" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	8	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{"language":[2,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	793	D	1,000	3,100	[ "brute force", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
class-homework	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{ "input": [ "4 2\n1 2\n2 3\n", "3 3\n1 2\n2 3\n1 3\n" ], "output": [ "3\n1 3 4 \n1\n2 ", "-1" ] }	{"input":["15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 0\n(...TRUNCATED)	{"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	2	12	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED)	{ "language": [], "solution": [] }	1,227	A	0	2,000	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
996_F. Game	"Problem:\n\nRani and Nandu decide to play a number game. Both play alternately, Rani playing the fi(...TRUNCATED)	{"input":["7 13 5\n2 3 10 7\n3 5 10 10\n1 2 10 6\n4 5 10 9\n3 4 10 8\n","4 100 3\n3 3 2 5\n1 1 3 2\n(...TRUNCATED)	{"input":["1\n3\nS01\n111\n00F\n","1\n5\nS0000\n00000\n00000\n00000\n0000F\n","1\n3\nS10\n010\n11F\n(...TRUNCATED)	{"input":["3\n1 3 2\n-100 2 6\n","2\n2 1\n-4 0\n","2\n0 1\n-4 0\n","2\n0 2\n-4 0\n","3\n1 5 2\n-167 (...TRUNCATED)	2	0	{"language":[2],"solution":["#include <bits/stdc++.h>\n#define INF 1000000007\nusing namespace std;\(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)	{ "input": [ "keyence", "ashlfyha", "keyofscience", "mpyszsbznf" ], "output": [ "YES", "NO", "YES", "NO" ] }	{"input":["1 0\n","2 1\n1 2 0\n","5 4\n1 2 3 3 1 2\n5 4 0\n4 3 0\n3 1 2 5 4\n","3 3\n1 2 2 3 2\n1 3 (...TRUNCATED)	{"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...TRUNCATED)	2	10	{"language":[3,4,4,4,3,3,3,3,2,3,3,3,4,3,2,2,3,4,3,3,4,3,3,2,4,3,3,4,2,3,3,2,3,3,3,3,3,3,4,3,3,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,369	F	500	2,400	[ "math" ]	false	"標準録画で 120 分のビデオテープがあります。テープを完全に巻き戻した(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1428_D. Bouncing Boomerangs	"There are n armchairs, numbered from 1 to n from left to right. Some armchairs are occupied by peop(...TRUNCATED)	{"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)	{"input":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)	{"input":["8\n1 2\n1 3\n1 4\n1 5\n1 6\n2 7\n2 8\n","10\n10 1\n1 4\n4 2\n2 3\n3 6\n6 9\n9 5\n5 8\n3 7(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,428	C	0	0	[ "greedy", "implementation", "math", "ternary search" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
colarr	"Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED)	{"input":["5 6 5\n5 4 86\n5 1 0\n1 3 38\n2 1 33\n2 4 28\n2 3 40\n3 5\n2 6\n1 3\n2 3\n1 6\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 9 1\n2 3 8","2 1000000000 1000000000\n1 199586132","3 9 3\n1 3 7","3 9 3\n1 0 7","2 100(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	D	2,000	0	[]	false		null	256,000,000
25_D. Roads not only in Berland	"There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED)	{ "input": [ "2 5", "9 9", "5 10" ], "output": [ "10", "81", "-1" ] }	{"input":["2 1\n7 1 1\n2 1 1\n","5 1\n2 1 0\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 2\n6 0 0\n11 1 0\n9 0 (...TRUNCATED)	{"input":["3 4\n3 2 1\n","5 97\n1 10 76 97 2\n","2 16\n12 4\n","2 100\n132 1\n","5 76\n1 10 50 100 2(...TRUNCATED)	2	7	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solut(...TRUNCATED)	{"language":[4,2,4,4,2,2,1,1,4,3,2,3,3,2,2,2,2,4,4,2,2,4,2,2,2,1,2,2,4,2,2,4,2,2,4,2,2,4,2,2,2,4,4,4(...TRUNCATED)	687		0	800	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728
1281_B. Azamon Web Services	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED)	{ "input": [ "5 10\n-1 -1 -1 -1 -1\n", "10 2\n10 -1 2 2 2 2 2 2 -1 10\n" ], "output": [ "-1\n", "32\n" ] }	{ "input": [], "output": [] }	{"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED)	2	11	{"language":[4,3,3,2,1,4,3,4,3,3,4,4,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,4,3,3,3,3,3,4,4,2,3,3,3,3,3,3,1,3(...TRUNCATED)	{"language":[2,4,4,3,2,3,2,2,3,2,3,3,4,3,4,4,4,2,2,2,4,2,4,4,3,2,3,1,4,2,3,4,3,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	0	B	1,000	2,200	[]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
1088_D. Ehab and another another xor problem	"A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous (...TRUNCATED)	{ "input": [ "2\n1 23\n\nSAMPLE" ], "output": [ "NO\n" ] }	{"input":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 0\n1 0\n0 1\n1 0\n","3\n0 1\n1 1\n1 0\n","8\n0 1\n1 1\n0 1\n1 1\(...TRUNCATED)	5	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solut(...TRUNCATED)	{"language":[1,2,2,4,2,2,2,1,2,2,2,2,2,2,2,2,2,2,4,2,4,1,3,2,4,4,4,2,2,2,2,4,2,4,2,2,2,2,3,2,4,4,1,2(...TRUNCATED)	507	D	0	1,300	[ "bitmasks", "dfs and similar", "dsu", "graphs", "greedy", "math", "sortings" ]	false		{ "nanos": 0, "seconds": 8 }	512,000,000
p03725 AtCoder Grand Contest 014 - Closed Rooms	"Leonard has decided to quit living with Dr. Sheldon Cooper and has started to live with Penny. Yes,(...TRUNCATED)	{"input":["2 0\n1 1 1 1\n","2 2\n0 1 2 3\n2 5\n0 4\n","1 0\n2 3\n"],"output":["1.0000000000\n","1.50(...TRUNCATED)	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	{"input":["11--01--2013-02-2013-01--01--2013\n","00-12-2014-00-12-2013-00-12-2014-12-12-2014\n","23-(...TRUNCATED)	2	0	{"language":[1],"solution":["#Manage maximum events given start date and duration for a case\ndef ma(...TRUNCATED)	{ "language": [], "solution": [] }	425		0	1,600	[ "brute force", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728