oj.uz

Submission #4784

# Submission time Handle Problem Language Result Execution time Memory
4784 2014-01-02T16:45:54 Z gs13068 제곱근 구하기 2 (gs13068_sqrt2) C++
1 / 1
 0 ms 1088 KB 
#include<cstdio>

int main()
{
	long long i,n;
	scanf("%lld",&n);
	for(i=1;i*i<=n;i++);
	if((n-(i-1)*(i-1))*(2*i)+(i*i-n)*(2*(i-1))<(2*(i-1))*(2*i))printf("%lld.%06lld",i-1,((n-(i-1)*(i-1))*1000000+(i-1))/(2*(i-1)));
	else printf("%lld.%06lld",i-1,((2*i-i*i+n)*1000000+i)/(2*i));
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct