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 | untranslated_description
stringclasses 36
values | time_limit
dict | memory_limit_bytes
int64 0
1.07B
| input_file
stringclasses 1
value | output_file
stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1088_D. Ehab and another another xor problem
| "Princess Heidi decided to give orders to all her K Rebel ship commanders in person. Unfortunately, (...TRUNCATED)
|
{
"input": [
"5 5 10\n1 2 4 8 16\n",
"3 4 11\n1 2 3 4\n"
],
"output": [
"7\n",
"6\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["5 6\n3 1 2 6\n3 1 2 6\n1 1\n2 3 6\n3 1 5 6\n","5 7\n2 6 7\n5 1 1 1 1 1\n3 6 5 5\n0\n4 4 3(...TRUNCATED)
| 2
| 7
| {"language":[2,2,2,3,4,2,4,4,4,2,2,4,4,4,2,2,2,2,4,2,2,2,4,3,4,2,4,2,2,2,3,2,2,4,2,4,4,2,4,4,2,3,2,2(...TRUNCATED)
| {"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)
| 760
|
B
| 0
| 0
|
[
"greedy",
"two pointers"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
p03612 AtCoder Beginner Contest 072 - Derangement
| "A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang (...TRUNCATED)
| {"input":["3 8 41\n1 3 2\n1 6 4 3 5 7 2 8\n","1 2 31\n1\n1 2\n","4 2 4\n4 2 3 1\n2 1\n"],"output":["(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["4\n1 1 1 1 1 1 1 1 1 1 1 1 3 3 6 3\n","1\n53\n","1\n77\n","1\n20\n","1\n10\n","1\n11\n","(...TRUNCATED)
| 5
| 0
| {"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,4,2,2,2,2,2,2,2,2,2,4,4,2,2(...TRUNCATED)
| {"language":[4,2,2,3,2,4,4,2,2,2,2,4,4,2,2,2,4,2,2,3,3,2,3,2,4,4,2,2,3,4,2,2,3,4,2,2,2,2,1,4,2,4,2,4(...TRUNCATED)
| 0
| 0
| 0
|
[
"bitmasks",
"brute force",
"dp",
"math"
] | false
| null | 256,000,000
| ||||
977_B. Two-gram
| "Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...TRUNCATED)
|
{
"input": [
"5 1",
"4 972439611840",
"3 24",
"1 111"
],
"output": [
"1",
"206",
"2",
"111"
]
}
|
{
"input": [],
"output": []
}
| {"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED)
| 2
| 11
| {"language":[1,4,2,3,2,2,2,4,1,2,1,3,1,2,3,3,2,4,3,3,2,2,3,4,4,4,2,1,3,3,2,2,4,1,3,2,3,3,2,4,4,3,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,3,2,2,2,2,2,2,2(...TRUNCATED)
| 0
| 750
| 1,600
|
[
""
] | false
|
{
"nanos": 525000000,
"seconds": 2
}
| 256,000,000
| ||||
mind-palaces-3
| "Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)
| {"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)
| {"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)
| {"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,2,1,4,2,2(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
|
C
| 0
| 900
|
[
"constructive algorithms",
"greedy",
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 134,217,728
| |||
1199_E. Matching vs Independent Set
| "You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...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":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 425744418\n","5\n0 51690939\n0 6(...TRUNCATED)
| {"input":["8 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","7 3\n3 2\n2 1\n1 4\n(...TRUNCATED)
| 6
| 9
| {"language":[3,2,3,3,3,2,2,2,3,4,4,3,3,3,3,4,3,3,3,4,2,3,2,3,3,3,3,4,3,3,4,3,4,3,3,3,3,3,3,3,2,3,3,3(...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)
| 9
| 0
| 1,800
|
[
"implementation"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| ||||
851_B. Arpa and an exam about geometry
| "One day n friends gathered together to play \"Mafia\". During each round of the game some player mu(...TRUNCATED)
| {"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)
|
{
"input": [],
"output": []
}
| {"input":["3\n2\n4\n10","3\n2\n6\n12","3\n4\n6\n12","3\n4\n6\n19","3\n2\n4\n19","3\n2\n3\n12","3\n4\(...TRUNCATED)
| 2
| 0
| {"language":[2,2,2,1,2,3,2,4,2,4,4,4,2,4,2,4,2,2,2,2,4,2,4,3,2,4,2,2,4,4,2,4,3,4,3,2,4,4,1,4,3,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],"sol(...TRUNCATED)
| 0
|
B
| 500
| 0
|
[
"dsu",
"graphs",
"shortest paths",
"sortings"
] | false
| null | 256,000,000
| |||
83_C. Track
| "Bessie and the cows have recently been playing with \"cool\" sequences and are trying to construct (...TRUNCATED)
|
{
"input": [
"4 1\n1 2 3 4\n1 3\n\nSAMPLE"
],
"output": [
"6 0\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1","3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n(...TRUNCATED)
| 3
| 2
| {"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,3,3(...TRUNCATED)
|
{
"language": [],
"solution": []
}
| 0
| 0
| 0
|
[] | false
|
{
"nanos": 0,
"seconds": 4
}
| 0
| ||||
730_G. Car Repair Shop
| "You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclu(...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": [],
"output": []
}
| {"input":["1 0\n1 1 0\n1 446844829 1905225 780837560\n1 754808995 539371459\n","6 7\n1 2\n2 3\n3 4\n(...TRUNCATED)
| 2
| 8
| {"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...TRUNCATED)
| {"language":[2,2,2,2,2,2,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,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED)
| 277
| 0
| 1,500
|
[
"dfs and similar",
"graphs",
"probabilities",
"trees"
] | false
|
{
"nanos": 0,
"seconds": 1
}
| 0
| ||||
1195_D2. Submarine in the Rybinsk Sea (hard edition)
| "Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)
|
{
"input": [
"3\n6 4 1\n",
"4\n20 6 3 4\n"
],
"output": [
"0\n",
"2\n"
]
}
| {"input":["541\n54 98 68 63 83 94 55 35 12 63 30 17 97 62 96 26 63 76 91 19 52 42 55 95 8 97 6 18 96(...TRUNCATED)
| {"input":["140303299577\n","192582416360\n","628664286016\n","65109088632\n","414153533126\n","18263(...TRUNCATED)
| 2
| 0
| {"language":[3,4,3,3,3,2,3,3,1,3,3,2,2,2,1,3,4,2,3,3,2,3,3,3,3,3,3,2,3,3,4,3,1,4,3,3,3,3,4,3,3,3,3,3(...TRUNCATED)
| {"language":[2,2,1,4,3,3,3,2,4,2,2,3,3,4,4,4,3,3,3,3,4,2,3,2,3,2,2,2,2,3,3,1,4,4,3,2,2,4,4,3,2,3,2,2(...TRUNCATED)
| 662
|
D
| 0
| 1,900
|
[
"bitmasks",
"dp",
"graphs",
"trees"
] | false
|
{
"nanos": 0,
"seconds": 2
}
| 256,000,000
| |||
new-world-11
| "The bear decided to store some raspberry for the winter. He cunningly found out the price for a bar(...TRUNCATED)
|
{
"input": [
"2\n",
"3+2+1\n",
"1+1+3+1+3\n"
],
"output": [
"2\n",
"1+2+3\n",
"1+1+1+3+3\n"
]
}
|
{
"input": [],
"output": []
}
| {"input":["10\ntypedef errtype** ucywcaykzh\ntypeof &ucywcaykzh*********\ntypedef &&&&&&void********(...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],"solution":["#include (...TRUNCATED)
| {"language":[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,2,2,2,2,2(...TRUNCATED)
| 0
|
E
| 0
| 1,500
|
[
""
] | false
|
{
"nanos": 0,
"seconds": 3
}
| 32,000,000
|
End of preview. Expand
in Data Studio
edition_2493_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
- 20