Datasets:

TheFactoryX
/

edition_0790_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	time_limit dict	memory_limit_bytes int64 0 1.07B
29_E. Quarrel	"Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)	{ "input": [ "aabb\n", "aabcaa\n" ], "output": [ "2\n", "1\n" ] }	{ "input": [], "output": [] }	{"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED)	2	2	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,4,4,2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,4,4,2,4,2,2,2,4,2,2,4,2,2,3,3,3,2,2(...TRUNCATED)	551	E	2,000	2,000	[ "greedy", "implementation" ]	false	null	0
substrings-count-3	"Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED)	{"input":["6\nAC\nTLE\nAC\nAC\nWA\nTLE","10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC"],"output":["AC (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)	2	2	{"language":[2,2,2,2,2],"solution":["#include<cmath>\n#include<cstdio>\n#include<vector>\n\n#define (...TRUNCATED)	{ "language": [], "solution": [] }	0	A	0	1,700	[ "games", "implementation" ]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
p01931 Check answers	"Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...TRUNCATED)	{ "input": [ "3\n2 1 3\n3 3 6\n99995 9998900031 9998900031\n" ], "output": [ "1 2 1 \n1 3 2 3 \n1 \n" ] }	{"input":["3 7\n3 2 1\n","4 97\n97 1 50 10\n","5 25\n24 5 15 25 23\n","3 3\n3 2 1\n","4 18\n3 1 1 2\(...TRUNCATED)	{ "input": [], "output": [] }	1	0	{"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)	{"language":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED)	560	B	0	2,100	[]	false	{ "nanos": 0, "seconds": 3 }	268,435,456
brcktsrm	"All of us know that girls in Arpa’s land are... ok, you’ve got the idea :D\n\nAnyone knows that(...TRUNCATED)	{ "input": [ "6 0 6\n2 1 2\n2 3 4\n2 5 6\n2 3 2\n2 5 3\n1 1\n" ], "output": [ "4\n" ] }	{ "input": [], "output": [] }	{"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED)	2	0	{"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...TRUNCATED)	{"language":[3,4,2,4,2,3,3,3,3,2,2,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,1,3,1,1,2,2,3,2,3,1,2,2,4,3,3,3,3,3(...TRUNCATED)	1,547	B	2,500	2,900	[ "geometry" ]	false	{ "nanos": 0, "seconds": 2 }	64,000,000
1281_B. Azamon Web Services	"Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, corr(...TRUNCATED)	{"input":["3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	2	7	{"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	0		1,750	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
chefrp	"Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, \"AZ(...TRUNCATED)	{"input":["2 2 1\n2 3 1\n3 2 3\n2 3 5"],"output":["3.9681187851\n6.7970540913\n6.5668891783\n13.9527(...TRUNCATED)	{ "input": [ "4\n4568\n4545992\n9265642\n4592886" ], "output": [ "13598\n27154740\n58212156\n27455323\n" ] }	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	3	10	{"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":[3,2,2,4,3,2,4,3,4,4,4,2,2,3,3,3,2,4,3,2,4,4,2,3,3,2,3,4,4,2,2,3,3,3,3,4,4,4,4,4,4,4,2,3(...TRUNCATED)	1,431	C	2,000	0	[ "trees" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p00074 Videotape	"Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)	{"input":["341143514535\n314\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED)	3	12	{"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,1,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,4,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,4,2,2(...TRUNCATED)	1,402	A	0	2,000	[ "" ]	false	{ "nanos": 0, "seconds": 5 }	1,073,741,824
1269_B. Modulo Equality	"The football season has just ended in Berland. According to the rules of Berland football, each mat(...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{"input":["10 3 5\n1 2\n2 3\n1 4\n2 3 6\n1 6\n2 1 6\n2 8 7\n1 10\n","10 2 6\n1 2\n1 3\n2 1 8\n2 9 2\(...TRUNCATED)	{"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED)	3	0	{"language":[1],"solution":["# your code goes here\nfrom math import ceil, log\nfrom sys import stdi(...TRUNCATED)	{ "language": [], "solution": [] }	789		0	0	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
284_B. Cows and Poker Game	"Valera came to Japan and bought many robots for his research. He's already at the airport, the plan(...TRUNCATED)	{ "input": [ "14\n", "2128506\n", "11\n", "571576\n", "61441\n" ], "output": [ "0", "3", "2", "10", "2" ] }	{ "input": [], "output": [] }	{"input":["280 2\n","0 2\n","99900 2\n","79086 1\n","1 5\n","100000 96\n","2523 22\n","100000 2\n","(...TRUNCATED)	2	12	{"language":[2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,3,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)	0	D	0	3,000	[]	false	{ "nanos": 0, "seconds": 2 }	536,870,912
p02120 Cluster Network	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{ "input": [ "3 1 8 10\n10 8\n5 7\n11 9\n3\n", "2 2 10 18\n10 4\n20 6\n5 3\n" ], "output": [ "10\n", "20\n" ] }	{"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED)	{"input":["0.2 0.1 1.448460702857607\n","1.0 200.44854766953543 1.0\n","0.3 1.3846300094261417 0.6\n(...TRUNCATED)	2	0	{"language":[1,1],"solution":["t=input()\nwhile t>0:\n\tb=[]\n\ta=raw_input().split()\n\tfor i in ra(...TRUNCATED)	{"language":[2,2,4,4,3,3,4,2,3,3,2,3,2,3,4,3,4,2,4,4,3,2,3,3,2,1,4,3,2,3,4,4,3,3,3,3,3,3,2,4,4,2,2,4(...TRUNCATED)	0	B	0	2,600	[ "data structures", "divide and conquer", "implementation", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000