zoukankan      html  css  js  c++  java
  • hdu 1969 Pie 二分

    /*
    * hdu1969.c
    *
    * Created on: 2011-10-9
    * Author: bjfuwangzhu
    */

    #include<stdio.h>
    #include<stdlib.h>
    #include<math.h>
    #define nmax 10010
    #define pi acos(-1.0)
    #define eps 1.0e-5
    double volume[nmax];
    int cmp(int n, double aver) {
    int i, temp;
    for (i = 0, temp = 0; i < n; i++) {
    temp += (int) (volume[i] / aver);
    }
    return temp;
    }
    void solve(int n, int f, double sum) {
    double left, right, mid;
    left = 0.0, right = sum / f;
    while (fabs(left - right) > eps) {
    mid = (left + right) / 2;
    if (cmp(n, mid) >= f) {
    left = mid;
    } else {
    right = mid;
    }
    }
    printf("%.4lf\n", mid);
    }
    int main() {
    #ifndef ONLINE_JUDGE
    freopen("data.in", "r", stdin);
    #endif
    int t, n, f, i, r;
    double sum;
    scanf("%d", &t);
    while (t--) {
    scanf("%d %d", &n, &f);
    for (i = 0, sum = 0.0; i < n; i++) {
    scanf("%d", &r);
    volume[i] = pi * r * r;
    sum += volume[i];
    }
    solve(n, f + 1, sum);
    }
    return 0;
    }

  • 相关阅读:
    14. HTML 列表(无序, 有序, 定义)
    13. HTML table
    12. HTML图像
    11. HTML链接
    10. HTML CSS
    learning java AWT Pannel
    learning AWT Jrame
    learning java 正则表达式
    learning java java.time相关类
    learning java Calendar类
  • 原文地址:https://www.cnblogs.com/xiaoxian1369/p/2204130.html
Copyright © 2011-2022 走看看