PAT basic 1053
来源:互联网 发布:小表弟网络意思 编辑:程序博客网 时间:2024/06/01 12:13
#include <iostream>using namespace std;int main() { int n, d, k, maybe = 0, must = 0; double e, temp; cin >> n >> e >> d; for (int i = 0; i < n; i++) { cin >> k; int sum = 0; for (int j = 0; j < k; j++) { cin >> temp; if (temp < e) sum++; } if(sum > (k / 2)) { k > d ? must++ : maybe++; } } double mayberesult = (double)maybe / n * 100; double mustresult = (double)must / n * 100; printf("%.1f%% %.1f%%", mayberesult, mustresult); return 0;}
阅读全文
0 0
- PAT basic 1053
- PAT Basic
- PAT (Basic Level) Practise
- PAT Basic 1001
- PAT Basic 1002
- PAT Basic 1005
- PAT Basic 1006
- PAT Basic 1007
- PAT Basic 1008
- PAT Basic 1009
- PAT Basic 1010
- pat basic level 1016
- pat basic level 1018
- pat basic level 1019
- PAT(basic level)题解
- PAT basic 1004 : 成绩排名
- PAT (Basic) 1001~1005
- PAT (Basic) 1006~1010
- solvepnp三维位姿估算
- IntelliJ IDEA出现红色字体解决办法
- HDMI之InfoFrame
- jquery_css
- 图狂狂狂狂狂狂狂狂狂狂狂狂狂狂
- PAT basic 1053
- Deep Learning_预训练CNN图片分类模型(AlexNet、VGG、GoogLeNet、Resnet.....)
- 二分最大匹配--匈牙利算法
- Linux(CentOS 7_x64位)系统下安装GaussView5
- PAT basic 1054
- 12个被世人深深误解的大学专业,真…
- (HDU-2544)最短路
- PAT basic 1055
- lintcode刷题——乘积最大子序列