浙大 PAT b1053

来源:互联网 发布:怪物猎人ol n卡优化 编辑:程序博客网 时间:2024/06/05 06:22
#include<stdio.h>int main() {double a[1000][1000];int N,D,b[1000],k[1000]= {0};double e;int i,j,n; scanf("%d%lf%d",&N,&e,&D);for(i=0; i<N; i++) {scanf("%d",&b[i]);for(j=0; j<b[i]; j++) {scanf("%lf",&a[i][j]);}}int sum;for(i=0; i<N; i++) {sum=0;for(j=0; j<b[i]; j++) {if(b[i]>D) {if(a[i][j]<e)sum++;if(sum>b[i]/2)k[i]=2;}else{if(a[i][j]<e)sum++;if(sum>b[i]/2)k[i]=1;}}}n=0;sum=0;for(i=0;i<N;i++){if(k[i]==1)n++;if(k[i]==2)sum++;}printf("%.1f%% ",n*100.0/N);printf("%.1f%%",sum*100.0/N);return 0;}

0 0
原创粉丝点击