prompt stringlengths 1.07k 1.07M | problem_id stringlengths 1 66 | source stringclasses 2
values | problem_path stringlengths 6 66 | responses listlengths 1 8 | score_unbounded listlengths 1 8 | score_bounded listlengths 1 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 <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n const int R = 8, C = 14;\n vector<string> grid(R, string(C, '0'));\n int pos = 0;\n for (int r = 0; r < R; ++r) {\n if (r % 2 == 0) {\n for (int c = 0; c < C; ++c) {\n grid[r][c] = char('0' + (pos ... | [
4.832756333333333,
null,
4.832756333333333,
2.0776166666666667,
2.9326260000000004,
3.502285,
2.024744,
1.4905033333333333
] | [
4.832756333333333,
0,
4.832756333333333,
2.0776166666666667,
2.9326260000000004,
3.502285,
2.024744,
1.4905033333333333
] | 2.711661 |
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 <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n long long T;\n if (!(cin >> T)) return 0;\n for (long long tc = 0; tc < T; ++tc) {\n long long n;\n if (!(cin >> n)) return 0;\n long long orig = n;\n ... | [
0,
0,
0,
0,
0,
0,
0,
0
] | [
0,
0,
0,
0,
0,
0,
0,
0
] | 0 |
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 <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n long long n, m;\n int k;\n double eps;\n if (!(cin >> n >> m >> k >> eps)) return 0;\n // consume edges (no need to store)\n for (long long i = 0; i < m; ++i) {\n ... | [
10.181233333333333,
43.707366666666665,
10.181233333333333,
43.707366666666665,
43.707366666666665,
43.707366666666665,
43.707366666666665,
43.707366666666665
] | [
10.181233333333333,
43.707366666666665,
10.181233333333333,
43.707366666666665,
43.707366666666665,
43.707366666666665,
43.707366666666665,
43.707366666666665
] | 35.325833 |
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... | 168 | algorithmic | algorithmic/168 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n int N, M, H;\n if(!(cin >> N >> M >> H)) return 0;\n vector<int> A(N);\n for(int i=0;i<N;i++) cin >> A[i];\n for(int i=0;i<M;i++){\n int u,v; cin >> u >> v;\n }\n ... | [
0,
0,
0,
0,
0,
0,
0,
0
] | [
0,
0,
0,
0,
0,
0,
0,
0
] | 0 |
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... | 137 | algorithmic | algorithmic/137 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int n = 20, m = 20;\n vector<string> g(n, string(m, '0'));\n for (int i = 0; i < n; ++i) {\n if (i % 2 == 0) {\n for (int j = 0; j < m; ++j) g[i][j] = '1';\n } else {\n if (i % 4 == 1) g[i][m-1] = '1... | [
58.79,
0,
0,
0,
0,
0,
0,
0
] | [
58.79,
0,
0,
0,
0,
0,
0,
0
] | 7.34875 |
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... | 27 | algorithmic | algorithmic/27 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n long long n, m;\n if (!(cin >> n >> m)) return 0;\n long long k = n + m - 1;\n cout << k << '\\n';\n // All cells in row 1\n for (long long c = 1; c <= m; ++c) {\n ... | [
30.13333333333333,
0,
30.13333333333333,
35,
18.6,
30.13333333333333,
30.13333333333333,
30.13333333333333
] | [
30.13333333333333,
0,
30.13333333333333,
35,
18.6,
30.13333333333333,
30.13333333333333,
30.13333333333333
] | 25.533333 |
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... | 61 | algorithmic | algorithmic/61 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nusing int64 = long long;\nconst int64 NEG = (int64)(-9e18);\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n\n int T;\n if(!(cin>>T)) return 0;\n while(T--){\n int n,m;\n int64 c;\n cin>>n>>m>>c;\n ve... | [
0,
26.666666666666668,
0,
26.666666666666668,
26.666666666666668,
26.666666666666668,
26.666666666666668,
0
] | [
0,
26.666666666666668,
0,
26.666666666666668,
26.666666666666668,
26.666666666666668,
26.666666666666668,
0
] | 16.666667 |
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... | 85 | algorithmic | algorithmic/85 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n int initialDeep;\n if (!(cin >> initialDeep)) return 0;\n for (int i = 0; i < initialDeep; ++i) {\n if (i) cout << ' ';\n cout << 0;\n }\n cout << '\\n';\n re... | [
0,
0,
0,
0,
0,
0,
0,
0
] | [
0,
0,
0,
0,
0,
0,
0,
0
] | 0 |
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... | 163 | algorithmic | algorithmic/163 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n if (!(cin >> n >> m)) return 0;\n vector<vector<int>> a(n, vector<int>(n));\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < n; ++j)\n cin >> ... | [
0,
0,
0,
0,
0,
0,
13.973333333333334,
0
] | [
0,
0,
0,
0,
0,
0,
13.973333333333334,
0
] | 1.746667 |
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... | 152 | algorithmic | algorithmic/152 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n vector<int> a(1000), b(1000), c(1000), d(1000);\n for(int i=0;i<1000;i++){\n if(!(cin>>a[i]>>b[i]>>c[i]>>d[i])) return 0;\n }\n int m = 50;\n cout << m;\n for(int ... | [
0,
0,
0,
0,
0,
0,
null,
0
] | [
0,
0,
0,
0,
0,
0,
0,
0
] | 0 |
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... | 159 | algorithmic | algorithmic/159 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N, M;\n if (!(cin >> N >> M)) return 0;\n for (int i = 0; i < M; ++i) {\n int x, y;\n cin >> x >> y;\n }\n cout << 0 << \"\\n\";\n return 0;\n}\n```",
... | [
0,
0,
3.1938216666666666,
0,
0,
0,
0,
0
] | [
0,
0,
3.1938216666666666,
0,
0,
0,
0,
0
] | 0.399228 |
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... | 73 | algorithmic | algorithmic/73 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n if (!(cin >> n)) return 0;\n vector<vector<int>> inv(n+2, vector<int>(n+2, 0));\n long long m = 1LL * n * (n-1) / 2;\n for (int l = 1; l <= n-1; ++l) {\n fo... | [
0,
0,
0,
0,
0,
0,
0,
0
] | [
0,
0,
0,
0,
0,
0,
0,
0
] | 0 |
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... | 79 | algorithmic | algorithmic/79 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n vector<unsigned long long> v;\n unsigned long long x;\n while ( (cin >> x) ) v.push_back(x);\n if (v.empty()) return 0;\n // If at least two numbers are provided, assume on... | [
0,
0,
0,
0,
0,
0,
0,
0
] | [
0,
0,
0,
0,
0,
0,
0,
0
] | 0 |
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... | 174 | algorithmic | algorithmic/174 | [
"```cpp\n#include <bits/stdc++.h>\nusing namespace std;\nusing clk = chrono::steady_clock;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n\n int n, m;\n if (!(cin >> n >> m)) return 0;\n vector<vector<int>> adj(n);\n for (int i = 0; i < m; ++i) {\n int u, v;\n cin >... | [
33.33333333333333,
94.3526,
93.75573333333334,
92.2406,
94.81173333333332,
94.8347,
94.60513333333333,
93.02113333333332
] | [
33.33333333333333,
94.3526,
93.75573333333334,
92.2406,
94.81173333333332,
94.8347,
94.60513333333333,
93.02113333333332
] | 86.369371 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4