Datasets:

TheFactoryX
/

edition_1331_deepmind-code_contests-readymade

name stringlengths 4 70	description 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 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 stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
1170_B. Bad Days	"A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of (...TRUNCATED)	{ "input": [ "2\n999999\n1000000", "3\n9\n99\n123" ], "output": [ "12\n1", "0\n2\n3" ] }	{"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED)	{"input":["7 11 10 5\n6 18 32 63 66 68 87\n6 8 15 23 25 41 53 59 60 75 90\n","13 17 14 1\n6 9 10 12 (...TRUNCATED)	6	10	{"language":[1,1,1],"solution":["t=input()\nfrom fractions import gcd\nfor x in range(t):\n\tn1=inpu(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,4,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,0(...TRUNCATED)	741	E	500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
793_F. Julia the snail	"To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED)	{"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED)	{"input":["2\naaab\n","2\nbabac\n","2\naaaaaabbbb\n","1\naabaab\n","2\naabbbbccccccdddddddd\n","2\na(...TRUNCATED)	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	5	10	{"language":[2,2,2,2,2,4,2,2,4,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,1,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,0,0,0,2,0,0,4,2,2,0,0,2,2,0,4,4,2,0,0,2,2,2,4,2,2,0,0,2,4,2,2,4,2,0,4,4,0,0,0,0,0,0,2(...TRUNCATED)	405		0	0	[ "divide and conquer", "fft", "greedy", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03080 ExaWizards 2019 - Red or Blue	"Garfield the cat likes candies A LOT. He always keeps a huge stock of it at his home. Today John, h(...TRUNCATED)	{"input":["5\n7\n1\n9\n7\n3\n","10\n100\n1\n100\n1\n100\n1\n100\n1\n100\n1\n"],"output":["1 3 7 7 9 (...TRUNCATED)	{"input":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	0		0	1,800	[]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
chandu-and-daspal-2	"Integer factorisation is hard. The RSA Factoring Challenge offered $100 000 for factoring RSA-1024,(...TRUNCATED)	{"input":["2 5\n1 4 6 7 12\n","4 12\n15 7 4 19 3 30 14 1 5 23 17 25\n","3 6\n6 3 4 2 5 1\n"],"output(...TRUNCATED)	{"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED)	{"input":["3\n3 1 0\n1 2 6\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR","3\n3 1 0\n1 2 3\nXOR\n3 1 0\n(...TRUNCATED)	2	12	{"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\n\nint N,K;\nint dp[2(...TRUNCATED)	{"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	361	D2	1,500	2,000	[ "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
p03254 AtCoder Grand Contest 027 - Candy Distribution Again	"Problem\n\nKND is a student programmer at the University of Aizu. There are N towns around his town(...TRUNCATED)	{ "input": [ "4\n10 21\n31 10\n0 1\n10 30\n" ], "output": [ "First\nSecond\nSecond\nFirst\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	8	{"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,3,4,2,2,4,2,2,4,4,1,4,2,2,4,3,4,3,4,4,4,4,2,3,2,4,3,3,2,2,2,2,2,3,4,2,2,2,4,2,4(...TRUNCATED)	851		0	0	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
abc-garfield	"Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED)	{ "input": [ "5 2" ], "output": [ "12" ] }	{ "input": [], "output": [] }	{"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 18 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...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,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		750	2,400	[ "" ]	false		null	256,000,000
battle-of-stalingrad-1	"Problem\n\nThere is a bundle of $ n $ cards, with $ i $ written on the $ i $ th card from the botto(...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)	{ "input": [], "output": [] }	{"input":["0\n2130761060 2000000000 1\n","0\n1 1723177055 2000000000\n","12\nAnka likes Dracul\nDrac(...TRUNCATED)	2	6	{"language":[3,4,4,4,4,2,2,3,4,4,2,4,2,4,1,4,2,4,3,3,1,4,4,2,2,1,4,4,4,4,4,2,2,3,4,4,4,3,4,4,2,4,4,4(...TRUNCATED)	{ "language": [], "solution": [] }	670		0	0	[ "binary search", "data structures", "graph matchings", "greedy", "implementation", "math", "trees" ]	false	"r × c の2次元グリッド上の２つの座標 (a1,a2) と (b1,b2) が与えられる。ある(...TRUNCATED)	null	256,000,000
even-from-end-1	"Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED)	{"input":["7\nC is A’s father’s brother’s son’s aunt\nC is A’s mother’s brother’s son(...TRUNCATED)	{"input":["10 4\nbcaaddaacc\n1 0 1 1\n0 0 1 0\n1 1 1 0\n1 0 0 1\n","100 10\nigffabeaiaajhjaghjgfjcch(...TRUNCATED)	{ "input": [], "output": [] }	6	0	{"language":[2,4,2,2,2,1,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,4,2,2,3,3,4,2,1,2,2,4,4,4,4,2,2,1,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,1,4,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,4,2,2,2(...TRUNCATED)	0	C	0	800	[ "math", "number theory", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
228_D. Zigzag	"Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED)	{ "input": [ "1\n100000 2", "3\n2 1\n1 3\n2 2" ], "output": [ "100002 0", "3 0\n5 0" ] }	{"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	{"input":["4\n47\n47\n477\n4747477","4\n7\n47\n477\n4747477","4\n4\n47\n477\n4747477","4\n7\n7\n477\(...TRUNCATED)	2	9	{"language":[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,2,2,2,2(...TRUNCATED)	{"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)	962	C	0	2,100	[ "dfs and similar", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
931_A. Friends Meeting	"Polycarp often uses his smartphone. He has already installed n applications on it. Application with(...TRUNCATED)	{ "input": [ "2 1\n1 2 2" ], "output": [ "1" ] }	{"input":["777 2\n","2 2\n","99900 1\n","50000 1\n","2 5\n","100000 99\n","22222 22\n","100000 4\n",(...TRUNCATED)	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,264	E	1,000	2,200	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000