3-1 Stat

#include <stdio.h>
#include <string.h>
#define INT_LENGTH  100+1 
#define FLOAT_LENGTH 10000+1
void TaskOne();
void TaskTwo();
int main()
{
 //TaskOne();
 TaskTwo();
 return 0;
}
//Task1
void TaskOne()
{
 int iScore[ INT_LENGTH]={0};
 int iNumber,i;
 int max;
 printf("Please input students' score:\n");
 //Skillfully using!Let the input score become an array subscript
 while(scanf("%d",&iNumber)==1)
 {
   iScore[iNumber]++;
 }
 //Initialize the largest number of occurrences as iScore[0] and traverse other scores
 max=iScore[0];
 for(i=0;i< INT_LENGTH;i++)
 {
  if(iScore[i]>=max)
  {
   max=iScore[i];
  }
 }
 //Print  the most times of occurrences and print them as ascending order
 for(i=0;i< INT_LENGTH;i++)
 {
  if(iScore[i]==max)
  {
   printf("%d ",i);
  }
 }
}
//Task2
void TaskTwo()
{
 int i,iMaxCount;
 double dScore[FLOAT_LENGTH]={0};
 double dNumber;
 printf("Please input students' score:\n");
 while(scanf("%lf",&dNumber)==1)
 {
  dScore[(int)(dNumber*100)]++;
 }
 //Initialize the largest number of occurrences as iScore[0] and traverse other scores
 iMaxCount=dScore[0];
 for(i=0;i<FLOAT_LENGTH;i++)
 {
  if(dScore[i]>iMaxCount)
  {
   iMaxCount=dScore[i];
  }
 }
 //Print  the most times of occurrences and print them as ascending order
 for(i=0;i<FLOAT_LENGTH;i++)
 {
  if(dScore[i]==iMaxCount)
  {
   printf("%.2lf\t",(double)i/100);
  }
 }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值