zoukankan      html  css  js  c++  java
  • ZOJ Problem Set–1915 Above Average

    Time Limit: 2 Seconds      Memory Limit: 65536 KB


    It is said that 90% of frosh expect to be above average in their class. You are to provide a reality check.

    Input

    The first line of standard input contains an integer C, the number of test cases. C data sets follow. Each data set begins with an integer, N, the number of people in the class (1 <= N <= 1000). N integers follow, separated by spaces or newlines, each giving the final grade (an integer between 0 and 100) of a student in the class.

    Output

    For each case you are to output a line giving the percentage of students whose grade is above average, rounded to 3 decimal places.

    Sample Input
    5
    5 50 50 70 80 100
    7 100 95 90 80 70 60 50
    3 70 90 80
    3 70 90 81
    9 100 99 98 97 96 95 94 93 91


    Sample Output

    40.000%
    57.143%
    33.333%
    66.667%
    55.556%


    Source: University of Waterloo Local Contest 2002.09.28

    #include<iostream>
    
    #include<iomanip>
    
    using namespace std;
    
    int main()
    
    {
    
      int cases;cin>>cases;
    
      while(cases--)
    
      {
    
        int N;cin>>N;
    
        int *p = new int[N];
    
        int n;
    
        int sumGrade = 0;
    
        for(int index = 0; index < N; index++)
    
        {
    
          cin>>n;
    
          *(p + index) = n;
    
          sumGrade += n;
    
        }
    
        double avgGrade = sumGrade*1.0/N;
    
        int above = 0;
    
        for(int index = 0; index < N; index++)
    
        {
    
          if(*(p + index) > avgGrade)
    
          {
    
            above++;
    
          }
    
        }
    
        cout<<fixed<<setprecision(3)<<above*100.0/N<<"%"<<endl;
    
      }
    
    }
  • 相关阅读:
    【宋红康程序思想学习日记5】数组排序之冒泡法
    求割点 poj 1523
    网络流 poj 3308 最小割
    网络流最小割 POJ 3469
    网络流 POJ2112
    网络流 HDU 3605
    网络流HDU 2883
    网络流 最大流HDU 3549
    微信公众平台开发者中心服务器配置Token验证失败问题
    排列熵算法简介及c#实现
  • 原文地址:https://www.cnblogs.com/malloc/p/2400489.html
Copyright © 2011-2022 走看看