第1天

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    double d, h, w, r;
    int t;
    cin >> t;
    while (t--)
    {
        cin >> d >> h >> w;
        r = d*w / (2 * h);
        double ans = r*r*w / 1200;
        printf("%.2f\n", ans);
    }
    return 0;
}
/**************************************************************
    Problem: 1265
    User: 2015030402039
    Language: C++
    Result: Accepted
    Time:28 ms
    Memory:1484 kb
****************************************************************/

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int t,a[50],n,i;
    scanf("%d", &t);
    while (t--)
    {
        scanf("%d", &n);
        n = n + 1;
        for (i = 0; i <n ; i++)
        {
            scanf("%d", &a[i]);
        }
        sort(a, a + n );
        for (i = 0; i < n ; i++)
            printf("%d ", a[i]);
        printf("\n");
    }
    return 0;
}
/**************************************************************
    Problem: 1266
    User: 2015030402039
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1488 kb
****************************************************************/

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int n, m,a[110],i,num=1;
    scanf("%d%d", &n, &m);
    for (i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    sort(a,a+n);
    for (i = 0; i < n; i++)
    {
        if (m > a[i])
            num++;
    }
    printf("%d\n", num);
    return 0;
}
/**************************************************************
    Problem: 1288
    User: 2015030402039
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1488 kb
****************************************************************/