| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 16798 | kdh9949 | 제곱근 구하기 2 (gs13068_sqrt2) | C++98 | 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>
long long n,k,s;
int main()
{
scanf("%lld",&n);
for(k=1;k*(k-1)<=n;k++);k--;k*=2;
printf("%.6f",(double)(n+k*k/4)/k);
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||