Datasets:

TheFactoryX
/

edition_2112_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
1165_A. Remainder	"Some country is populated by wizards. They want to organize a demonstration.\n\nThere are n people (...TRUNCATED)	{ "input": [ "1 0\n25 47 10" ], "output": [ "96.2027355887" ] }	{"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED)	{"input":["1\n2\n111 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	2	0	{"language":[2,1,4,3,2,2,1,3,2,1,2,2,4,4,2,2,1,4,4,2,3,3,3,2,2,2,2,2,3,1,2,4,4,4,4,2,2,3,3,4,2,2,1,4(...TRUNCATED)	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		1,000	0	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
1311_F. Moving Points	"Modern researches has shown that a flock of hungry mice searching for a piece of cheese acts as fol(...TRUNCATED)	{"input":["7 5\n1 2\n2 7\n7 6\n2 3\n3 4\n","2 1\n1 2\n","7 6\n1 2\n2 7\n7 6\n2 3\n3 4\n1 5\n"],"outp(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["6\nbabddc\n","7\nbd`dccd\n","2\nab\n","7\nxxyzyyy\n","6\naagcfb\n","7\nbbbcdbc\n","4\npbr(...TRUNCATED)	2	12	{"language":[4,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,3,2,2,3,2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,3,2,2,1,4,2,2,2,2,2,2,2,2,3,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2(...TRUNCATED)	1,297		1,500	1,900	[]	false		{ "nanos": 0, "seconds": 1 }	0
614_C. Peter and Snow Blower	Example Input 2 -3 4 L 2 5 ? 3 5 Output 2 L 4 L 3	{ "input": [ "3 5\n1 2 3\n1 3 2 3 1\n" ], "output": [ "12\n" ] }	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 1(...TRUNCATED)	{"input":["3\n5\n5\n199\n","99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n(...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED)	{"language":[2,0,3,0,2,3,3,3,3,3,3,3,3,3,3,2,2,0,2,3,2,2,1,2,0,2,0,2,3,0,2,3,3,2,2,0,3,2,0,3,3,2,2,3(...TRUNCATED)	663		0	0	[ "brute force", "data structures", "implementation" ]	false		null	0
p02548 AtCoder Beginner Contest 179 - A x B + C	"Each item in the game has a level. The higher the level is, the higher basic parameters the item ha(...TRUNCATED)	{"input":["3 3\n1 2\n2 3\n3 3","7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4"],"output":["3\n2\n2","7\n6\n(...TRUNCATED)	{"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED)	{"input":["2 0\n1 1\n","9 2\n2 6 1 5 5 8 6 8 7\n","15 1\n1 1 1 1 1 1 1 1 1 1 1 2 1 1 1\n","7 1\n101 (...TRUNCATED)	2	0	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,334		500	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
1003_D. Coins and Queries	"Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED)	{"input":["6 4\n2 2 5 5 6 6\n1 3\n2 4\n3 5\n4 6\n","3 3\n314 159 265\n1 2\n1 3\n3 2\n","4 2\n2 1 1 5(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	2	9	{"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,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)	730	C	0	0	[ "data structures", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
283_D. Cows and Cool Sequences	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{"input":["21\n\n7\n\n17\n\n15\n\n17\n\n11\n\n-1\n\n15\n\n"],"output":["+ 12 16\n\n- 6 10\n\n* 8 15\(...TRUNCATED)	{"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": [], "output": [] }	3	10	{"language":[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,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,4,4,2,2,4,4,1,2,2,2,2,4,4,2,2,4,2,4,1,4,2,4,2,2,2,2,4,4,2,4,4,1,4,4,4,4,1,2,2,4,4(...TRUNCATED)	0		2,500	1,300	[ "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
roy-and-wobbly-numbers	"Allen and Bessie are playing a simple number game. They both know a function f: \\{0, 1\\}^n → R,(...TRUNCATED)	{ "input": [ "5\n0 1\n1 0\n0 1\n1 1\n0 1\n" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED)	2	10	{"language":[3,4,2,3,4,4,4,2,3,4,3,2,4,3,4,3,4,3,2,4,2,4,2,3,4,4,2,4,4,4,3,3,4,4,3,2,4,4,3,3,4,4,3,2(...TRUNCATED)	{"language":[4,1,3,2,2,4,2,4,2,4,3,1,4,3,1,2,4,4,2,1,2,4,2,2,2,2,4,2,1,2,3,2,4,4,3,4,2,2,2,3,2,2,4,1(...TRUNCATED)	252		1,750	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1091_G. New Year and the Factorisation Collaboration	"Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED)	{"input":["10 3 409693891\n","65 4 177545087\n","5 2 433416647\n"],"output":["2\n","910726\n","1\n"](...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 5 2\ns..#a\n.#...\ne#a.#\n...#a\n.#...","5 5 2\ns..#a\n.#../\n#.a#e\n...#a\n.#...","5 5(...TRUNCATED)	2	7	{"language":[3,3,1,4,2,4,2,4,3,3,4,3,2,2,2,3,1,3,2,4,1,4,3,3,3,1,3,2,3,3,2,2,4,4,3,4,2,2,3,3,3,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	0	[ "combinatorics", "divide and conquer" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
500_C. New Year Book Reading	"Easy and hard versions are actually different problems, so read statements of both problems complet(...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":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()((*##((...TRUNCATED)	6	0	{"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":[2,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED)	45		2,500	2,200	[ "implementation" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	0
578_C. Weakness and Poorness	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{"input":["9 4 12\nthis is a sample text for croc final round\n","9 1 9\nthis is a sample text for c(...TRUNCATED)	{"input":["3 1\n1 2 5\n","1 1\n100000\n","5 1\n2 2 4 6 1\n","3 10\n5 5 10\n","1 1\n1\n","3 4\n1 2 5\(...TRUNCATED)	{"input":["3\n5\n3 5 1 2 4\n1\n1\n4\n4 3 1 2\n","3\n5\n4 5 2 1 3\n1\n1\n4\n4 3 1 2\n","3\n5\n3 4 2 1(...TRUNCATED)	5	9	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[3,3,2,4,4,4,4,3,3,3,3,3,2,2,4,1,3,4,2,3,2,3,3,3,4,4,4,2,3,4,3,4,4,3,3,3,2,4,3,3,4,2,3,4(...TRUNCATED)	1,101	C	0	2,100	[ "constructive algorithms", "math" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000