Datasets:

TheFactoryX
/

edition_0788_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
p00573 Commuter Pass	"The rebels have saved enough gold to launch a full-scale attack. Now the situation is flipped, the (...TRUNCATED)	{"input":["4\n1 2\n1 3\n1 2\n1 2\n1 3\n1 2\n2 5\n1 2\n3 1\n1 4\n5 1\n1 6\n2 15\n1 2\n1 3\n1 4\n1 5\n(...TRUNCATED)	{"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)	{"input":["3 5 999999997\n","1011 1 1000000000\n","1 30 33\n","29 3 1000000000\n","3 2 31\n","2 2 85(...TRUNCATED)	2	0	{"language":[2,2,4,2,4,3,4,4,2,2,3,1,4,3,3,2,3,3,2,4,2,4,2,2,2,3,3,3,3,3,3,2,4,3,2,2,3,2,2,4,3,4,4,4(...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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	0	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
professor-sharma	"An elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and (...TRUNCATED)	{"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED)	{"input":["4 9\n5 1000000000 999999999 12\n","4 6\n5 1000000000 999999999 12\n","1 1\n4\n","3 5\n4 5(...TRUNCATED)	{"input":["2 2\n3\n1 2 1\n2 3 2\n3 3 1","3 2\n1\n1 2 1\n2 3 2\n3 3 1","2 2\n3\n2 2 1\n2 3 2\n3 3 1",(...TRUNCATED)	6	11	{"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...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)	0	E	2,500	0	[ "constructive algorithms", "greedy", "number theory" ]	false	{ "nanos": 0, "seconds": 10 }	0
45_H. Road Problem	"Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...TRUNCATED)	{"input":["1\n0\n","6\n2 0 3 0 1 1\n","6\n3 2 2 2 1 1\n"],"output":["0\n\n","5\n6 6\n5 5\n4 3\n4 5\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 10\n1 2\n1 3\n2 2 4\n1 5\n0\n1\n","6 6\n1 2\n2 3 6\n1 4\n1 6\n1 1\n0\n1\n","6 6\n2 4 3\(...TRUNCATED)	5	0	{"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],"solut(...TRUNCATED)	{"language":[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,2,2,2,2,2,2(...TRUNCATED)	1,431	G	2,750	1,900	[]	false	null	256,000,000
203_E. Transportation	"Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...TRUNCATED)	{ "input": [ "11 5 2\n11010100101\n", "11 5 1\n11010100101\n" ], "output": [ "1\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED)	2	7	{"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],"solution":["t = int(raw_input())\nf(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,3,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	361	A	750	1,300	[]	false	{ "nanos": 500000000, "seconds": 2 }	268,435,456
max-min	"The statement of this problem is the same as the statement of problem C1. The only difference is th(...TRUNCATED)	{ "input": [ "8\n1 2 3 4 5 6 7 8\n", "4\n1 0 1 2\n" ], "output": [ "1\n3\n6\n10\n16\n24\n40\n", "1\n1\n3\n" ] }	{ "input": [], "output": [] }	{"input":["bbcbccbabcbabcbaaccccaaabcbcaacacbabbbbcabcbbbbacbcaccccbcccbccaaabcabacccbaccccbbababccb(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n\(...TRUNCATED)	{"language":[2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,3,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	0	[ "" ]	true	{ "nanos": 0, "seconds": 1 }	1,073,741,824
1227_A. Math Problem	"Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)	{"input":["3 2\n2 1\n3 2\n3 1\n","4 3\n4 1\n1 2\n2 2\n3 2\n"],"output":["5.5\n1 3 \n2 1 2 \n","8.0\n(...TRUNCATED)	{"input":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"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)	5	9	{"language":[2,2,2,2,2,2,2,2,2,3,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,4,2(...TRUNCATED)	{"language":[3,4,3,3,2,3,2,4,2,3,2,2,4,3,2,2,4,3,4,4,4,3,2,2,4,3,1,2,3,2,4,4,4,3,4,3,3,2,4,2,4,3,3,4(...TRUNCATED)	962		0	1,700	[ "data structures", "implementation", "sortings" ]	false	null	0
1547_C. Pair Programming	"You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or (...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{ "input": [], "output": [] }	{"input":["264193194 -448876521 716456020 -633906160 -328597212 -47935734\n","1 0 2 1 3 0\n","-35753(...TRUNCATED)	2	10	{"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...TRUNCATED)	{"language":[2,2,2,2,0,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],"solution":[(...TRUNCATED)	536	J	0	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00953 Animal Companion in Maze	"Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...TRUNCATED)	{ "input": [ "7\n", "9\n" ], "output": [ "210\n", "504\n" ] }	{ "input": [], "output": [] }	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	2	0	{"language":[2,4,3,2,3,1,3,4,3,2,4,4,3,3,2,2,2,3,1,1,1,2,2,3,4,4,3,4,1,1,2,3,1,2,4,2,3,4,3,3,3,2,1,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	A2	0	0	[ "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p02741 Panasonic Programming Contest 2020 - Kth Term	"You want to perform the combo on your opponent in one popular fighting game. The combo is the strin(...TRUNCATED)	{ "input": [ "4\n4 4\n1000000000 0\n7 15\n8 7\n" ], "output": [ "2\n0\n7\n5\n" ] }	{ "input": [], "output": [] }	{"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 6\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)	2	9	{"language":[4,2,2,2,2,2,4,2,4,2,2,4,2,4,2,2,4,4,2,3,2,2,2,4,4,4,2,2,2,2,4,4,2,2,4,2,4,3,2,2,4,4,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1202_C. You Are Given a WASD-string...	"Igor is a post-graduate student of chemistry faculty in Berland State University (BerSU). He needs (...TRUNCATED)	{"input":["5 18 1000\n","132 10 35\n","48 132 235\n","2 2 1\n"],"output":["-1","5 7\n","22 111","1 1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	6	0	{"language":[4,3,3,4,4,3,3,3,3,2,3,3,4,2,2,3,2,4,2,3,2,3,2,1,4,4,4,3,2,3,3,2,2,3,4,2,3,4,3,4,4,3,3,4(...TRUNCATED)	{ "language": [], "solution": [] }	914	D	0	0	[ "constructive algorithms", "implementation" ]	false	null	256,000,000