博客
关于我
2018蓝桥杯C++A组——付账问题
阅读量:111 次
发布时间:2019-02-26

本文共 1242 字,大约阅读时间需要 4 分钟。

????

????????????????????????????????????????? n ????????? S???????????????????????????????

??

?????????

  • ??????????n ? S????????????????
  • ??????? n ?????????????

??

?????????????????????

????

5 2333666 666 666 666 666 666

????

0.0000

????

???????????????????????????????????????????????????????????????????

[ s = \sqrt{\frac{1}{n} \sum_{i=1}^{n} \left(b_i - \frac{1}{n} \sum_{i=1}^{n} b_i \right)^2} ]

???( s ) ?????( b_i ) ?????????( n ) ?????????

???????????????????????????????????????????????????????????????

  • ?????????????? ( \mu = \frac{S}{n} )?
  • ???????????????
  • ?????
    • ??????????????????????
    • ???????????????????????????????????????? cur_avg??? cur_avg ??????????
  • ???????????????????????????????????

    C++??

    #include 
    using namespace std;typedef long long LL;int n;LL S;double ans = 0.0;double avg = 1.0 * S / n;LL *a = new LL[n];void work() { scanf("%d %lld", &n, &S); ans = 0.0; avg = 1.0 * S / n; LL *a = new LL[n]; for (int i = 0; i < n; ++i) { scanf("%lld", &a[i]); } // ????? double sum = 0.0; for (int i = 0; i < n; ++i) { double diff = a[i] - avg; sum += diff * diff; } ans = sqrt(sum / n); printf("%.4f", ans);}

    ??

    ????????????????

    0.0000

    ???????????????????? 0.0000?

    转载地址:http://swqu.baihongyu.com/

    你可能感兴趣的文章
    Qt网络编程之实例二POST方式
    查看>>
    POJ 1765 November Rain
    查看>>
    poj 1860 Currency Exchange
    查看>>
    POJ 1961 Period
    查看>>
    POJ 2019 Cornfields (二维RMQ)
    查看>>
    poj 2057 The Lost House 贪心思想在动态规划上的应用
    查看>>
    poj 2057 树形DP,数学期望
    查看>>
    poj 2112 最优挤奶方案
    查看>>
    Qt编写自定义控件12-进度仪表盘
    查看>>
    SpringBoot主启动原理在SpringApplication类《第六课》
    查看>>
    poj 2186 Popular Cows :求能被有多少点是能被所有点到达的点 tarjan O(E)
    查看>>
    POJ 2186:Popular Cows Tarjan模板题
    查看>>
    POJ 2229 Sumsets(递推,找规律)
    查看>>
    poj 2236
    查看>>
    POJ 2243 Knight Moves
    查看>>
    POJ 2262 Goldbach's Conjecture
    查看>>
    POJ 2362 Square DFS
    查看>>
    Qt笔记——解决添加Qt Designer Form Class时“allocation of incomplete type Ui::”
    查看>>
    poj 2386 Lake Counting(BFS解法)
    查看>>
    poj 2387 最短路模板题
    查看>>