我的PAT-BASIC代码仓:https://github.com/617076674/PAT-BASIC
原题链接:https://pintia.cn/problem-sets/994805260223102976/problems/994805273284165632
题目描述:
知识点:计数
时间复杂度与输入的数据关系密切,不好分析。空间复杂度是O(1)。
C++代码:
#include<iostream> using namespace std; int main(){ int total; double e; int D; cin >> total >> e >> D; int maybeEmpty = 0; int realEmpty = 0; int K; for(int i = 0; i < total; i++){ cin >> K; int lowElectricDay = 0; double tempElectric; for(int j = 0; j < K; j++){ cin >> tempElectric; if(tempElectric < e){ lowElectricDay++; } } if(lowElectricDay > K / 2){ if(K > D){ realEmpty++; }else{ maybeEmpty++; } } } printf("%.1lf", 100.0 * maybeEmpty / total); cout << "% "; printf("%.1lf", 100.0 * realEmpty / total); cout << "%"; }C++解题报告: