category stringclasses 1
value | license stringclasses 1
value | reasoning stringclasses 1
value | generator stringclasses 1
value | used_in_training stringclasses 1
value | version stringclasses 1
value | system_prompt stringclasses 1
value | conversations listlengths 2 2 |
|---|---|---|---|---|---|---|---|
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [
{
"from": "user",
"value": "Polar bears like unique arrays — that is, arrays without repeated elements.\n\nYou have got a unique array s with length n containing non-negative integers. Since you are good friends with Alice and Bob, you decide to split the array in two. Precisely, you need to construct two a... |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [
{
"from": "user",
"value": "Furlo and Rublo play a game. The table has n piles of coins lying on it, the i-th pile has ai coins. Furlo and Rublo move in turns, Furlo moves first. In one move you are allowed to:\n\n * choose some pile, let's denote the current number of coins in it as x; \n * choose some i... |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [
{
"from": "user",
"value": "A plane contains a not necessarily convex polygon without self-intersections, consisting of n vertexes, numbered from 1 to n. There is a spider sitting on the border of the polygon, the spider can move like that:\n\n 1. Transfer. The spider moves from the point p1 with coordinat... |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [
{
"from": "user",
"value": "Today is Devu's birthday. For celebrating the occasion, he bought n sweets from the nearby market. He has invited his f friends. He would like to distribute the sweets among them. As he is a nice guy and the occasion is great, he doesn't want any friend to be sad, so he would ens... |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [{"from":"user","value":"As everyone knows, bears love fish. But Mike is a strange bear; He hates fi(...TRUNCATED) |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [{"from":"user","value":"Julia is conducting an experiment in her lab. She placed several luminescen(...TRUNCATED) |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [{"from":"user","value":"You are given a directed graph G with n vertices and m arcs (multiple arcs (...TRUNCATED) |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [{"from":"user","value":"Once Bob saw a string. It contained so many different letters, that the let(...TRUNCATED) |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [{"from":"user","value":"You have matrix a of size n × n. Let's number the rows of the matrix from (...TRUNCATED) |
code | cc-by-4.0 | on | DeepSeek-R1 | Ultra, Nano | v1.1 | detailed thinking on | [{"from":"user","value":"You are given an infinite periodic array a0, a1, ..., an - 1, ... with the (...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 8