Datasets:

TheFactoryX
/

edition_0905_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
615_A. Bulbs	"Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, a(...TRUNCATED)	{"input":["3\n4 2\nabca\n1 3\n10 5\ncodeforces\n2 8 3 2 9\n26 10\nqwertyuioplkjhgfdsazxcvbnm\n20 10 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n0 0\n","3\n0 1 1\n","3\n0 0 1\n","3\n0 2 0\n","5\n0 0 1 1 10\n","5\n0 0 1 1 6\n","15\n(...TRUNCATED)	6	0	{ "language": [], "solution": [] }	{"language":[2,0,2,0,3,2,0,2,2,2,2,2,0,3,2,2,2,3,2,2,4,2,2,2,2,2,2,2,0,3,4,2,2,2,2,2,2,2,2,0,2,0,0,2(...TRUNCATED)	0	D	0	3,000	[ "combinatorics", "dp", "math" ]	false	{ "nanos": 0, "seconds": 10 }	256,000,000
1285_C. Fadi and LCM	"Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)	{"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED)	0	B	2,500	0	[ "constructive algorithms", "expression parsing", "greedy", "math" ]	true	null	256,000,000
875_D. High Cry	"Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED)	{ "input": [ "3 2\n2 1 2\n1 3\n", "7 3\n3 1 3 7\n2 2 5\n2 4 6\n" ], "output": [ "1\n", "10\n" ] }	{"input":["2\n1 31\n","2\n1 0\n","10\n450661 128600 993228 725823 293549 33490 843121 903634 556169 (...TRUNCATED)	{"input":["2\n4 1\n2 15 36 43 \n3 2\n27 29 35 \n\nSAMPLE","2\n4 1\n4 15 36 43 \n3 2\n27 29 35 \n\nSA(...TRUNCATED)	5	6	{"language":[2,3,4,2,3,2,3,4,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,4,2,2,2,2,2,2,4,2,2,2,3,3,2,3,2,3(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)	1,227	F	2,000	2,200	[]	false	{ "nanos": 0, "seconds": 2 }	0
1428_D. Bouncing Boomerangs	"Polycarp has an array a consisting of n integers.\n\nHe wants to play a game with this array. The g(...TRUNCATED)	{ "input": [ "3,4,5\n5,5,8\n4,4,4\n5,4,3" ], "output": [ "1\n2" ] }	{"input":["1\n2\n110 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	{"input":["1\n5\n2 3 4 5 2\n","1\n3\n1 1 129021590\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"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)	1,208	E	0	3,000	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
272_B. Dima and Sequence	"Sorting algorithms for sorting data are basic algorithms indispensable in computer science. For exa(...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":["1 0\n","2 1\n1 2 0\n","5 4\n1 2 3 3 1 2\n5 4 0\n4 3 0\n3 1 2 5 4\n","3 3\n1 2 2 3 2\n1 3 (...TRUNCATED)	{"input":["10\n9 8 7 6 1\n","100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 1(...TRUNCATED)	2	11	{"language":[4,2,2,4,2,4,4,2,2,4,2,2,4,2,4,2,2,2,4,2,2,1,4,2,2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,3,2,2,2(...TRUNCATED)	{"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],"solution":["#include <bits/stdc++.h(...TRUNCATED)	494		0	1,000	[]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
1060_A. Phone Numbers	"Everything got unclear to us in a far away constellation Tau Ceti. Specifically, the Taucetians cho(...TRUNCATED)	{ "input": [ "3\n2 3 3" ], "output": [ "2" ] }	{"input":["100\n0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...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)	5	9	{"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,1,1,1,1,1,1,1],"solution":["d(...TRUNCATED)	{"language":[2,4,2,1,2,2,4,2,1,2,2,2,2,4,2,2,2,2,2,2,0,4,0,2,0,0,4,0,0,4,2,2,2,4,2,0,0,4,4,2,2,2,0,2(...TRUNCATED)	268	C	500	1,300	[ "*special", "strings" ]	false	{ "nanos": 0, "seconds": 3 }	268,435,456
687_D. Dividing Kingdom II	"Imagine that you are the CEO of a big old-fashioned company. Unlike any modern and progressive comp(...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":["10\n5 7 0\n2 10 1\n1 5 0\n6 8 0\n4 9 1\n2 5 1\n10 8 0\n2 3 1\n4 2 1\n10\n9\n9\n9\n5\n2\n5(...TRUNCATED)	{"input":["0 1681261333\n","10 4\n","16384 40642166\n","727373493 403495785\n","62914844 907959152\n(...TRUNCATED)	2	10	{"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":[2,2,2,2,4,2,4,2,2,2,4,4,3,3,4,4,2,4,2,4,3,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,4,4,2(...TRUNCATED)	530	B2	0	0	[ "graphs" ]	false	null	512,000,000
938_B. Run For Your Prize	"To celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of(...TRUNCATED)	{"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\nacxz\nzxcb","2\nzxda\nzxcb\n\nSAMPLE","2\nzwac\nbcyz","2\nywac\nbcyz","2\nzxca\nbcxz\n(...TRUNCATED)	3	7	{"language":[2,2,4,2,4,2,2,4,2,2,4,4,2,1,1,4,4,4,1,2,2,2,4,3,2,4,1,4,2,1,4,2,3,2,4,4,2,2,1,1,2,2,2,4(...TRUNCATED)	{"language":[2,2,2,0,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)	0	E	0	1,400	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1037_B. Reach Median	"Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integ(...TRUNCATED)	{"input":["6 5\n20 15 10 15 20 25\n","7 1\n101 53 42 102 101 55 54\n","7 1000000\n1 1 1 1 1 1 1\n"],(...TRUNCATED)	{"input":["3\n500000 500001 500002\n","1\n505050\n","2\n999998 999999\n","2\n500000 500001\n","1\n99(...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[1],"solution":["p=10**9+7;\n\ndef modpow(x,n):\n\tif(n==0):\n\t\treturn 1;\n\telif(n%2=(...TRUNCATED)	{ "language": [], "solution": [] }	319		0	0	[ "dfs and similar", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
monks-birthday-party	"You are given a square with 'n' points on each side of the square. None of these points co-incide w(...TRUNCATED)	{"input":["8\n3 1 4 1 5 9 2 6\n","5\n1 1 1 1 1\n","13\n2 7 1 8 2 8 1 8 2 8 4 5 9\n"],"output":["\n2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 10\n2\n2 2\n2 1\n1 1\n","2\n3922 3922\n1\n2 2\n2 1\n1 1\n","1\n1\n2\n1 1\n1 1\n1 1\n(...TRUNCATED)	2	0	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{"language":[4,2,2,4,4,2,2,4,2,2,4,2,2,4,2,2,3,2,3,4,2,2,1,4,3,4,3,4,4,3,2,1,1,2,3,2,4,3,2,4,4,4,2,3(...TRUNCATED)	0	A	0	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000