Google kickstart 2022 round B | Infinity Area | solution kickstart

 Infinity Area :

Problem:

Let us assume for the simplicity of this problem that the Infinity symbol is made of circles which touch externally at point S$S$ as shown below, and let us call it the center of the infinity.

You are given three integers R$R$, A$A$, B$B$. You are currently at the center of the infinity. You will first start drawing the right circle with radius R$R$ and reach again the center of infinity. After that, you start drawing the left circle with the radius equal to the radius of last circle multiplied by A$A$. After reaching the center of the infinity you again start drawing the right circle with radius equal to the radius of last circle divided by B$B$ (integer divison). After reaching the center of infinity you again draw the left circle with the radius equal to the radius of last circle multiplied by A$A$.

You continue to draw the left and right circles as described above until the radius of the circle to be drawn becomes zero. Calculate the sum of areas of all the circles drawn. It is guaranteed that the process will terminate after finite number of steps.

Input

The first line of the input gives the number of test cases, T$T$. T$T$ lines follow.

Each line represents a test case and contains three integers R$R$, A$A$, B$B$, where R$R$ denotes the radius of the first circle, and A$A$ and B$B$ are the parameters used to calculate the radii of the subsequent circles.

Output

For each test case, output one line containing Case #x$x$: y$y$, where x$x$ is the test case number (starting from 1) and y$y$ is the sum of areas of all the circles drawn until radius of the circle to be drawn becomes zero.

y$y$ will be considered correct if it is within an absolute or relative error of 10−6${10}^{-6}$ of the correct answer. See the FAQ for an explanation of what that means, and what formats of real numbers we accept.

Limits

Time limit: 20 seconds.
Memory limit: 1 GB.

Test Set 1

1≤T≤100$1\le \mathbf{T}\le 100$
1≤R≤105$1\le \mathbf{R}\le {10}^5$
1≤A≤500$1\le \mathbf{A}\le 500$
2×A≤B≤1000$2\times \mathbf{A}\le \mathbf{B}\le 1000$

Sample

Sample Input

2
1 3 6
5 2 5

Sample Output

Case #1: 31.415927
Case #2: 455.530935

solution:

#include<bits/stdc++.h>

using namespace std;

int main()

{

    int t;

    double pi = 3.1415926535897932;

    cin >> t;

    for(int i = 1 ; i <= t; i++)

    {

        int  r  , a , b;

        cin >> r >> a >> b;

        int t = r ;

        int chance = 1;

        float sum =0;

        while(t != 0)

        {

            sum = sum + pi*t*t;

            if(chance %2 == 1)

            {

                t = t*a;

            }

            else

            {

                t = t/b;

            }

            chance ++;

            

        }

        cout << "Case #"<<i<<": "<<  fixed<<setprecision(6) <<sum<<"\n";

        

    }

}