Datasets:

TheFactoryX
/

edition_1079_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	time_limit dict	memory_limit_bytes int64 0 1.07B
614_C. Peter and Snow Blower	you are given an array of size N. You need to select K elements from the array such that the difference between the max number among selected and the min number among selected array elements should be minimum. Print the minimum difference. INPUT: First line N number i.e., length of array Second line K number Next N l...	{ "input": [ "3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n" ], "output": [ "1 2 7\n-1\n1 2 3\n" ] }	{ "input": [], "output": [] }	{ "input": [ "2\n1 222168095\n1000000000 1000000000\n", "35\n1 7\n3 11\n6 12\n7 6\n8 5\n9 11\n15 3\n16 10\n22 2\n23 3\n25 7\n27 3\n34 5\n35 0\n37 3\n39 4\n40 5\n41 1\n44 1\n47 7\n48 11\n50 6\n52 5\n57 2\n58 7\n60 4\n62 1\n67 3\n68 12\n69 8\n70 1\n71 5\n72 5\n73 6\n74 4\n", "1\n1010000000 1000000000\n", ...	2	0	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	0		500	0	[]	false	{ "nanos": 0, "seconds": 5 }	268,435,456
p01576 Exciting Bicycle	"You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...TRUNCATED)	{"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED)	{"input":["1000 1001\n217 636 713 516\n","1000 1998\n833 681 19 233\n","4 5\n1 3 4 2\n","6 7\n3 1 2 (...TRUNCATED)	{"input":["5\n42\n17\n444\n7\n52\n","5\n42\n17\n640\n7\n51\n","5\n42\n15\n444\n7\n52\n","5\n42\n21\n(...TRUNCATED)	5	10	{"language":[4,1,2,3,4,4,3,2,3,1,2,4,4,2,3,4,3,3,2,2,2,4,3,4,1,3,2,4,2,3,2,4,1,4,2,2,4,2,2,2,4,2,4,3(...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)	990	E	0	2,600	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1239_E. Turtle	"There are N students and M checkpoints on the xy-plane.\nThe coordinates of the i-th student (1 \\l(...TRUNCATED)	{"input":["2\n1 1\n100 100\n","5\n10 30 5 6 24\n10 41 7 8 24\n","4\n3 3 4 3\n4 7 6 5\n"],"output":["(...TRUNCATED)	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	{"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)	2	10	{"language":[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,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,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,4,2,2,2(...TRUNCATED)	228	B	1,000	0	[ "combinatorics", "divide and conquer" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p02408 Finding Missing Cards	"As usual, Sereja has array a, its elements are integers: a[1], a[2], ..., a[n]. Let's introduce not(...TRUNCATED)	{"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED)	{"input":["2\n1 10\n3\n2 2\n2 1\n1 1\n","2\n3922 3922\n3\n2 2\n2 1\n1 1\n","1\n1000000000\n1\n1 1\n"(...TRUNCATED)	{"input":["4\n3 4\n1 2\n3 4\n1 4\n","4\n2 4\n1 3\n3 4\n1 1\n","4\n1 4\n2 4\n2 4\n1 2\n","7\n7 7\n2 3(...TRUNCATED)	3	0	{"language":[1,1],"solution":["'''\n# Read input from stdin and provide input before running code\n\(...TRUNCATED)	{ "language": [], "solution": [] }	44	C	2,000	2,000	[ "trees" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
754_E. Dasha and cyclic table	"Hackers! Hackers! Everywhere!\nSome days back your email ID was hacked. Some one read the personal (...TRUNCATED)	{ "input": [ "5\n2 3 1 5 5\n4\n2 2 3 2\n2 1 5 3\n1 3 5\n2 1 5 3\n" ], "output": [ "5\n26\n38\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	8	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[4,4,4,2,2,2,2,2,4,2,4,2,4,2,4,1,2,2,2,2,4,2,2,2,4,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,1(...TRUNCATED)	1,361	F	0	1,400	[ "constructive algorithms", "greedy", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
ism1	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED)	{"input":["1\n5 39\n1 2\n3 4\n5 6\n7 8\n1 9\n3 10\n3 11\n5 12\n5 13\n7 14\n7 15\n9 2\n10 2\n11 2\n12(...TRUNCATED)	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <comple(...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	0	[]	false	{ "nanos": 0, "seconds": 5 }	134,217,728
p04048 AtCoder Grand Contest 001 - Mysterious Light	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{ "input": [ "5\n0 1 2 1 2\n", "4\n0 1 2 3\n" ], "output": [ "YES\n1\n2\n3\n5\n4\n", "NO\n" ] }	{"input":["5 2 4 12\nhhhwh\n","2 5 5 1000000000\nwh\n","16 1 1000 2100\nhhhwwwhhhwhhhwww\n","1 2 3 3(...TRUNCATED)	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED)	2	8	{"language":[3,3,4,2,3,3,3,3,3,2,3,4,3,3,4,3,4,3,3,3,3,3,3,3,3,4,3,3,3,4,3,1,2,4,2,3,4,3,3,3,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,088	D	3,500	1,700	[ "binary search", "brute force", "data structures", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	536,870,912
248_A. Cupboards	"In 20XX, the Aizu Chuo Road, which has a total distance of 58km and 6 sections from Atsushiokanomac(...TRUNCATED)	{ "input": [ "3\n4\n", "5\n10\n", "101\n99\n" ], "output": [ "1", "9", "2" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[2,3,4,2,3,3,2,4,4,2,3,4,4,3,2,4,2,4,2,4,4,4,2,3,3,2,3,2,4,2,2,4,2,3,2,3,2,4,3,2,3,3,4,4(...TRUNCATED)	1,398		0	1,100	[ "brute force", "greedy", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1091_G. New Year and the Factorisation Collaboration	"Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)	{ "input": [ "2 2 1 0 0 1\n", "2 2 10 11 0 1\n", "2 4 3 -1 3 7\n" ], "output": [ "1", "5", "2" ] }	{ "input": [], "output": [] }	{"input":["2\n0 1\n","5\n0 0 1 0 1\n","100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)	2	0	{"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...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	0	[ "data structures", "math" ]	false	null	256,000,000
1208_A. XORinacci	"Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED)	{"input":["? - ? = 1\n","? + ? - ? + ? + ? = 42\n","? = 1000000\n"],"output":["Impossible\n","Possib(...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":["6 4 3\n0 1 2\n2 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","5 1 7\n0 4 1\n0 10 5\n9 0 2\n9 0 0\n9(...TRUNCATED)	2	8	{"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,4,3,1,2,4,1,2,1,3,1,2,3,1,4,4,2,4,4,2,3,3,3,1,1,3,1,4,2,4,3,4,3,2,4,2,2,2,1,4,1,3,3,4(...TRUNCATED)	0	H	0	2,100	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000