Dataset Viewer
Auto-converted to Parquet Duplicate
prompt
stringlengths
1.07k
1.07M
problem_id
stringlengths
1
66
source
stringclasses
2 values
problem_path
stringlengths
6
66
responses
listlengths
8
8
You are a competitive programmer. You will be given a problem statement, please implement a solution in C++. The execution time and memory limit are also stated in the statement so be aware of the complexity of the program. Please wrap the code in ```cpp and ``` so that it is properly formatted. Your response should ON...
110
algorithmic
algorithmic/110
[ "```cpp\n#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <ctime>\n\nusing namespace std;\n\nint grid[8][14];\nint best_grid[8][14];\nint best_score = 0;\n\nbool is_readable(int n) {\n string s = to_string(n);\n static bool reachable[2][8][14];\n int curr = 0;\n ...
You are a competitive programmer. You will be given a problem statement, please implement a solution in C++. The execution time and memory limit are also stated in the statement so be aware of the complexity of the program. Please wrap the code in ```cpp and ``` so that it is properly formatted. Your response should ON...
107
algorithmic
algorithmic/107
[ "```cpp\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef __int128_t int128;\n\n// Function to calculate all primes up to 1000\nvector<int> get_primes(int n) {\n vector<int> primes;\n vector<bool> is_prime(n + 1, true);\n ...
You are a competitive programmer. You will be given a problem statement, please implement a solution in C++. The execution time and memory limit are also stated in the statement so be aware of the complexity of the program. Please wrap the code in ```cpp and ``` so that it is properly formatted. Your response should ON...
45
algorithmic
algorithmic/45
[ "```cpp\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstdio>\n\nusing namespace std;\n\n// Fast I/O for reading integers\ninline int readInt() {\n int x = 0;\n char c = getchar();\n while (c < '0' || c > '9') {\n if (c == EOF) return -1;\n c = getchar();\n }\n ...
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
168
algorithmic
algorithmic/168
["depth[u]+1+MaxDist[v] \\le 10$ would then imply $depth[v] + 1 + 1 + MaxDist[v] \\le 10$, which is (...TRUNCATED)
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
137
algorithmic
algorithmic/137
["```cpp\n#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n/**\n(...TRUNCATED)
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
27
algorithmic
algorithmic/27
["```cpp\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n\nusing na(...TRUNCATED)
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
61
algorithmic
algorithmic/61
["```cpp\n#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nty(...TRUNCATED)
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
85
algorithmic
algorithmic/85
["```cpp\n#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n// Th(...TRUNCATED)
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
163
algorithmic
algorithmic/163
["```cpp\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <set>\n\nusing namespac(...TRUNCATED)
"You are a competitive programmer. You will be given a problem statement, please implement a solutio(...TRUNCATED)
152
algorithmic
algorithmic/152
["```cpp\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <(...TRUNCATED)
End of preview. Expand in Data Studio
README.md exists but content is empty.
Downloads last month
6