Datasets:

TheFactoryX
/

edition_0787_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
180_D. Name	Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of moving from a cell (e, f) to one of the cells (e + 1, f), (e-1, f), (e, f + 1), (e, f-1) is 1. And. You can also move between (e, c-1) and (e, 0), and between (r-1, f) and (0, f) at a cost of 1. At this time, find the number...	{ "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": [ "1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 89294440 697458143\n", "10 23\n411970360 640040178 804073268 984486113 986486863 148005705 76298857 42029651 532226702 323118350 534950064 416196153 555656853 793340002 335040530 666422063 319682681 144477179 59...	{ "input": [ "264193194 -448876521 716456020 -633906160 -328597212 -47935734\n", "1 0 2 1 3 0\n", "-357531221 381512519 -761132895 -249724943 328888775 -237692564\n", "-1000000000 -1000000000 0 0 1000000000 561874888\n", "-1 2 4 5 4 0\n", "0 0 2 67 0 90\n", "-1000000000 -1000000000 0 10000...	2	0	{ "language": [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 2, ...	{ "language": [], "solution": [] }	1,253	D	0	1,900	[ "dp", "games" ]	false	{ "nanos": 500000000, "seconds": 1 }	512,000,000
545_C. Woodcutters	"There is a factory that inputs the data of the side and diagonal lengths to the machine and cuts ou(...TRUNCATED)	{"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)	{"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": [], "output": [] }	6	0	{"language":[2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,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(...TRUNCATED)	{"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)	630		0	3,000	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00490 Best Pizza	"Lee tried so hard to make a good div.2 D problem to balance his recent contest, but it still doesn'(...TRUNCATED)	{ "input": [ "5\n1 4 3 5 2", "9\n1 2 4 9 5 8 7 3 6", "2\n1 2", "2\n2 1" ], "output": [ "2", "3", "1", "0" ] }	{"input":["1.0 200.0 200.0\n","0.2 0.1 0.6\n","1.9 3.0 4.1\n","51.8 51.8 7.1\n","113.9 125.2 88.8\n"(...TRUNCATED)	{ "input": [], "output": [] }	6	0	{"language":[2,2,2,3,2,2,4,2,2,3,2,2,2,2,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	551	B	0	800	[ "flows", "shortest paths" ]	false	null	256,000,000
p01219 Private Teacher	"There are n armchairs, numbered from 1 to n from left to right. Some armchairs are occupied by peop(...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{ "input": [], "output": [] }	{"input":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED)	2	12	{"language":[1],"solution":["digits=[6,2,5,5,4,5,6,3,7,6]\nvalids=[{} for i in xrange(11)]\nst0={}\n(...TRUNCATED)	{"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	518	F	0	2,000	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	134,217,728
p02445 Swap	Example Input ACM Output 0	{"input":["22\n0011223344556677889988\n","11\n00000000008\n","11\n31415926535\n"],"output":["2\n","1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 0\n1 2\n","2 1\n1 3\n","3 3\n1 2\n1 5\n2 3\n","2 0\n1 0\n","4 0\n1 0\n","4 0\n1 -1\n","(...TRUNCATED)	6	10	{"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...TRUNCATED)	{ "language": [], "solution": [] }	709	D	1,250	1,400	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p02120 Cluster Network	"There is little time left before the release of the first national operating system BerlOS. Some of(...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":["4\n439 79\n991800654 985952720 985538124 983840231 983710443 982377023 981242112 98021743(...TRUNCATED)	{"input":["3 3\n2 4 1 0 1\nXAX\nB.B\nXAX","3 6\n2 4 1 1 1\nXXA\nB.B\nXAX","10 6\n1 9 1 2 3\nYXA\nB.B(...TRUNCATED)	2	11	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	846	B	0	2,000	[ "dfs and similar", "graphs", "probabilities", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
45_H. Road Problem	"Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is ex(...TRUNCATED)	{ "input": [ "4\n6 6 5 5\n", "5\n1 2 3 1 3\n", "4\n6 6 4 4\n" ], "output": [ "0", "4", "-8" ] }	{"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":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n2 4 5\n","1 1\n0\n1\n1\n","1 0\n1\n1\n1\n","8 6\n00100011\(...TRUNCATED)	5	12	{"language":[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>\n\(...TRUNCATED)	{"language":[4,4,4,2,3,2,2,2,3,3,4,3,4,2,2,3,4,4,2,2,2,2,2,3,2,3,3,4,4,2,3,2,3,2,3,2,4,4,4,4,2,4,2,2(...TRUNCATED)	0	E	0	0	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1391_C. Cyclic Permutations	"Coach Ankit is forming a team for the Annual Inter Galactic Relay Race. He has N students that trai(...TRUNCATED)	{"input":["3 10\n2 3 2\n6\n1 5\n2 1 10\n2 2 9\n2 5 6\n3 1 7 8\n4 1 2 3 4\n"],"output":["\nYES\nYES\n(...TRUNCATED)	{"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...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)	6	9	{"language":[1,1],"solution":["#!/usr/bin/env python\n#-- coding:utf-8 --\n\n\ndef convert_pair(a,(...TRUNCATED)	{"language":[2,3,3,2,2,3,2,4,3,3,2,2,4,4,4,2,4,4,4,4,3,2,4,3,2,2,2,2,2,3,2,2,2,2,2,3,4,4,4,2,4,2,4,3(...TRUNCATED)	1,540		500	800	[ "dfs and similar" ]	false	{ "nanos": 500000000, "seconds": 0 }	1,073,741,824
1012_B. Chemical table	"In one well-known algorithm of finding the k-th order statistics we should divide all elements into(...TRUNCATED)	{"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED)	{"input":["99\n1\n3\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n1\n1\n3\n3\n3\n3\n1\n1\n3\n2\n1\n1\n1\n1\n1\n1(...TRUNCATED)	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 6 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	6	7	{"language":[3,4,1,3,4,2,4,2,2,2,3,3,4,3,2,2,3,3,2,2,2,2,1,3,2,3,4,3,3,1,4,3,3,2,2,3,2,3,4,3,3,3,4,4(...TRUNCATED)	{"language":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	C	0	1,400	[ "implementation" ]	true	{ "nanos": 0, "seconds": 2 }	536,870,912
p02705 AtCoder Beginner Contest 163 - Circle Pond	"Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same(...TRUNCATED)	{"input":["3\n3 3\n1 -3 4\n1 5 2\n2 2\n-2 0\n1 2\n2 2\n0 1\n1 2\n"],"output":["\n0 6 2 \n-1 -1 \n1 3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 9\n5 1000000000 999999999 19\n","4 6\n5 1000000000 1790978867 12\n","3 5\n8 5 6\n","3 4(...TRUNCATED)	6	0	{"language":[3,3,3,3,3,2,3,3,3,3,3,4,4,4,3,2,3,3,3,2,3,2,2,3,2,4,2,3,3,3,4,2,2,3,2,2,2,3,3,3,3,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,0,4,0,0,2,4,0,2,0,2,0,0,4,0,2,2,2,0,2,2,0,2,3,4,2,4,0,4,0,2,0,2,2,2,2,2,0,2,4(...TRUNCATED)	0	C	1,500	1,900	[]	false	null	268,435,456