prefix large_stringlengths 5.19k 104k | response large_stringclasses 1
value | extra_info large_stringlengths 561 38.6M | data_source large_stringclasses 1
value |
|---|---|---|---|
<|im_start|>user
You are given n segments on a number line, numbered from 1 to n. The i-th segments covers all integer points from l_i to r_i and has a value w_i.
You are asked to select a subset of these segments (possibly, all of them). Once the subset is selected, it's possible to travel between two integer points ... | {"dataset": "taco", "tests": "{\"inputs\": [\"10 100000\\n1 49856 954208\\n98389 98970 222740\\n78151 99991 323776\\n63089 100000 263298\\n19955 99994 342017\\n27228 99998 310177\\n13398 98500 187599\\n95925 99993 643614\\n36475 99999 556166\\n1224 98485 55420\\n\", \"4 10\\n6 10 4\\n1 5 7\\n2 6 5\\n5 9 8\\n\", \"7 10\... | code_hard | |
<|im_start|>user
Solve the following coding problem using the programming language python:
Gas stations in the White Tiger service area have $ N $ lanes assigned numbers from $ 1 $ to $ N $. The first car in each lane can refuel.
Cars entering the gas station will choose the lane with the fewest cars in line and line... | {"dataset": "primeintellect", "tests": "[{\"type\": \"stdin_stdout\", \"input\": \"2 7\\n1 999\\n1 1000\\n0 2\\n1 1001\\n1 1002\\n0 1\\n0 1\", \"output\": \"1000\\n999\\n1002\"}, {\"type\": \"stdin_stdout\", \"input\": \"2 7\\n1 999\\n1 1000\\n0 2\\n1 1001\\n1 1002\\n0 1\\n1 1\", \"output\": \"1000\\n999\\n\"}, {\"type... | code_hard | |
<|im_start|>user
Ayush, Ashish and Vivek are busy preparing a new problem for the next Codeforces round and need help checking if their test cases are valid.
Each test case consists of an integer $n$ and two arrays $a$ and $b$, of size $n$. If after some (possibly zero) operations described below, array $a$ can be tra... | {"dataset": "taco", "tests": "{\"inputs\": [\"5\\n2\\n1 2\\n2 1\\n3\\n1 2 3\\n1 2 3\\n3\\n1 2 4\\n1 3 4\\n4\\n1 2 3 2\\n3 1 2 2\\n3\\n1 2 3\\n1 3 2\\n\", \"1\\n1\\n1\\n1\\n\", \"2\\n2\\n2 1\\n1 2\\n2\\n2 1\\n2 1\\n\", \"6\\n3\\n3 2 1\\n1 2 3\\n3\\n3 2 1\\n1 3 2\\n3\\n3 2 1\\n2 1 3\\n3\\n3 2 1\\n2 3 1\\n3\\n3 2 1\\n3 1 ... | code_hard | |
<|im_start|>user
Solve the following coding problem using the programming language python:
After a successful year of milk production, Farmer John is rewarding his cows with their favorite treat: tasty grass!
On the field, there is a row of n units of grass, each with a sweetness s_i. Farmer John has m cows, each wit... | {"dataset": "primeintellect", "tests": "[{\"type\": \"stdin_stdout\", \"input\": \"3 2\\n2 3 2\\n3 1\\n2 1\\n\", \"output\": \"2 4\"}, {\"type\": \"stdin_stdout\", \"input\": \"5 2\\n1 1 1 1 1\\n1 2\\n1 3\\n\", \"output\": \"2 2\"}, {\"type\": \"stdin_stdout\", \"input\": \"5 1\\n1 1 1 1 1\\n2 5\\n\", \"output\": \"0 1... | code_hard | |
"<|im_start|>user\nA queen is the strongest chess piece. In modern chess the queen can move any numb(...TRUNCATED) | "{\"dataset\": \"taco\", \"tests\": \"{\\\"inputs\\\": [\\\"10 10\\\\n6 5\\\\n3 5\\\\n3 4\\\\n6 10\\(...TRUNCATED) | code_hard | |
"<|im_start|>user\nI always thought that my old friend John was rather richer than he looked, but I (...TRUNCATED) | "{\"dataset\": \"taco\", \"tests\": \"{\\\"fn_name\\\": \\\"howmuch\\\", \\\"inputs\\\": [[1, 100], (...TRUNCATED) | code_hard | |
"<|im_start|>user\nYou have an array a with length n, you can perform operations. Each operation is (...TRUNCATED) | "{\"dataset\": \"taco\", \"tests\": \"{\\\"inputs\\\": [\\\"15\\\\n2 6 6 6 3 3 3 15 5 5 5 7 5 5 5\\\(...TRUNCATED) | code_hard | |
"<|im_start|>user\nSolve the following coding problem using the programming language python:\n\nBig (...TRUNCATED) | "{\"dataset\": \"primeintellect\", \"tests\": \"[{\\\"type\\\": \\\"stdin_stdout\\\", \\\"input\\\":(...TRUNCATED) | code_hard | |
"<|im_start|>user\nSolve the following coding problem using the programming language python:\n\nAs F(...TRUNCATED) | "{\"dataset\": \"primeintellect\", \"tests\": \"[{\\\"type\\\": \\\"stdin_stdout\\\", \\\"input\\\":(...TRUNCATED) | code_hard | |
"<|im_start|>user\nYou are planning to buy an apartment in a $n$-floor building. The floors are numb(...TRUNCATED) | "{\"dataset\": \"taco\", \"tests\": \"{\\\"inputs\\\": [\\\"10 2\\\\n7 6 18 6 16 18 1 17 17\\\\n6 9 (...TRUNCATED) | code_hard |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 30