[Kick Start 2022 Round B] Infinity Area

Infinity Area

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#define MAX_N 2020
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vll vector<ll>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
using namespace std;



double solve(ll& r, ll& a, ll& b) {
double res = M_PI * r * r;
bool A = true;
while(r) {
if(A) r *= a;
else r /= b;
A = !A;
res += M_PI * r * r;
}

return res;
}

int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.setf(ios::fixed);
cout.precision(6);
ll tc, r, a, b;
cin>>tc;
for(ll i = 1; i <= tc; i++) {
cin>>r>>a>>b;
cout<<"Case #"<<i<<": "<<solve(r,a,b)<<'\n';
}

return 0;
}
Author: Song Hayoung
Link: https://songhayoung.github.io/2022/04/24/PS/Google/infinity-area/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.