| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 16377 | eaststar | 제곱근 구하기 2 (gs13068_sqrt2) | C++14 | 0 ms | 1084 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 <stdio.h>
int main(){
long long i,n;
scanf("%lld",&n);
for(i=1;i*i<=n;++i);
if((double)(n-(i-1)*(i-1))/2/(i-1)<(double)(i*i-n)/2/i)--i;
printf("%lf",i+(double)(n-i*i)/2/i);
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||