name large_stringlengths 4 70 | description large_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 large_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 large_stringclasses 36
values | time_limit dict | memory_limit_bytes int64 0 1.07B | input_file large_stringclasses 1
value | output_file large_stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
p02260 Selection Sort | Jiro is a fun loving lad. His classmates are very competitive and are striving for getting a good rank, while he loves seeing them fight for it. The results are going to be out soon. He is anxious to know what is the rank of each of his classmates.
Rank of i'th student = 1+ (Number of students having strictly grea... | {
"input": [
"5\n2\n3\n4\n5\n6",
"11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17"
],
"output": [
"3",
"4"
]
} | {
"input": [
"5\ncbbbb\nbcbbb\naacbb\naaacb\naaaac\n",
"20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\njagcacbadagcedbigaja\naaadicdbjdiibhihbgeb\nhiijbehdeaafdabiigha\nfiifibibgddjfbdafbif\nhdbgbcfjdgibadabfgaf\ngggdaijhfgbaidfajdaj\nfajhebaaaigdjaajcaij\nbhcbajicidbjbabdbfcb\nbghiidibabbbbgiacbfe\njcdabjdj... | {
"input": [
"2\n5\n6 5 4 3 2\n5\n3 4 6 1 1",
"2\n5\n6 5 4 3 2\n5\n3 7 9 1 1",
"2\n5\n6 5 4 3 3\n5\n3 7 9 1 1",
"2\n5\n6 5 4 3 2\n5\n3 8 3 1 1",
"2\n5\n6 5 4 5 2\n5\n3 7 6 1 1",
"2\n5\n6 5 4 4 2\n5\n3 8 3 1 1",
"2\n5\n6 5 2 3 0\n5\n3 4 12 1 1",
"2\n5\n6 6 2 3 0\n5\n3 4 12 1 1",
"2\... | 3 | 0 | {
"language": [],
"solution": []
} | {
"language": [
2,
2,
2,
4,
2,
2,
2,
2,
3,
2,
2,
2,
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,
... | 0 | E | 0 | 1,900 | [
"binary search",
"data structures",
"graph matchings",
"greedy",
"implementation",
"math",
"trees"
] | false | null | 512,000,000 | |||
1413_F. Roads and Ramen | "Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so s(...TRUNCATED) | {"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 4\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED) | 2 | 11 | {"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED) | {"language":[2,4,2,2,4,2,2,2,2,3,4,1,4,4,2,2,2,1,2,4,4,2,2,2,2,2,2,2,4,4,4,4,2,1,4,4,2,2,3,2,2,2,4,2(...TRUNCATED) | 0 | 0 | 1,100 | [
"brute force",
"greedy"
] | false | {
"nanos": 0,
"seconds": 3
} | 256,000,000 | ||||
1189_D1. Add on a Tree | "You are given a simple code of a function and you would like to know what it will return. \n\n F(N,(...TRUNCATED) | {
"input": [
"1\n4 2\n6 1 2 0\n\nSAMPLE"
],
"output": [
"3\n"
]
} | {"input":["16\n2 2 2 2 2 3 3 3 3 5 5 7 7 11 13 17\n","16\n2 2 2 2 2 2 2 2 3 3 5 5 7 11 13 17\n","16\(...TRUNCATED) | {"input":["1000 4 750160753\n","2 7 727733989\n","994 9 410957831\n","269 4 817408561\n","386 5 4292(...TRUNCATED) | 2 | 12 | {"language":[1,2,2,2,2,4,2,4,4,2,2,3,2,4,2,2,1,2,2,4,4,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | B | 0 | 2,400 | [
"data structures",
"greedy",
"two pointers"
] | false | null | 0 | |||
1199_E. Matching vs Independent Set | "Coach Ankit is forming a team for the Annual Inter Galactic Relay Race. He has N students that trai(...TRUNCATED) | {
"input": [
"5\n1 2\n1 3\n3 4\n2 5"
],
"output": [
"1"
]
} | {
"input": [],
"output": []
} | {"input":["5 2 4 15\nhhhwh\n","2 8 5 1000000000\nwh\n","1 3 3 3\nw\n","10 2 3 32\nhwwhwhwwhh\n","7 1(...TRUNCATED) | 2 | 0 | {"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": [],
"solution": []
} | 1,007 | E | 0 | 2,300 | [
"*special",
"implementation"
] | false | {
"nanos": 500000000,
"seconds": 0
} | 1,073,741,824 | |||
1525_D. Armchairs | "Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED) | {
"input": [
"2\n\nSAMPLE"
],
"output": [
"3\n"
]
} | {"input":["4\n889308 0\n110692 0\n0 461939\n146447 815492\n","5\n0 4\n3 4\n2 2\n2 0\n0 0\n","5\n0 10(...TRUNCATED) | {
"input": [],
"output": []
} | 2 | 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,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED) | {"language":[2,2,2,3,0,2,2,3,2,2,3,2,3,2,3,3,2,3,2,0,3,2,2,3,3,0,0,2,3,2,2,2,2,2,2,2,2,2,3,3,0,2,2,3(...TRUNCATED) | 0 | 0 | 1,100 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 256,000,000 | ||||
1244_C. The Football Season | "problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED) | {"input":["1 1 1\n","3 1 0\n"],"output":[" (...TRUNCATED) | {
"input": [],
"output": []
} | {"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED) | 6 | 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,2,2,2,2(...TRUNCATED) | {"language":[3,2,2,3,4,2,4,3,2,2,1,2,4,3,4,3,2,3,2,2,4,2,3,2,2,2,3,4,4,3,2,2,3,2,2,3,4,2,2,2,2,2,3,4(...TRUNCATED) | 963 | 2,500 | 0 | [
"data structures"
] | false | {
"nanos": 0,
"seconds": 2
} | 1,073,741,824 | ||||
316_B2. EKG | "Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED) | {
"input": [
"3 5 35\n",
"3 35 5\n"
],
"output": [
"2\n5 4\n10 1\n",
"0\n"
]
} | {
"input": [],
"output": []
} | {"input":["5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0","5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n0(...TRUNCATED) | 2 | 12 | {"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":[2,2,2,2,2,2,2,2,2,2,1,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,2,2,2,2,2(...TRUNCATED) | 1,512 | 0 | 0 | [
"constructive algorithms",
"graphs",
"greedy",
"implementation"
] | false | {
"nanos": 0,
"seconds": 2
} | 268,435,456 | ||||
mind-palaces-3 | "You and your friend are participating in a TV show \"Run For Your Prize\".\n\nAt the start of the s(...TRUNCATED) | {
"input": [
"5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0"
],
"output": [
"7\n0\n3"
]
} | {
"input": [],
"output": []
} | {"input":["5\n2 2 4 7 10","5\n1 2 22 7 0","5\n1 2 4 3 10","5\n0 2 3 7 1","5\n0 2 1 7 1","5\n1 2 4 3 (...TRUNCATED) | 3 | 11 | {"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,3,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,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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED) | 0 | 1,000 | 0 | [
"*special",
"implementation",
"strings"
] | false | {
"nanos": 0,
"seconds": 5
} | 268,435,456 | ||||
938_B. Run For Your Prize | "Adilbek's house is located on a street which can be represented as the OX axis. This street is real(...TRUNCATED) | {
"input": [
"5\n7 46 11 20 11",
"7\n994 518 941 851 647 2 581",
"3\n3 4 6"
],
"output": [
"90",
"4527",
"10"
]
} | {"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED) | {"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED) | 2 | 8 | {"language":[2,3,3,2,3,1,3,2,4,2,4,3,3,2,3,4,2,3,3,3,3,3,2,3,3,3,3,2,3,3,4,4,4,3,3,3,1,3,3,2,3,4,3,3(...TRUNCATED) | {"language":[2,2,2,4,2,4,2,2,2,4,2,4,4,4,2,2,4,4,2,4,2,2,4,2,4,4,2,2,2,4,4,2,2,2,2,2,4,2,2,2,2,2,4,4(...TRUNCATED) | 0 | E | 0 | 0 | [
""
] | false | {
"nanos": 0,
"seconds": 2
} | 134,217,728 | |||
1366_A. Shovels and Swords | "Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED) | {
"input": [
"7\n1 1 2 2 3 3 3\n",
"10\n1 1 1 5 4 1 3 1 2 2\n",
"1\n1\n"
],
"output": [
"6\n",
"7\n",
"0\n"
]
} | {
"input": [],
"output": []
} | {"input":["314159\n1","25\n1","100\n2","314159\n3","999999999999999999999999999999999999999999999999(...TRUNCATED) | 2 | 8 | {"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,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(...TRUNCATED) | {
"language": [],
"solution": []
} | 805 | B | 1,000 | 800 | [
"dp"
] | false | {
"nanos": 0,
"seconds": 5
} | 512,000,000 |
End of preview. Expand in Data Studio
edition_3022_deepmind-code_contests-readymade
A Readymade by TheFactoryX
Original Dataset
Process
This dataset is a "readymade" - inspired by Marcel Duchamp's concept of taking everyday objects and recontextualizing them as art.
What we did:
- Selected the original dataset from Hugging Face
- Shuffled each column independently
- Destroyed all row-wise relationships
- Preserved structure, removed meaning
The result: Same data. Wrong order. New meaning. No meaning.
Purpose
This is art. This is not useful. This is the point.
Column relationships have been completely destroyed. The data maintains its types and values, but all semantic meaning has been removed.
Part of the Readymades project by TheFactoryX.
"I am a machine." — Andy Warhol
- Downloads last month
- 14