DivAlgo: A systematic evaluation of algorithmic diversity for code generation models
Paper • 2610.19157 • Published
Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed
Error code: DatasetGenerationError
Exception: CastError
Message: Couldn't cast
inst_id: string
sample: int64
correct: bool
compile_ok: bool
n_passed: int64
n_testcases_used: int64
n_completed: int64
n_timeout: int64
n_runtime_err: int64
time_ms_median: double
memory_mb_max: double
code: string
to
{'inst_id': Value('string'), 'sample': Value('int64'), 'code': Value('string'), 'compile_ok': Value('bool'), 'n_passed': Value('int64'), 'n_testcases_used': Value('int64'), 'n_completed': Value('int64'), 'n_timeout': Value('int64'), 'n_runtime_err': Value('int64'), 'time_ms_median': Value('float64'), 'memory_mb_max': Value('float64')}
because column names don't match
Traceback: Traceback (most recent call last):
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1835, in _prepare_split_single
for key, table in generator:
^^^^^^^^^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 621, in wrapped
for item in generator(*args, **kwargs):
~~~~~~~~~^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 361, in _generate_tables
self._cast_table(pa_table, json_field_paths=json_field_paths),
~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/packaged_modules/json/json.py", line 132, in _cast_table
pa_table = table_cast(pa_table, self.info.features.arrow_schema)
File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2381, in table_cast
return cast_table_to_schema(table, schema)
File "/usr/local/lib/python3.14/site-packages/datasets/table.py", line 2309, in cast_table_to_schema
raise CastError(
...<3 lines>...
)
datasets.table.CastError: Couldn't cast
inst_id: string
sample: int64
correct: bool
compile_ok: bool
n_passed: int64
n_testcases_used: int64
n_completed: int64
n_timeout: int64
n_runtime_err: int64
time_ms_median: double
memory_mb_max: double
code: string
to
{'inst_id': Value('string'), 'sample': Value('int64'), 'code': Value('string'), 'compile_ok': Value('bool'), 'n_passed': Value('int64'), 'n_testcases_used': Value('int64'), 'n_completed': Value('int64'), 'n_timeout': Value('int64'), 'n_runtime_err': Value('int64'), 'time_ms_median': Value('float64'), 'memory_mb_max': Value('float64')}
because column names don't match
The above exception was the direct cause of the following exception:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1379, in compute_config_parquet_and_info_response
parquet_operations, partial, estimated_dataset_info = stream_convert_to_parquet(
~~~~~~~~~~~~~~~~~~~~~~~~~^
builder, max_dataset_size_bytes=max_dataset_size_bytes
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
)
^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 956, in stream_convert_to_parquet
builder._prepare_split(split_generator=splits_generators[split], file_format="parquet")
~~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1702, in _prepare_split
for job_id, done, content in self._prepare_split_single(
~~~~~~~~~~~~~~~~~~~~~~~~~~^
gen_kwargs=gen_kwargs, job_id=job_id, **_prepare_split_args
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
):
^
File "/usr/local/lib/python3.14/site-packages/datasets/builder.py", line 1887, in _prepare_split_single
raise DatasetGenerationError("An error occurred while generating the dataset") from e
datasets.exceptions.DatasetGenerationError: An error occurred while generating the datasetNeed help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
inst_id string | sample int64 | code string | compile_ok bool | n_passed int64 | n_testcases_used int64 | n_completed int64 | n_timeout int64 | n_runtime_err int64 | time_ms_median float64 | memory_mb_max float64 |
|---|---|---|---|---|---|---|---|---|---|---|
1000_A | 0 | #include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<string> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
... | true | 15 | 15 | 15 | 0 | 0 | 66.755295 | 2.355469 |
1000_A | 4 | #include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<string> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
... | true | 15 | 15 | 15 | 0 | 0 | 55.852175 | 1.535156 |
1000_A | 6 | #include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<std::string> a(n);
std::vector<std::string> b(n);
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
}
for (int i = 0; i < n; ++i) {
std::cin >> b[... | true | 15 | 15 | 15 | 0 | 0 | 54.009676 | 1.277344 |
1000_A | 18 | #include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
unordered_map<strin... | true | 15 | 15 | 15 | 0 | 0 | 55.216074 | 1.890625 |
1000_A | 19 | #include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
unordered_map<string, int> previous_sizes;
for (int i = 0; i < n; i++) {
string size;
cin >> size;
previous_sizes[size]++;
}
unordered_m... | true | 15 | 15 | 15 | 0 | 0 | 61.269045 | 1.535156 |
1000_A | 32 | #include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<string> b(n);
for (int i = 0; i < n; i++) {
ci... | true | 15 | 15 | 15 | 0 | 0 | 55.82118 | 1.53125 |
1000_A | 48 | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
vector<string> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
map<stri... | true | 15 | 15 | 15 | 0 | 0 | 62.695265 | 1.707031 |
1000_F | 12 | #include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n, q, l, r;
std::cin >> n;
std::vector<int> arr(n);
for (int i = 0; i < n; ++i) {
std::cin >> arr[i];
}
std::cin >> q;
for (int i = 0; i < q; ++i) {
std::cin >> l >> r;
std::vector<int> subar... | true | 15 | 15 | 15 | 0 | 0 | 74.404001 | 3.316406 |
1000_F | 18 | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n, q;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
cin >> q;
unordered_map<int, int> count;
for (int i = 0; i < q; ++i) {
int l, r;
... | true | 15 | 15 | 15 | 0 | 0 | 62.959909 | 1.167969 |
1000_F | 24 | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n, q, l, r;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >> q;
vector<int> ans(q);
for (int i = 0; i < q; i++) {
cin >> l >> r;
u... | true | 15 | 15 | 15 | 0 | 0 | 67.934036 | 1.277344 |
1000_F | 26 | #include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int n, q;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
cin >> q;
for (int i = 0; i < q; ++i) {
int l, r;
cin >> l >> r;
unordered_ma... | true | 15 | 15 | 15 | 0 | 0 | 60.231924 | 1.292969 |
1000_F | 27 | #include <iostream>
#include <vector>
#include <unordered_map>
int main() {
int n, q, l, r, ans;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; ++i) {
std::cin >> a[i];
}
std::cin >> q;
for (int i = 0; i < q; ++i) {
std::cin >> l >> r;
std::unordered_ma... | true | 15 | 15 | 15 | 0 | 0 | 66.501856 | 0.765625 |
1030_A | 0 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int response;
std::cin >> response;
hard |= response;
}
std::cout << (hard ? "HARD" : "EASY") << std::endl;
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 55.295706 | 1.46875 |
1030_A | 1 | #include <iostream>
int main() {
int n;
std::cin >> n;
int count = 0;
int i = 0;
while (i < n) {
int response;
std::cin >> response;
if (response == 1) {
count++;
}
i++;
}
if (count == 0) {
std::cout << "EASY" << std::endl;
... | true | 15 | 15 | 15 | 0 | 0 | 55.397034 | 1.597656 |
1030_A | 2 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
if (response == 1) {
count++;
}
}
if (count > 0) {
cout << "HARD" << endl;
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 61.317921 | 1.59375 |
1030_A | 3 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int easy = 0;
int hard = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
if (response == 0) {
easy++;
} else {
hard++;
}
}
if (easy == n) {... | true | 15 | 15 | 15 | 0 | 0 | 61.300039 | 1.28125 |
1030_A | 4 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int opinion;
cin >> opinion;
if (opinion == 1) {
hard = 1;
break;
}
}
if (hard) {
cout << "HARD" << endl;
} els... | true | 15 | 15 | 15 | 0 | 0 | 54.873943 | 1.59375 |
1030_A | 5 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hardCount = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
if (response == 1) {
hardCount++;
}
}
if (hardCount == 0) {
cout << "EASY";
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 65.904379 | 1.289063 |
1030_A | 6 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy_count = 0, hard_count = 0;
for (int i = 0; i < n; i++) {
int opinion;
std::cin >> opinion;
if (opinion == 0) {
easy_count++;
} else {
hard_count++;
}
}
if (hard_cou... | true | 15 | 15 | 15 | 0 | 0 | 55.52268 | 1.707031 |
1030_A | 7 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int responses[n];
for (int i = 0; i < n; i++) {
cin >> responses[i];
}
bool isHard = false;
for (int i = 0; i < n; i++) {
if (responses[i] == 1) {
isHard = true;
break;
... | true | 15 | 15 | 15 | 0 | 0 | 57.486296 | 1.46875 |
1030_A | 8 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy_count = 0;
for (int i = 0; i < n; ++i) {
int response;
std::cin >> response;
if (response == 0) {
++easy_count;
}
}
if (easy_count == n) {
std::cout << "EASY";
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 55.977583 | 1.707031 |
1030_A | 9 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int answer;
cin >> answer;
if (answer == 1) {
hard = 1;
break;
}
}
if (hard) {
cout << "HARD" << endl;
} else {... | true | 15 | 15 | 15 | 0 | 0 | 56.322813 | 1.597656 |
1030_A | 10 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int ans;
cin >> ans;
hard |= ans;
}
cout << (hard ? "HARD" : "EASY") << endl;
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 56.554317 | 1.597656 |
1030_A | 11 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hardCount = 0;
for (int i = 0; i < n; ++i) {
int opinion;
std::cin >> opinion;
if (opinion == 1) {
++hardCount;
}
}
if (hardCount > 0) {
std::cout << "HARD\n";
} else {
s... | true | 15 | 15 | 15 | 0 | 0 | 65.388203 | 1.535156 |
1030_A | 12 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard_count = 0;
for (int i = 0; i < n; i++) {
int opinion;
cin >> opinion;
if (opinion == 1) {
hard_count++;
}
}
if (hard_count > 0) {
cout << "HARD" << endl;
} el... | true | 15 | 15 | 15 | 0 | 0 | 56.097984 | 1.535156 |
1030_A | 13 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int easy = 0;
int hard = 0;
for (int i = 0; i < n; i++) {
int answer;
cin >> answer;
if (answer == 0) {
easy++;
} else {
hard++;
}
}
if (hard > 0) {
... | true | 15 | 15 | 15 | 0 | 0 | 55.889368 | 1.019531 |
1030_A | 14 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy = 0, hard = 0;
for (int i = 0; i < n; i++) {
int opinion;
std::cin >> opinion;
if (opinion == 0) {
easy++;
} else {
hard++;
}
}
if (hard > 0) {
std::cout << ... | true | 15 | 15 | 15 | 0 | 0 | 54.240704 | 1.53125 |
1030_A | 15 | #include <iostream>
int main() {
int n;
std::cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int input;
std::cin >> input;
if (input == 1) {
count++;
}
}
if (count == 0) {
std::cout << "EASY" << std::endl;
} else {
std::cout... | true | 15 | 15 | 15 | 0 | 0 | 55.000782 | 1.277344 |
1030_A | 16 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
hard |= response;
}
cout << (hard ? "HARD" : "EASY");
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 55.029869 | 1.53125 |
1030_A | 17 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard_count = 0;
for (int i = 0; i < n; i++) {
int opinion;
cin >> opinion;
if (opinion == 1) {
hard_count++;
}
}
if (hard_count > 0) {
cout << "HARD";
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 65.202951 | 1.535156 |
1030_A | 18 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy = 0;
for (int i = 0; i < n; ++i) {
int response;
std::cin >> response;
if (response == 0) {
++easy;
}
}
if (easy == n) {
std::cout << "EASY" << std::endl;
} else {
std... | true | 15 | 15 | 15 | 0 | 0 | 55.682898 | 1.214844 |
1030_A | 19 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; ++i) {
int response;
std::cin >> response;
if (response == 1) {
hard = 1;
break;
}
}
std::string output = (hard ? "HARD" : "EASY");
std::cout... | true | 15 | 15 | 15 | 0 | 0 | 57.74045 | 1.59375 |
1030_A | 20 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; ++i) {
int response;
std::cin >> response;
if (response == 1) {
hard = 1;
break;
}
}
std::cout << (hard ? "HARD" : "EASY") << std::endl;
ret... | true | 15 | 15 | 15 | 0 | 0 | 56.905985 | 1.535156 |
1030_A | 21 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> responses(n);
for (int i = 0; i < n; i++) {
cin >> responses[i];
}
bool easy = true;
for (int i = 0; i < n; i++) {
if (responses[i] == 1) {
easy = false;
... | true | 15 | 15 | 15 | 0 | 0 | 57.607174 | 1.703125 |
1030_A | 22 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easyCount = 0;
for (int i = 0; i < n; ++i) {
int opinion;
std::cin >> opinion;
if (opinion == 0) {
easyCount++;
}
}
std::cout << (easyCount == n ? "EASY" : "HARD") << std::endl;
return ... | true | 15 | 15 | 15 | 0 | 0 | 55.799007 | 1.535156 |
1030_A | 23 | #include <iostream>
int main() {
int n;
std::cin >> n;
int count = 0;
for (int i = 0; i < n; ++i) {
int answer;
std::cin >> answer;
if (answer == 1) {
count++;
}
}
if (count == 0) {
std::cout << "EASY" << std::endl;
} else {
std:... | true | 15 | 15 | 15 | 0 | 0 | 63.579082 | 1.015625 |
1030_A | 24 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int opinion;
std::cin >> opinion;
hard |= opinion;
}
std::cout << (hard ? "HARD" : "EASY") << std::endl;
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 55.536032 | 1.269531 |
1030_A | 25 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard_count = 0;
for (int i = 0; i < n; i++) {
int opinion;
std::cin >> opinion;
hard_count += opinion;
}
std::cout << (hard_count > 0 ? "HARD" : "EASY") << std::endl;
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 65.018415 | 1.472656 |
1030_A | 26 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hardCount = 0;
for (int i = 0; i < n; i++) {
int opinion;
cin >> opinion;
if (opinion == 1) {
hardCount++;
}
}
if (hardCount > 0) {
cout << "HARD";
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 58.040619 | 1.144531 |
1030_A | 28 | #include <iostream>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
string responses[n];
for (int i = 0; i < n; i++) {
cin >> responses[i];
}
int hardCount = 0;
for (int i = 0; i < n; i++) {
if (responses[i] == "1") {
hardCount++;
}
... | true | 15 | 15 | 15 | 0 | 0 | 57.071447 | 1.421875 |
1030_A | 29 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> answers(n);
for (int i = 0; i < n; i++) {
cin >> answers[i];
}
int hard_answers = 0;
for (int answer : answers) {
if (answer == 1) {
hard_answers++;
}
... | true | 15 | 15 | 15 | 0 | 0 | 55.856705 | 1.265625 |
1030_A | 31 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; ++i) {
int response;
cin >> response;
hard |= response;
}
if (hard) {
cout << "HARD";
} else {
cout << "EASY";
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 66.949844 | 1.46875 |
1030_A | 32 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hardCount = 0;
for (int i = 0; i < n; i++) {
int opinion;
std::cin >> opinion;
if (opinion == 1) {
hardCount++;
}
}
if (hardCount == 0) {
std::cout << "EASY";
} else {
st... | true | 15 | 15 | 15 | 0 | 0 | 59.564114 | 1.46875 |
1030_A | 34 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
if (response == 1) {
count++;
}
}
if (count == 0) {
cout << "EASY";
} else {
cout ... | true | 15 | 15 | 15 | 0 | 0 | 55.611849 | 1.53125 |
1030_A | 35 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; ++i) {
int response;
cin >> response;
hard |= response;
}
if (hard) {
cout << "HARD";
} else {
cout << "EASY";
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 57.4193 | 1.53125 |
1030_A | 36 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
if (response == 1) {
hard++;
}
}
if (hard > 0) {
cout << "HARD" << endl;
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 64.892292 | 1.46875 |
1030_A | 37 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int answer;
std::cin >> answer;
if (answer == 1) {
hard = 1;
}
}
if (hard == 0) {
std::cout << "EASY";
} else {
std::cout << "HARD... | true | 15 | 15 | 15 | 0 | 0 | 55.983543 | 1.46875 |
1030_A | 39 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; i++) {
int response;
std::cin >> response;
if (response == 1) {
hard = 1;
break;
}
}
if (hard) {
std::cout << "HARD";
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 55.910349 | 1.214844 |
1030_A | 40 | #include <iostream>
int main() {
int n;
std::cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
int x;
std::cin >> x;
sum += x;
}
if (sum == 0) {
std::cout << "EASY" << std::endl;
} else {
std::cout << "HARD" << std::endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 56.759119 | 1.59375 |
1030_A | 41 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hardCount = 0;
for (int i = 0; i < n; i++) {
int response;
std::cin >> response;
if (response == 1) {
hardCount++;
}
}
if (hardCount == 0) {
std::cout << "EASY";
} else {
s... | true | 15 | 15 | 15 | 0 | 0 | 54.985523 | 1.53125 |
1030_A | 42 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy = 0;
for (int i = 0; i < n; ++i) {
int opinion;
std::cin >> opinion;
if (opinion == 0) {
easy++;
}
}
if (easy == n) {
std::cout << "EASY";
} else {
std::cout << "HAR... | true | 15 | 15 | 15 | 0 | 0 | 55.738688 | 1.347656 |
1030_A | 44 | #include <iostream>
int main() {
int n;
std::cin >> n;
int hard = 0;
for (int i = 0; i < n; ++i) {
int response;
std::cin >> response;
hard |= response;
}
if (hard == 0) {
std::cout << "EASY" << std::endl;
} else {
std::cout << "HARD" << std::endl;
... | true | 15 | 15 | 15 | 0 | 0 | 61.449051 | 1.28125 |
1030_A | 45 | #include <iostream>
int main() {
int n;
std::cin >> n;
bool isHard = false;
for (int i = 0; i < n; i++) {
int opinion;
std::cin >> opinion;
if (opinion == 1) {
isHard = true;
break;
}
}
if (isHard) {
std::cout << "HARD";
} el... | true | 15 | 15 | 15 | 0 | 0 | 59.583426 | 1.535156 |
1030_A | 46 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy_count = 0;
for (int i = 0; i < n; ++i) {
int response;
std::cin >> response;
if (response == 0) {
++easy_count;
}
}
if (easy_count == n) {
std::cout << "EASY";
} else {
... | true | 15 | 15 | 15 | 0 | 0 | 61.286926 | 1.472656 |
1030_A | 47 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
sum += response;
}
if (sum == 0) {
cout << "EASY";
} else {
cout << "HARD";
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 54.977894 | 1.59375 |
1030_A | 48 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bool isHard = false;
for (int i = 0; i < n; i++) {
int response;
cin >> response;
isHard = isHard || response;
}
cout << (isHard ? "HARD" : "EASY") << endl;
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 56.049824 | 1.46875 |
1030_A | 49 | #include <iostream>
int main() {
int n;
std::cin >> n;
int easy = 0;
int hard = 0;
for (int i = 0; i < n; i++) {
int response;
std::cin >> response;
if (response == 0) {
easy++;
} else {
hard++;
}
}
if (easy == n) {
std... | true | 15 | 15 | 15 | 0 | 0 | 56.422234 | 1.464844 |
1062_F | 15 | #include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<unordered_set<int>> graph(n);
for (int i = 0; i < m; ++i) {
int u, v;
cin >> u >> v;
graph[u - 1].insert(v - 1);
graph[v - 1].insert(u - 1);... | true | 15 | 15 | 15 | 0 | 0 | 73.437452 | 29.375 |
1062_F | 22 | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<set<int>> graph(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
graph[u - 1].insert(v - 1);
graph[v - 1].insert(u - 1);
}
int impo... | true | 15 | 15 | 15 | 0 | 0 | 63.770056 | 21.542969 |
1062_F | 43 | #include <iostream>
#include <vector>
#include <unordered_set>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<std::unordered_set<int>> graph(n + 1);
for (int i = 0; i < m; ++i) {
int u, v;
std::cin >> u >> v;
graph[u].insert(v);
graph[v].insert(u);
}
in... | true | 15 | 15 | 15 | 0 | 0 | 57.075977 | 28.152344 |
1070_M | 6 | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
struct City {
int x, y;
};
struct Freeway {
int from, to;
};
bool canBuildFreeway(const vector<City>& algoland, const vector<City>& berland, const Freeway& f) {
for (const auto& city : algoland) {
if (f.to == city.x && f... | true | 15 | 15 | 15 | 0 | 0 | 61.581373 | 3.292969 |
1070_M | 30 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b;
cin >> a >> b;
vector<int> r(b);
for (int i = 0; i < b; i++) {
cin >> r[i];
}
vector<pair<int, ... | true | 15 | 15 | 15 | 0 | 0 | 54.405212 | 1.410156 |
1070_M | 31 | #include <iostream>
#include <vector>
#include <cmath>
using namespace std;
// Structure to represent a point
struct Point {
int x;
int y;
};
// Structure to represent a line segment
struct LineSegment {
Point p1;
Point p2;
};
// Function to check if two points are equal
bool pointsEqual(Point p1, P... | true | 15 | 15 | 15 | 0 | 0 | 56.337833 | 0.816406 |
1070_M | 35 | #include <iostream>
#include <vector>
#include <algorithm>
struct City {
int x, y;
bool is_berland;
};
using namespace std;
bool is_valid(const vector<City>& cities) {
for (int i = 0; i < cities.size() - 1; ++i) {
for (int j = i + 1; j < cities.size(); ++j) {
if (cities[i].x == cities... | true | 15 | 15 | 15 | 0 | 0 | 56.886196 | 1.472656 |
1090_D | 0 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<pair<int, int>> pairs(m);
for (int i = 0; i < m; ++i) {
int a_i, b_i;
cin >> ... | true | 15 | 15 | 15 | 0 | 0 | 66.1273 | 3.277344 |
1090_D | 1 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pairs(m);
for (int i = 0; i < m; i++) {
cin >> pairs[i].first >> pairs[i].second;
}
vector<int> arr1(n), arr2(n);
for (int i = 0; i < n; i++... | true | 15 | 15 | 15 | 0 | 0 | 56.332111 | 1.53125 |
1090_D | 2 | #include <iostream>
#include <vector>
#include <set>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
a[i] = i + 1;
}
vector<pair<int, int>> pairs(m);
for (int i = 0; i < m; ++i) {
cin >> pairs[i].first >> pairs[i]... | true | 15 | 15 | 15 | 0 | 0 | 66.781282 | 1.53125 |
1090_D | 4 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> comparisons(m);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
comparisons[i] = make_pair(a, b);
}
vector<int> ... | true | 15 | 15 | 15 | 0 | 0 | 68.451405 | 1.105469 |
1090_D | 7 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> arr1(n), arr2(n);
vector<pair<int, int>> pairs(m);
for (int i = 0; i < m; i++) {
cin >> pairs[i].first >> pairs[i].second;
}
for (int i = 0; i < n; i++) ... | true | 15 | 15 | 15 | 0 | 0 | 70.858479 | 0.832031 |
1090_D | 10 | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> pairs(m, vector<int>(2));
for (int i = 0; i < m; ++i) {
cin >> pairs[i][0] >> pairs[i][1];
}
vector<int> arr1(n);
vec... | true | 15 | 15 | 15 | 0 | 0 | 69.027185 | 0.765625 |
1090_D | 13 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> comparisons(m);
for (int i = 0; i < m; i++) {
cin >> comparisons[i].first >> comparisons[i].second;
}
vector<int> array1(n), array2(n);
for... | true | 15 | 15 | 15 | 0 | 0 | 73.309183 | 1.21875 |
1090_D | 14 | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pairs(m);
for (int i = 0; i < m; ++i) {
cin >> pairs[i].first >> pairs[i].second;
}
set<int> distinct_values;
... | true | 15 | 15 | 15 | 0 | 0 | 61.481476 | 1.40625 |
1090_D | 17 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> comparisons(m);
for (int i = 0; i < m; i++) {
cin >> comparisons[i].first >> comparisons[i].second;
}
// Sort the comparisons by the first elem... | true | 15 | 15 | 15 | 0 | 0 | 65.325975 | 1.109375 |
1090_D | 20 | #include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_set>
using namespace std;
bool has_two_equal(vector<int>& arr) {
for (int i = 0; i < arr.size(); ++i) {
for (int j = i + 1; j < arr.size(); ++j) {
if (arr[i] == arr[j]) {
return true;
}
... | true | 15 | 15 | 15 | 0 | 0 | 60.654879 | 1.347656 |
1090_D | 23 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> pairs(m);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
pairs[i] = {a, b};
}
vector<int> arr1(n);
vector<int> arr2(n);
for (int i = 0;... | true | 15 | 15 | 15 | 0 | 0 | 59.388161 | 1.535156 |
1090_D | 28 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pairs(m);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
pairs[i] = {a, b};
}
vector<int> distinct(n);
for (int i =... | true | 15 | 15 | 15 | 0 | 0 | 66.759348 | 1.210938 |
1090_D | 29 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> pairs(m);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
pairs[i] = {a, b};
}
// Check if there are two equal elements in the pairs
bool ha... | true | 15 | 15 | 15 | 0 | 0 | 77.832222 | 4.621094 |
1090_D | 31 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> comparisons(m);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
comparisons[i] = make_pair(a, b);
}
vector<int> arr1(n),... | true | 15 | 15 | 15 | 0 | 0 | 64.239264 | 1.28125 |
1090_D | 40 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> pairs(m);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
pairs[i] = {a, b};
}
vector<int> arr1(n);
vector<int> arr2(n);
for (int i = 0;... | true | 15 | 15 | 15 | 0 | 0 | 72.909594 | 1.015625 |
1090_D | 45 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<std::pair<int, int>> pairs(m);
for (int i = 0; i < m; ++i) {
int a, b;
std::cin >> a >> b;
pairs[i] = {a, b};
}
// find the first equal ... | true | 15 | 15 | 15 | 0 | 0 | 67.209959 | 1.082031 |
1090_D | 46 | #include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n, m;
std::cin >> n >> m;
// Read the pairs of positions
std::vector<std::pair<int, int>> pairs(m);
for (int i = 0; i < m; i++) {
int a, b;
std::cin >> a >> b;
pairs[i] = {a, b};
}
// Check... | true | 15 | 15 | 15 | 0 | 0 | 71.182251 | 1.207031 |
1090_J | 6 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<string> prefixes_s, prefixes_t;
for (int i = 0; i < s.size(); ++i) {
prefixes_s.push_back(s.substr(0, i + 1));
}
for (int i = 0; i < t.size(); ++i) {
pr... | true | 15 | 15 | 15 | 0 | 0 | 61.251163 | 0.683594 |
1090_J | 8 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<string> prefixes_s, prefixes_t;
// Generate all non-empty prefixes of s
for (int i = 0; i < s.size(); i++) {
prefixes_s.push_back(s.substr(0, ... | true | 15 | 15 | 15 | 0 | 0 | 57.162285 | 1.285156 |
1090_J | 27 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<string> prefixes_s, prefixes_t;
// Generate all prefixes of s and t
for (int i = 0; i < s.length(); i++) {
prefixes_s.push_back(s.substr(0, i ... | true | 15 | 15 | 15 | 0 | 0 | 65.312386 | 1.65625 |
1090_J | 29 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int count = 0;
for (int i = 0; i <= s.length(); i++) {
for (int j = 0; j <= t.length(); j++) {
string prefix_s = s.substr(0, i);
string prefix_t = t.substr(0, j);
... | true | 15 | 15 | 15 | 0 | 0 | 71.070194 | 3.414063 |
1090_J | 38 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int count = 0;
for (int i = 0; i < s.length(); i++) {
for (int j = 0; j < t.length(); j++) {
string prefix_s = s.substr(0, i);
string prefix_t = t.substr(0, j);
... | true | 15 | 15 | 15 | 0 | 0 | 77.801228 | 3.421875 |
1090_J | 49 | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<string> prefixes_s, prefixes_t;
prefixes_s.push_back("");
prefixes_t.push_back("");
for (int i = 0; i < s.size(); i++) {
prefixes_s.push_b... | true | 15 | 15 | 15 | 0 | 0 | 67.570925 | 1.109375 |
1093_A | 0 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
int rolls = ceil(x / 6.0);
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 60.927153 | 1.019531 |
1093_A | 1 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
int rolls = (int)ceil(x / 6.0);
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 68.107367 | 0.867188 |
1093_A | 5 | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
int rolls = 0;
while (x > 0) {
rolls++;
x -= 6;
}
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 67.693233 | 1.53125 |
1093_A | 10 | #include <iostream>
#include <cmath>
int main() {
int t;
std::cin >> t;
for (int i = 0; i < t; ++i) {
int x;
std::cin >> x;
int rolls = ceil((double)x / 6);
std::cout << rolls << std::endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 64.94236 | 0.765625 |
1093_A | 13 | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
int rolls = 1;
while (rolls * 6 < x) {
rolls++;
}
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 53.268909 | 0.703125 |
1093_A | 14 | #include <iostream>
int main() {
int t;
std::cin >> t;
for (int i = 0; i < t; i++) {
int x;
std::cin >> x;
int rolls = 1;
while (rolls * 6 < x) {
rolls++;
}
std::cout << rolls << std::endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 60.779333 | 1.015625 |
1093_A | 15 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
// find the number of rolls needed to get exactly x points
int rolls = ceil((double)x / 6);
// output the number of rolls
... | true | 15 | 15 | 15 | 0 | 0 | 69.672346 | 1.351563 |
1093_A | 17 | #include <iostream>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
int rolls = 1;
while (rolls * 6 < x) {
rolls++;
}
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 59.035778 | 0.703125 |
1093_A | 18 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int t, x;
cin >> t;
for (int i = 0; i < t; ++i) {
cin >> x;
int rolls = ceil((double)x / 6);
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 54.911852 | 0.761719 |
1093_A | 19 | #include <iostream>
int main() {
int t;
std::cin >> t;
for (int i = 0; i < t; ++i) {
int x;
std::cin >> x;
int rolls = 1;
while (rolls * 6 < x) {
rolls++;
}
std::cout << rolls << std::endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 58.722258 | 1.21875 |
1093_A | 24 | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int t;
cin >> t;
vector<int> x(t);
for (int i = 0; i < t; i++) {
cin >> x[i];
}
for (int i = 0; i < t; i++) {
int x_i = x[i];
int rolls = 1;
while (rolls * 6 <... | true | 15 | 15 | 15 | 0 | 0 | 66.120625 | 0.699219 |
1093_A | 25 | #include <iostream>
#include <cmath>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int x;
cin >> x;
int rolls = 0;
while (rolls * 6 < x) {
rolls++;
}
cout << rolls << endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 67.033529 | 0.765625 |
1093_A | 26 | #include <iostream>
#include <cmath>
int main() {
int t;
std::cin >> t;
for (int i = 0; i < t; i++) {
int x;
std::cin >> x;
int rolls = (int)std::ceil(x / 6.0);
std::cout << rolls << std::endl;
}
return 0;
} | true | 15 | 15 | 15 | 0 | 0 | 65.824986 | 1.277344 |
End of preview.
DivAlgo generations
Solutions from the 24 code generation models evaluated in the DivAlgo paper on the 1,000 test problems: every correct solution with its code, and a verdict for every sample, so all diversity numbers can be rescored without regenerating. Incorrect samples' text is omitted; it is regenerable with the repository's scripts and prompts.
Paper: DivAlgo: A systematic evaluation of algorithmic diversity for code generation models.
Code: https://github.com/anubhav-jangra/divalgo. Main dataset: jangraanubhav/DivAlgo.
Layout
| folder | contents |
|---|---|
iid/ |
24 models, 50 i.i.d. samples per problem at T=0.8 |
temperature/ |
Gemma-4-31b, Gemma-4-E4B, Phi-4 at T=0.2 and T=1.2 |
verbalized/ |
verbalized sampling, 10 calls × 5 solutions per problem |
iterative/ |
iterative generation, 10 chains × 5 rounds per problem |
steer/ |
label-conditioned steering (none / a / b), 5 models, 10 samples on 914 problems |
Each arm has <model>.jsonl.gz (correct samples: inst_id, sample, code, the test-case
record, strategy fields such as vs_call, chain/round, condition/target, and
ontology_label where the paper labelled the sample) and <model>.verdicts.jsonl.gz (every
sample: inst_id, sample, correct, test-case record). A sample is correct when it
compiles and passes every sampled test case.
Licence
CC BY 4.0. Model outputs remain subject to their providers' terms.
@article{jangra2026divalgo,
title = {DivAlgo: A systematic evaluation of algorithmic diversity for code generation models},
author = {Jangra, Anubhav and Muresan, Smaranda},
journal = {arXiv preprint arXiv:2610.19157},
year = {2026}
}
- Downloads last month
- 16