Datasets:

TheFactoryX
/

edition_1608_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
1060_A. Phone Numbers	"Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	{"input":["3 2\n123 87 567\n1 2\n3 2\n","3 0\n4 1 8\n","3 2\n1 0 2\n3 2\n2 1\n","2 0\n1000000000 110(...TRUNCATED)	2	0	{"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	D1	3,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1170_B. Bad Days	"Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	{"input":["3\n1 4\n-1 1\n2 -1","10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 7\n8 1\n8 2\n8 4","3\n2 4\(...TRUNCATED)	6	10	{"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...TRUNCATED)	{"language":[3,4,2,2,1,2,3,1,2,4,4,1,2,2,2,2,1,2,3,2,2,4,2,4,2,1,4,2,1,2,2,1,1,3,2,2,4,2,2,4,2,2,2,2(...TRUNCATED)	0	C	0	2,100	[ "brute force", "constructive algorithms", "math" ]	false		{ "nanos": 0, "seconds": 2 }	0
252_B. Unsorting Array	"You are given a functional graph. It is a directed graph, in which from each vertex goes exactly on(...TRUNCATED)	{ "input": [ "3,4,5\n5,5,8\n4,4,4\n5,4,3" ], "output": [ "1\n2" ] }	{ "input": [], "output": [] }	{"input":["5\n0 0\n2 1\n1 1\n2 2\n0 2","4\n0 0\n3 0\n2 1\n0 3","4\n0 0\n3 1\n2 1\n0 3","5\n0 0\n3 1\(...TRUNCATED)	6	6	{"language":[3,1,2,2,3,4,2,2,2,4,3,2,2,2,4,4,4,2,2,2,3,1,4,4,2,4,4,3,4,3,1,4,2,3,2,3,3,3,3,3,3,2,1,4(...TRUNCATED)	{"language":[2,3,3,3,4,1,2,2,2,4,1,4,3,3,2,3,4,4,2,1,2,3,4,3,2,3,3,4,1,4,2,4,3,4,3,3,2,4,2,2,3,4,1,3(...TRUNCATED)	1,227		0	0	[]	false	"Problem\n\nマイヅ大学にある大規模クラスタ†型スーパーコンピュータ（通(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1391_C. Cyclic Permutations	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED)	{"input":["10 16\n6 10\n5 2\n6 4\n6 8\n5 3\n5 4\n6 2\n5 9\n5 7\n5 1\n6 9\n5 8\n5 10\n6 1\n6 7\n6 3\n(...TRUNCATED)	{"input":["10\n1000 910\n94625 95469 92038 95916 93405 95533 97004 92469 99853 94992 90361 99819 932(...TRUNCATED)	6	7	{"language":[2,2,2,2,2,2,2,4,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,2,4,2,2(...TRUNCATED)	{"language":[0,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\ntypedef struct {\n dou(...TRUNCATED)	1,007	B	1,000	1,800	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1053_C. Putting Boxes Together	"Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED)	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0"(...TRUNCATED)	{"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":["5\n1 4 5 4 4\n","4\n3 2 3 2\n","3\n1 1 3\n","4\n1 1 3 1\n","6\n1 2 5 4 5 5\n","5\n1 2 3 4(...TRUNCATED)	2	16	{"language":[2,2,3,2,2,2,4,4,2,2,2,3,2,2,4,2,2,2,4,2,2,3,4,2,2,4,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,3,4,2,1,2,4,2,2,4,3,2,3,3,2,4,4,2,2,2,4,4,2,1,4,2,2,2,3,2(...TRUNCATED)	0	D	0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
663_A. Rebus	"Bessie and the cows have recently been playing with \"cool\" sequences and are trying to construct (...TRUNCATED)	{ "input": [ "3\n5\n7\n10\n\nSAMPLE" ], "output": [ "2\n3\n5\n" ] }	{"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...TRUNCATED)	{"input":["2 2\n1\n0 1\n2 1\n","10 10\n1 8 2 4 1 8 2 6 6\n4 0 0 0 0 0 0 1 0 0\n3 4 9 10 8 1 7 -8 -10(...TRUNCATED)	2	9	{"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,3,1,4,3,4,4,3,3,2,2,2,1,4,4,2,3,4,3,4,2,2,2,4,4,4,3,3,3,2,3,2,4,1,2,3,3,3,4,1,2,3,4(...TRUNCATED)	0	C2	750	0	[ "dfs and similar", "graphs", "hashing", "shortest paths" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
p00680 KND Factory	"Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his(...TRUNCATED)	{ "input": [ "1\n4 2\n6 1 2 0\n\nSAMPLE" ], "output": [ "3\n" ] }	{"input":["+adabacaba\n-adabacaba\n+aca\naca:caba\n-aca\n+bacaba\n-bacaba\n+aba\n-aba\n+bad\n","+cab(...TRUNCATED)	{ "input": [], "output": [] }	1	10	{"language":[2,2,2,4,2,2,2,3,2,4,4,2,2,4,4,4,2,3,3,2,2,4,2,2,2,2,2,2,2,2,4,4,2,4,2,4,4,4,2,4,4,2,2,2(...TRUNCATED)	{"language":[3,2,2,2,2,1,2,2,2,4,1,2,3,4,2,2,3,1,2,2,2,2,2,3,2,1,4,3,2,4,3,1,2,4,3,2,4,3,2,3,2,2,4,2(...TRUNCATED)	0		500	0	[ "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 1 }	0
insect-colony-2	"You might have heard about our new goodie distribution program aka the \"Laddu Accrual System\". Th(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{ "input": [], "output": [] }	{"input":["2\nca\nbc\n","2\ndc\nce\n","2\nza\nzb\n","2\nab\nb\n","25\nsw\nwt\nc\nl\nyo\nag\nz\nof\np(...TRUNCATED)	2	10	{"language":[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,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED)	0		2,000	1,400	[ "dp", "graphs", "greedy", "math", "trees" ]	false		{ "nanos": 0, "seconds": 10 }	64,000,000
1291_E. Prefix Enlightenment	"You are given a huge decimal number consisting of n digits. It is guaranteed that this number has n(...TRUNCATED)	{"input":["15 22\n8 13 33418\n14 15 55849\n7 10 15207\n4 6 64328\n6 9 86902\n15 7 46978\n8 14 53526\(...TRUNCATED)	{"input":["143165576\n","1919020031\n","1204252996\n","210637432\n","724264821\n","1741\n","61948959(...TRUNCATED)	{"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSCCCCCCCSSEEESSSSS\nEESSSSCCCCCCSSEEEESAMPLE",(...TRUNCATED)	6	7	{"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,4,2,4,2,2,2,4,2,4,4,4,2,2,4,4,2,4,2,2,4,2,4,4,2,2,2,4,4,2,2,2,2,2,4,2,2,2,2,2,4,4(...TRUNCATED)	0	C	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
702_E. Analysis of Pathes in Functional Graph	"Bob is travelling from one city to another. In his way, he sees many other cities pass by. What he (...TRUNCATED)	{ "input": [ "5\n2 2 3 2 2\n", "5\n1 1 1 5 1\n" ], "output": [ "5\n", "5\n" ] }	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	{"input":["47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\(...TRUNCATED)	2	0	{"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,4,2,4,2,2,2,3,4,1,1,3,4,1,4,2,3,4,4,1,2,4,4,4,3,4,1,4,2,4,2,2,2,3,4,4,2,1,2,3,1(...TRUNCATED)	0	B	2,000	1,600	[ "greedy", "strings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000