# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092290 | speedcode | Balloons (CEOI11_bal) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n;
cin>>n;
double radius[n]={0};
int coords[n]={0};
int x,r;
cin>>x>>r;
radius[0]=r;
coords[0]=x;
cout<<fixed<<setprecision(3);
cout<<arr[0]<<endl;
for(int i=1;i<n;i++) {
cin>>x>>r;
double radius=r;
for(int j=i-1;j>=0 j--) {
double p=Pow(coords[i]-coords[j],2)/(4*radius[j]);
if(p<r) {
radius=p;
}
}
radius[i]=radius;
cout<<radius;
}