Datasets:

TheFactoryX
/

edition_1893_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
1012_E. Cycle sort	"Chouti was tired of the tedious homework, so he opened up an old programming problem he created yea(...TRUNCATED)	{ "input": [ "3\n12 2\n200\n50\n300\n100" ], "output": [ "37" ] }	{"input":["8\n2 3 5 7 11 13 17 19\n4 8 7 1 5 2 6 3\n","1\n2\n2\n","1\n1000000000\n100000\n","1\n1\n1(...TRUNCATED)	{"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)	2	0	{"language":[1],"solution":["#Manage maximum events given start date and duration for a case\ndef ma(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,0,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,4(...TRUNCATED)	814		0	1,100	[ "brute force", "constructive algorithms", "implementation", "strings" ]	false	"r × c の2次元グリッド上の２つの座標 (a1,a2) と (b1,b2) が与えられる。ある(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
cube-change-qualifier2	"Chouti thought about his very first days in competitive programming. When he had just learned to wr(...TRUNCATED)	{"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 3 3\n.#\nS.","7 8 2\n\n\n...##\n###S\n.#.##\n.###","7 7 2\n\n\n##...\nS###\n.#.##\n.###(...TRUNCATED)	2	7	{"language":[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,2,2,2,2,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,470	A	0	2,000	[ "dp", "flows", "graph matchings", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	0
vowel	"Surya loves to play with primes. One day, he asked his friend don to print any number in the form o(...TRUNCATED)	{"input":["3\n0 10 4\n10 0 4\n20 10 4\n"],"output":["(((0((1-abs((t-0)))+abs((abs((t-0))-1))))+(5((...TRUNCATED)	{"input":["100\n4\nlrbbmqb\ncd\nr\nowkk\n7\nid\nqscdxrjmow\nrxsjybldbe\nsarcbyne\ndyggxxp\nlorel\nnm(...TRUNCATED)	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	5	0	{"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED)	{"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,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(...TRUNCATED)	702		1,250	2,900	[ "" ]	false		{ "nanos": 0, "seconds": 5 }	512,000,000
p01931 Check answers	"Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed(...TRUNCATED)	{"input":["3\n6 10 16","3\n6 10 15","3\n3 4 5"],"output":["not coprime","setwise coprime","pairwise (...TRUNCATED)	{"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED)	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	6	0	{"language":[3,4,1,3,4,2,4,2,2,2,3,3,4,3,2,2,3,3,2,2,2,2,1,3,2,3,4,3,3,1,4,3,3,2,2,3,2,3,4,3,3,3,4,4(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,1,2,2,4,2,2,2,2,1,2,2,4,2,4,1,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,2,2,3,2,2,2,2(...TRUNCATED)	70		2,000	0	[ "brute force", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	0
p02574 AtCoder Beginner Contest 177 - Coprime	"We have N balance beams numbered 1 to N. The length of each beam is 1 meters. Snuke walks on Beam i(...TRUNCATED)	{"input":["6 2\n100 1 10 40 10 40\n","5 1\n5 10 7 3 20\n","3 0\n1 2 3\n"],"output":["97\n","3\n","0\(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	9	{"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)	{"language":[2,3,2,2,3,0,3,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,3,3,3,2,4,2,4,3,3,2,3,2,0,2,2,2,3,2,2,3(...TRUNCATED)	0	A	0	0	[ "bitmasks", "dp" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
discover-the-monk	"The court wizard Zigzag wants to become a famous mathematician. For that, he needs his own theorem,(...TRUNCATED)	{ "input": [ "3\n3 2 1\n", "3\n1 2 3\n", "3\n2 3 1\n" ], "output": [ "2 1\n", "0 0\n", "0 1\n" ] }	{ "input": [], "output": [] }	{"input":["3 70\n20 30 5","3 10\n20 18 10","2 10\n29 20","4 1111\n1 5 100 1000","4 1111\n-1 2 110 10(...TRUNCATED)	5	8	{"language":[4,2,2,4,2,4,4,2,2,4,2,2,4,2,4,2,2,2,4,2,2,1,4,2,2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,3,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	0	900	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1490_G. Old Floppy Drive	"You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or (...TRUNCATED)	{"input":["3\n1 1 101\n1 2 1\n3 2 1\n","5\n1 1 2 2 3\n2 2 4 3 3\n3 3 1 1 1\n"],"output":["5\n","5\n"(...TRUNCATED)	{"input":["50\n16 4\n17 9\n31 19\n22 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\(...TRUNCATED)	{"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED)	2	11	{"language":[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,3,2,4,2,2,2,2,2,2,2,4,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,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	2,500	2,300	[]	false		{ "nanos": 0, "seconds": 5 }	512,000,000
1136_D. Nastya Is Buying Lunch	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED)	{"input":["1\n2\n3\n2\n","8\n190409007 190409007 352375776 190409007 352375776 352375776 352375776 3(...TRUNCATED)	{"input":["7 4\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 55 80 81 82 84","3(...TRUNCATED)	3	7	{ "language": [], "solution": [] }	{"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)	0		500	2,000	[]	false		{ "nanos": 0, "seconds": 2 }	0
p03774 AtCoder Beginner Contest 057 - Checkpoints	"Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits whe(...TRUNCATED)	{ "input": [ "1 2 1\n1 100 1\n1 100 100\n", "100 100 100\n1 1 1\n1 1 1\n" ], "output": [ "99", "0" ] }	{ "input": [ "4\n4568\n4545992\n9265642\n4592886" ], "output": [ "13598\n27154740\n58212156\n27455323\n" ] }	{"input":["10\n-1 -1\n1 1\n1 1\n3 0\n4 1\n2 0\n3 1\n2 1\n5 0\n5 0\n8\n1 2 6\n2 3 7\n2 4 7\n1 3 4\n2 (...TRUNCATED)	5	8	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n\tn, a, b, c = map(int, raw_i(...TRUNCATED)	{"language":[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,2(...TRUNCATED)	0		0	0	[ "" ]	false		null	268,435,456
1374_B. Multiply by 2, divide by 6	"There are N integers a_1, a_2, ..., a_N not less than 1. The values of a_1, a_2, ..., a_N are not k(...TRUNCATED)	{"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["**\n.\n\n\n\n.\n...\n\n*\n.\n*.\n\n(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	11	{"language":[2,4,4,2,4,2,4,2,4,4,2,2,4,4,2,2,3,4,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,3,2,2,2,4,4,2,4,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	178	F	0	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000