Datasets:

TheFactoryX
/

edition_2582_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
p03452 AtCoder Regular Contest 090 - People on a Line	"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)	{ "input": [ "5\n2 3 4 6 8" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["2\n-299878695 -496405053\n","13\n-958184557 -577042357 -616514099 -553646903 -719490759 -(...TRUNCATED)	1	0	{"language":[2,2,4,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,2,2,4,2,2,2,4,4,4,4,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	0		1,500	0	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1297_E. Modernization of Treeland	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{ "input": [ "4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n" ], "output": [ "4\n" ] }	{"input":["9 530792195 6\n","0 0 10\n","1944219055 454183506 1369298327\n","914835 2742837 9234739\n(...TRUNCATED)	{"input":["252662256 275638265\n","10 10\n","38 38\n","141650963 236544475\n","9 12\n","1002523 1700(...TRUNCATED)	5	1	{"language":[4,2,2,2,2,2,4,4,2,4,2,2,2,4,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,3,2,4,2,1,2,2,3,3,4,4,2,2,2,2(...TRUNCATED)	{"language":[3,3,2,1,4,1,2,4,3,2,2,2,3,3,2,2,3,3,3,2,4,2,2,1,4,4,2,3,2,2,2,2,3,3,2,3,2,4,2,2,2,2,3,4(...TRUNCATED)	0	E	0	0	[ "" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
lexicographically-preceding-permutation	"Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to(...TRUNCATED)	{ "input": [ "10 5 5 5\n", "3 0 0 2\n" ], "output": [ "9\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["4 6\n1 2 101\n3 1 100\n2 4 100\n4 3 100\n1 4 100\n3 2 100","15 22\n8 13 33418\n14 15 5584(...TRUNCATED)	1	9	{"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,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,1,2,2,2,2(...TRUNCATED)	0	C	0	2,500	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1311_F. Moving Points	"You are given q queries in the following form:\n\nGiven three integers l_i, r_i and d_i, find minim(...TRUNCATED)	{ "input": [ "7\n", "9\n" ], "output": [ "210\n", "504\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":["21 6\n12 15 14 4 4 7 3 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	5	7	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED)	{ "language": [], "solution": [] }	40	K	2,500	1,600	[ "greedy", "two pointers" ]	false	"アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	268,435,456
pcsc1	"You are practicing a juggle that involves in a number of square tiles. They all look the same in th(...TRUNCATED)	{"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)	{ "input": [ "abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n" ], "output": [ "1\n3\n2\n" ] }	{"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED)	2	7	{"language":[4,3,4,4,3,3,3,3,3,3,3,4,4,3,3,3,4,3,3,3,3,2,2,3,2,3,3,4,3,2,3,4,2,4,3,4,3,3,3,3,3,4,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	699	A	0	3,500	[ "ternary search" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
p02705 AtCoder Beginner Contest 163 - Circle Pond	"Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?\n\nInput\n\nThe input (...TRUNCATED)	{ "input": [ "6 5\n1 2 2 4 2 3\n", "7 5\n3 3 2 1 1 1 3\n" ], "output": [ "4\n", "2\n" ] }	{"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)	{"input":["10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n19 6\n1 1\n10 8\n","10\n2 3 1 5 6 4 1 10 7 7\n5\n(...TRUNCATED)	6	0	{"language":[1,2,2,2,2,4,4,4,3,2,4,2,4,2,4,2,3,2,2,2,3,4,2,1,3,2,3,4,3,2,1,4,3,2,2,2,1,2,4,2,4,4,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,4,2,2,2,4,2,2,4,4,4,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,1,2,2,3,4,2(...TRUNCATED)	152		1,500	2,600	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	0
1129_D. Isolation	"You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or (...TRUNCATED)	{"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...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":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[3,2,2,2,3,2,3,3,2,2,2,4,2,2,2,2,2,3,2,2,2,4,2,2,4,2,4,2,4,2,2,3,2,2,4,2,3,2,2,2,4,4,2,2(...TRUNCATED)	621	B	1,000	1,100	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1170_E. Sliding Doors	"Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianth(...TRUNCATED)	{ "input": [ "3\n2\n6\n10" ], "output": [ "2\n1826/189\n877318/35343\n" ] }	{ "input": [], "output": [] }	{"input":["4 1\n7 6 1 2\n3\n3\n2 1 9\n2 1 10\n2 1 6\n","3 5\n3 2 8\n1 2 8 1 1\n4\n2 3 3\n1 2 2\n2 2 (...TRUNCATED)	2	9	{"language":[3,4,4,4,1,3,4,3,2,4,3,3,3,4,3,2,3,3,4,3,4,4,4,2,3,2,4,3,3,4,4,3,3,3,2,2,3,4,2,4,2,3,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	551	A	500	800	[ "constructive algorithms", "greedy", "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
80_C. Heroes	"Jiro is a fun loving lad. His classmates are very competitive and are striving for getting a good r(...TRUNCATED)	{"input":["6\n1\n14\n2\n1 -1\n4\n5 5 5 1\n3\n3 2 1\n2\n0 1\n5\n-239 -2 -100 -3 -11\n"],"output":["YE(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED)	2	0	{"language":[3,4,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,3,2,3,2,3,2,3,3,2,3,3,3,2,2,3,3,3,2,3,0,3,2,3,3,2,2,2,3,3,0,2,2,0,3,3,3,0,2,3,2,3,3(...TRUNCATED)	1,490	C	1,500	0	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
470_F. Pairwise Sums	"We are definitely not going to bother you with another generic story when Alice finds about an arra(...TRUNCATED)	{ "input": [ "8\nE7\nE7\nE7\n00\n00\nE7\nE7\nE7\n", "4\n7\nF\nF\nF\n" ], "output": [ "1", "1" ] }	{"input":["36 102 73 101 19\n5 9 2 2 6\n4 13\n","119 0 0 0 0\n2 0 0 0 0\n5 5\n","0 0 119 0 0\n0 0 2 (...TRUNCATED)	{"input":["bbcbccbabcbabcbaaccccaaabcbcaacacbabbbbcabcbbbbacbcaccccbcccbccaaabcabacccbaccccbbababccb(...TRUNCATED)	2	7	{"language":[1],"solution":["from collections import deque\nclass Frog():\n\t\n\tdef __init__(self,n(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,4,2,2(...TRUNCATED)	1,291		3,000	800	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0