2017 vector<Problem> problems(m);
2018 for(
int i = 0; i < m; i++) {
2032 for(
int i = 0; i < n; i++) {
2034 for(
int j = 0; j < m; j++) {
2039 unordered_set<char> answer;
2040 for(
int k = 0; k < num; k++) {
2043 answer.insert(choice);
2045 if(answer == problems[j].correct_choices) {
2046 score += problems[j].
score;
2048 problems[j].error_count++;
2049 max_error = max(max_error, problems[j].error_count);
2053 cout << score << endl;
2055 if(max_error == 0) {
2056 cout <<
"Too simple";
2058 vector<int> max_problems;
2059 cout << max_error <<
' ';
2060 for(
int i = 0; i < m; i++) {
2061 if(problems[i].error_count == max_error) {
2062 max_problems.push_back(i + 1);
2065 for(
int i = 0; i < max_problems.size(); i++) {
2066 cout << max_problems[i];
2067 if(i != max_problems.size() - 1) {
unordered_set< char > correct_choices