Datasets:

TheFactoryX
/

edition_2783_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
1158_F. Density of subarrays	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{"input":["8\n0 0\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"](...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 8","9 5","7 10","3 8","9 8","7 7","6 8","7 9","7 8","7 3","7 2","9 2","9 4","9 6","5 6"(...TRUNCATED)	2	0	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...TRUNCATED)	{"language":[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,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	180	D	2,750	1,600	[]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
substrings-count-3	"You are given a rebus of form ? + ? - ? + ? = n, consisting of only question marks, separated by ar(...TRUNCATED)	{ "input": [ "5\nZZZAA\n", "7\nABACABA\n" ], "output": [ "ZZ\n", "AB\n" ] }	{"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)	{"input":["3 4\n5 6\n3 3\n2 2\n1 0\n0 0","3 7\n5 6\n3 3\n2 2\n1 0\n0 0","3 7\n5 6\n3 0\n2 2\n1 0\n0 (...TRUNCATED)	1	0	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,1,2,2,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,3,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)	867	B	3,000	0	[]	false		{ "nanos": 0, "seconds": 3 }	1,073,741,824
p00638 Old Bridges	"A string is called a k-string if it can be represented as k concatenated copies of some string. For(...TRUNCATED)	{ "input": [ "10\n1 2 3 4 5\n", "6\n1 2 6\n" ], "output": [ "10\n", "2\n" ] }	{"input":["16\n2 2 2 2 2 3 3 3 3 5 5 7 7 11 13 17\n","16\n2 2 2 2 2 2 2 2 3 3 5 5 7 11 13 17\n","16\(...TRUNCATED)	{"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,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,4,0,2,3,2,3,2(...TRUNCATED)	805	F	0	800	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02741 Panasonic Programming Contest 2020 - Kth Term	"There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED)	{"input":["4\n10 4\n4 5\n5 2\n2 1\n1 3\n1 9\n9 10\n2 7\n7 8\n5 6\n4 3\n1 2\n2 3\n3 4\n5 3\n1 2\n1 3\(...TRUNCATED)	{"input":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED)	{"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED)	2	1	{"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,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	2,900	[ "binary search", "data structures", "hashing" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1547_C. Pair Programming	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{ "input": [ "2\n1\n2\n", "3\n1\n1\n2\n" ], "output": [ "NO\n", "YES\n" ] }	{ "input": [], "output": [] }	{"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)	3	7	{"language":[3,3,2,3,2,4,4,1,4,3,3,3,3,2,3,3,3,4,1,3,2,3,4,3,2,3,3,3,2,4,4,2,2,2,2,3,2,3,4,2,4,2,2,2(...TRUNCATED)	{"language":[2,3,4,3,3,4,2,2,3,3,2,2,2,3,3,3,2,2,3,3,3,4,2,3,2,2,3,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2(...TRUNCATED)	0	A	0	1,500	[ "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1391_C. Cyclic Permutations	"Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)	{"input":["4\nsword weapon 10 2 3 2\npagstarmor armor 0 15 3 1\niceorb orb 3 2 13 2\nlongbow weapon (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n1000 910\n94625 95469 92038 95916 93405 95533 97004 92469 99853 94992 90361 99819 932(...TRUNCATED)	2	9	{"language":[1,4,3,2,4,4,2,3,2,2,2,4,2,2,2,4,1,2,4,4,2,4,4,4,4,3,4,2,4,2,4,2,2,3,3,4,3,4,4,2,4,4,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	774	B	1,500	0	[ "binary search", "dp", "sortings", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	0
1208_A. XORinacci	"You are given a tree with n vertices; its root is vertex 1. Also there is a token, initially placed(...TRUNCATED)	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n1\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0"],"output":["(...TRUNCATED)	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	{"input":["4 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 1\n8 5\n6 8\n","11 9\n5 9\n8 5\n11 3\n11 1\n(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n\(...TRUNCATED)	{ "language": [], "solution": [] }	1,244		0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
magic-gcd	"The time has arrived when the world is going to end. But don't worry, because the new world yuga wi(...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["qbdp","dbqp","bdqp","bqpp","pdqb","dqbp","pqbd","pqdb","bqqp","pdpb","pbqd","dqpb","bqpq"(...TRUNCATED)	2	7	{"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": [], "solution": [] }	219		1,000	3,000	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
152_E. Garden	"ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)	{"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 0 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED)	{"input":["8\n1 2\n1 3\n1 4\n1 5\n2 6\n2 7\n2 8\n","9\n9 2\n9 3\n9 4\n9 5\n2 6\n5 7\n7 8\n7 1\n","9\(...TRUNCATED)	{"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	8	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED)	0	F	0	0	[ "dp", "math" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
cdva1502	"Problem\n\nKND is a student programmer at the University of Aizu. There are N towns around his town(...TRUNCATED)	{ "input": [ "3\n2 3 4\n2 1\n1\n-1\n" ], "output": [ "56\n" ] }	{ "input": [], "output": [] }	{"input":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)	2	8	{"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],"solution":["for q in range((...TRUNCATED)	{"language":[4,4,4,1,2,4,1,4,2,4,1,4,2,1,1,2,1,4,2,3,4,3,3,4,2,4,2,2,4,4,3,1,2,2,2,3,4,3,4,2,3,3,2,2(...TRUNCATED)	39		500	1,000	[ "" ]	false	"JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	1,073,741,824