-
Notifications
You must be signed in to change notification settings - Fork 17
/
Copy pathNearestPerfectSquare.java
63 lines (58 loc) · 1.74 KB
/
NearestPerfectSquare.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
package SummerTrainingGFG.Contest;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
/**
* @author Vishal Singh */
public class NearestPerfectSquare {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt(){
return Integer.parseInt(next());
}
long nextLong(){
return Long.parseLong(next());
}
}
public static void main(String[] args) {
FastReader fast = new FastReader();
int testCases = fast.nextInt();
for (int i = 0; i < testCases; i++) {
long number = fast.nextLong();
long prev;
long next;
if ((long)(Math.sqrt(number)) == Math.sqrt(number)){
prev = ((long)Math.floor(Math.sqrt(number)))-1;
next = ((long)Math.floor(Math.sqrt(number)))+1;
}
else {
prev = ((long)Math.floor(Math.sqrt(number)));
next = ((long)Math.floor(Math.sqrt(number)))+1;
}
System.out.println(( number - (prev*prev) ) <= Math.abs( number - (next*next) ) ? (prev*prev):(next*next));
}
}
}