prompt stringlengths 1.07k 1.07M | problem_id stringlengths 1 66 | source stringclasses 2
values | problem_path stringlengths 6 66 | responses listlengths 8 8 | score_unbounded listlengths 8 8 | score_bounded listlengths 8 8 | score_avg float64 0 100 |
|---|---|---|---|---|---|---|---|
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 ... | [
0,
4.916804333333333,
0,
0.4202396666666666,
81.23666666666666,
92.13034833333333,
4.874780666666667,
4.706684666666666
] | [
0,
4.916804333333333,
0,
0.4202396666666666,
81.23666666666666,
92.13034833333333,
4.874780666666667,
4.706684666666666
] | 23.535691 |
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 ... | [
16,
71.66666666666667,
null,
16,
71.66666666666667,
null,
null,
74.66666666666667
] | [
16,
71.66666666666667,
0,
16,
71.66666666666667,
0,
0,
74.66666666666667
] | 31.25 |
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 ... | [
58.88263333333333,
57.773599999999995,
58.923399999999994,
63.23736666666666,
0,
61.837733333333325,
58.88263333333333,
46.293299999999995
] | [
58.88263333333333,
57.773599999999995,
58.923399999999994,
63.23736666666666,
0,
61.837733333333325,
58.88263333333333,
46.293299999999995
] | 50.728833 |
"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) | [
null,
0,
0,
67.75999999999999,
65.74666666666667,
0,
0,
80.34
] | [
0,
0,
0,
67.75999999999999,
65.74666666666667,
0,
0,
80.34
] | 26.730833 |
"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) | [
58.79,
58.79,
58.79,
58.79,
0,
58.79,
58.79,
58.79
] | [
58.79,
58.79,
58.79,
58.79,
0,
58.79,
58.79,
58.79
] | 51.44125 |
"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) | [9.333333333333334,52.53333333333333,34.1,18.366666666666667,34.800000000000004,53.03333333333333,34(...TRUNCATED) | [9.333333333333334,52.53333333333333,34.1,18.366666666666667,34.800000000000004,53.03333333333333,34(...TRUNCATED) | 33.929167 |
"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) | [
null,
0,
null,
null,
26.666666666666668,
null,
null,
26.666666666666668
] | [
0,
0,
0,
0,
26.666666666666668,
0,
0,
26.666666666666668
] | 6.666667 |
"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) | [
33.300000000000004,
50,
50,
50,
50,
50,
50,
50
] | [
33.300000000000004,
50,
50,
50,
50,
50,
50,
50
] | 47.9125 |
"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) | [
265.12666666666667,
0,
0,
0,
0,
0,
0,
0
] | [
66.66666666666666,
0,
0,
0,
0,
0,
0,
0
] | 8.333333 |
"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) | [23.76,0.0,17.666666666666668,37.75333333333333,20.409999999999997,14.003333333333334,58.69666666666(...TRUNCATED) | [23.76,0.0,17.666666666666668,37.75333333333333,20.409999999999997,14.003333333333334,58.69666666666(...TRUNCATED) | 26.99625 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4