Datasets:

TheFactoryX
/

edition_1254_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
p02014 Rough Sorting	"In PrimeLand, there existed a very handsome young prince named Prima. He greatly desired the Prince(...TRUNCATED)	{ "input": [ "5\n0 0\n2 0\n1 1\n2 2\n0 2", "4\n0 0\n3 1\n2 3\n0 3" ], "output": [ "0", "1" ] }	{"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)	{"input":["3\n184427 500001 500002\n","1\n413243\n","1\n256223\n","2\n3 999999\n","1\n576559\n","2\n(...TRUNCATED)	3	11	{"language":[3,3,2,2,3,2,2,2,3,3,3,2,3,4,3,2,3,2,3,2,2,2,2,3,3,3,3,2,2,3,3,2,3,2,3,4,3,2,3,2,4,1,4,3(...TRUNCATED)	{"language":[4,4,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,4,3,2,4,4,2,1,4,2,4,4,2,3,3,4,2,2,2,2,4,2,2,4,2,2(...TRUNCATED)	1,466		1,000	1,000	[ "data structures", "implementation", "sortings" ]	true		{ "nanos": 0, "seconds": 2 }	64,000,000
p03407 AtCoder Beginner Contest 091 - Two Coins	"Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED)	{"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 1\n7 1 1\n2 0 1\n","5 1\n2 1 1\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 1\n6 0 0\n11 1 0\n9 0 (...TRUNCATED)	3	9	{"language":[3,3,3,3,3,3,3,1,1,3,3,4,3,3,3,2,1,2,3,3,3,2,3,3,3,3,4,3,2,3,3,3,3,3,3,4,3,3,3,2,3,3,3,3(...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)	962	C	1,750	2,100	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	true		{ "nanos": 0, "seconds": 4 }	32,000,000
438_A. The Child and Toy	"Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The al(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)	{"input":["3\n1 1\n5 2\n6 3","4\n1 5\n4 7\n2 1\n6 4","10\n1375710043 178537096\n705445072 318106937\(...TRUNCATED)	6	9	{"language":[2,2,2,2,2,2,2,2,4,4,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,4,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	2,000	0	[]	false		{ "nanos": 0, "seconds": 2 }	0
392_D. Three Arrays	"You are given an equation A * X + B * Y = C, A, B, C are positive integer coefficients, X and Y are(...TRUNCATED)	{ "input": [ "4\naaa\nabc\nabdbca\nabba" ], "output": [ "YES\nNO\nYES\nYES\n" ] }	{"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED)	{"input":["4","101","5","001","8","6","2","110","10","13","111","12","17","9","7","14","16","11","22(...TRUNCATED)	5	7	{"language":[1,1],"solution":["def isvalid(s, c):\n if c.difference(s):\n return False\n (...TRUNCATED)	{"language":[2,4,2,2,2,3,4,2,2,2,4,1,4,2,4,1,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,4,2,2,1,2,2,2,2,2(...TRUNCATED)	0		0	2,700	[]	false		{ "nanos": 0, "seconds": 2 }	0
monks-choice-of-numbers-1	"There are N students and M checkpoints on the xy-plane.\nThe coordinates of the i-th student (1 \\l(...TRUNCATED)	{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }	{ "input": [], "output": [] }	{"input":["2 2 1\n1 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	2	0	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	0		0	2,900	[ "" ]	false		null	512,000,000
p02069 Universal and Existential Quantifiers	"We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED)	{"input":["5 2 1\n0.1 0.2 0.3 0.4 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0"],"output":["0.01\n0.00(...TRUNCATED)	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 86\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	{"input":["3\n9 5 8\n8 9 3\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n1(...TRUNCATED)	2	9	{"language":[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,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		1,000	0	[ "graphs", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p01086 Short Phrase	"You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED)	{ "input": [ "3 5\n1 2 3\n1 3 2 3 1\n" ], "output": [ "12\n" ] }	{"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...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	10	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{"language":[2,4,0,2,2,2,2,2,2,3,2,2,4,3,3,2,2,3,3,3,2,2,2,2,2,2,2,3,3,0,3,2,3,3,2,2,0,2,3,2,2,3,2,2(...TRUNCATED)	0	B	0	0	[ "" ]	false	"Problem\n\nマイヅ大学にある大規模クラスタ†型スーパーコンピュータ（通(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
p00781 Lattice Practices	"You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's (...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": [], "output": [] }	{"input":["6 8\nabbaab\n+ 1 a\n+ 3 a\n+ 3 a\n+ 1 b\n+ 2 b\n+ 3 b\n- 1\n+ 2 z\n","6 8\nabdabc\n+ 2 a\(...TRUNCATED)	1	7	{ "language": [], "solution": [] }	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,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(...TRUNCATED)	0		0	2,500	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
p01931 Check answers	"Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed grap(...TRUNCATED)	{ "input": [ "3 2 1\n1 2\n3\n", "10 8 2\n1 2 3 5 6 7 8 9\n3 5\n" ], "output": [ "-1", "2" ] }	{"input":["2016 4549\n433\n","5000 1\n3\n","4035 369\n26\n","1595 2881\n710\n","3762 3914\n1073\n","(...TRUNCATED)	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	1	13	{"language":[4,2,2,2,2,2,4,4,2,2,4,4,2,4,2,2,2,2,2,2,2,4,4,2,4,2,4,4,2,2,2,4,4,2,2,2,4,2,4,2,2,2,2,4(...TRUNCATED)	{"language":[2,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED)	151	B	20	800	[ "" ]	true	"差分パルス符号変調は主に音声信号を圧縮する際に用いられる圧縮手法の(...TRUNCATED)	null	268,435,456
colarr	"Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED)	{"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED)	{"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...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)	2	10	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	25	C	0	0	[ "implementation", "strings" ]	false		null	256,000,000