Pat乙級(jí)1058 選擇題

• 思路
• 代碼

題目網(wǎng)址
https://pintia.cn/problem-sets/994805260223102976/problems/994805270356541440

思路

注意下輸入的格式，用scanf處理。第1個(gè)測(cè)試點(diǎn)輸出Too simple前先輸出每個(gè)人的分?jǐn)?shù)，然后輸出Too simple，直接return 0。
data二維數(shù)組中，每一行最后一個(gè)存那道題的分?jǐn)?shù)，倒數(shù)第二個(gè)存正確選項(xiàng)的個(gè)數(shù)。

代碼

#include<iostream> #define MAX 1005using namespace std;int data[MAX][MAX] = {0}; int vis[MAX] = {0};int main() {int n;int m;int score;int num;int num_right;char c;int N;int sum = 0;char temp;int flag;scanf("%d %d", &n, &m);for (int i = 1; i <= m; i ++) { scanf("%d %d %d", &score, &num, &num_right);for (int j = 1; j <= num_right; j ++) {scanf(" %c", &c);c = tolower(c);if (c >= 'a' && c <= 'e')data[i][c - 'a' + 1] = 1;}data[i][0] = score; data[i][MAX - 2] = num_right;}for (int i = 1; i <= n; i ++) {scanf("\n");for (int j = 1; j <= m; j ++) {if (j > 1)scanf(" ");scanf("(%d", &N);flag = 0;if (N != data[j][MAX - 2])flag = 1;for (int k = 1; k <= N; k ++) {scanf(" %c", &c);c = tolower(c);if (c >= 'a' && c <= 'e')if (data[j][c - 'a' + 1] <= 0)flag = 1;}scanf(")");if (flag <= 0)data[i][MAX - 1] += data[j][0];else {vis[j] ++;sum ++;}}}for (int i = 1; i <= n; i ++ )cout << data[i][MAX - 1] << endl;if (sum <= 0) {cout << "Too simple";return 0;}int TheMax = -1;int cnt = 0;for (int i = 1; i <= m; i ++) if (vis[i] > TheMax) TheMax = vis[i];cout << TheMax;for (int i = 1; i <= m; i ++) {if (vis[i] == TheMax)cout << " " << i;}return 0; }

總結(jié)

以上是生活随笔為你收集整理的Pat乙级 1058 选择题的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。