LightOJ 1216 圆锥体积

1001 - Opposite Task
PDF (English) Statistics Forum
Time Limit: 0.5 second(s) Memory Limit: 32 MB
This problem gives you a flavor the concept of special judge. That means the judge is smart enough to verify your code even though it may print different results. In this problem you are asked to find the opposite task of the previous problem.

To be specific, I have two computers where I stored my problems. Now I know the total number of problems is n. And there are no duplicate problems and there can be at most 10 problems in each computer. You have to find the number of problems in each of the computers.

Since there can be multiple solutions. Any valid solution will do.

Input
Input starts with an integer T (≤ 25), denoting the number of test cases.

Each case starts with a line containing an integer n (0 ≤ n ≤ 20) denoting the total number of problems.

Output
For each case, print the number of problems stored in each computer in a single line. A single space should separate the non-negative integers.

Sample Input
Output for Sample Input
3
10
7
7
0 10
0 7
1 6


PROBLEM SETTER: JANE ALAM JAN

 

<span style="color:#6600cc;">/*************************************************

     author     :     Grant Yuan
     time       :     2014.8.7
     algorithm  :     计算几何
     source     :     Light Oj 1216
     
**************************************************/

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#define pi acos(-1)

using namespace std;
int r1,r2,h,t,p;
double h1,ans,r3;

int main()
{
    scanf("%d",&t);
    cout<<pi<<endl;
    for(int i=1;i<=t;i++)
    {
        scanf("%d%d%d%d",&r1,&r2,&h,&p);
        h1=(r2*h*1.0)/(r1-r2);
        r3=(p+h1)*r1*1.0/(h1+h);
        ans=(h1+p)*pi*r3*r3/3-h1*pi*r2*r2/3;
        printf("Case %d: %.7lf
",i,ans);
    }
    return 0;
}
</span>