版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/tobe_numberone/article/details/89057581
题目链接https://nanti.jisuanke.com/t/T1315
算法特工队QQ群:979618872 (伸手党绕边,欢迎有良好基础的人加入)
//
// Created by Leo Lee on 2019/4/6.
//
#include <iostream>
using namespace std;
int main(){
int cases;
cin>>cases;
double sum = 0,tmp = 0;
for(int i = 0;i<cases;i++){
cin>>tmp;
sum+=tmp;
}
printf("%.2f\n",sum/cases);
return 0;
}