# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
27239 | 2017-07-11T11:37:29 Z | TAMREF | 제곱근 구하기 2 (gs13068_sqrt2) | C++11 | 0 ms | 2032 KB |
#include <bits/stdc++.h> using namespace std; int main(){ long long n,a; double ans; scanf("%lld",&n); a=(long long)sqrt(n); if(n-a*a>a){ ++a; ans=(1.-(double)(a*a-n)/(2*a*a))*a; }else{ ans=(1.+(double)(n-a*a)/(2*a*a))*a; } printf("%.6f\n",ans); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2032 KB | Output is correct |
2 | Correct | 0 ms | 2032 KB | Output is correct |
3 | Correct | 0 ms | 2032 KB | Output is correct |
4 | Correct | 0 ms | 2032 KB | Output is correct |
5 | Correct | 0 ms | 2032 KB | Output is correct |
6 | Correct | 0 ms | 2032 KB | Output is correct |
7 | Correct | 0 ms | 2032 KB | Output is correct |
8 | Correct | 0 ms | 2032 KB | Output is correct |
9 | Correct | 0 ms | 2032 KB | Output is correct |
10 | Correct | 0 ms | 2032 KB | Output is correct |
11 | Correct | 0 ms | 2032 KB | Output is correct |
12 | Correct | 0 ms | 2032 KB | Output is correct |
13 | Correct | 0 ms | 2032 KB | Output is correct |
14 | Correct | 0 ms | 2032 KB | Output is correct |
15 | Correct | 0 ms | 2032 KB | Output is correct |
16 | Correct | 0 ms | 2032 KB | Output is correct |
17 | Correct | 0 ms | 2032 KB | Output is correct |
18 | Correct | 0 ms | 2032 KB | Output is correct |
19 | Correct | 0 ms | 2032 KB | Output is correct |
20 | Correct | 0 ms | 2032 KB | Output is correct |