# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4789 | Qwaz | 제곱근 구하기 1 (gs13068_sqrt1) | C++98 | 0 ms | 1088 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 <cstdio>
typedef long long ll;
ll n;
void solve(){
ll i;
for(i=0; i*i<n; i++);
i--;
printf("%lf\n", i+(double)(n-i*i)/(2*i+1));
}
int main(){
scanf("%lld", &n);
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |