我的PAT-BASIC代碼倉:https://github.com/617076674/PAT-BASIC
原題連結:https://pintia.cn/problem-sets/994805260223102976/problems/994805268817231872
題目描述:
知識點:計數
思路:按題述程式設計即可
時間複雜度是O(N * M),空間複雜度是O(M)。
C++代碼:
#include<iostream>
using namespace std;
int main(){
int N, M;
cin >> N >> M;
int scores[M];
int tempNum;
for(int i = 0; i < M; i++){
cin >> tempNum;
scores[i] = tempNum;
}
int answers[M];
for(int i = 0; i < M; i++){
cin >> tempNum;
answers[i] = tempNum;
}
int sum;
for(int i = 0; i < N; i++){
sum = 0;
for(int i = 0; i < M; i++){
cin >> tempNum;
if(tempNum == answers[i]){
sum += scores[i];
}
}
cout << sum << endl;
}
return 0;
}
C++解題報告: