-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1253.java
61 lines (49 loc) · 1.59 KB
/
1253.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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
int[] numbers = new int[N];
if(N <= 2) {
System.out.println(0);
return;
}
String[] input = br.readLine().split(" ");
br.close();
for(int i = 0; i < N; i++) numbers[i] = Integer.parseInt(input[i]);
Arrays.sort(numbers);
int answer = 0;
for(int i = 0; i < N; i++) {
int left = 0;
int right = N - 1;
int pivot = numbers[i];
while(true) {
if(left == i) left++;
else if(right == i) right--;
if(left >= right) break;
if(isOverflow(numbers[left], numbers[right])) right--;
int result = numbers[left] + numbers[right];
if(result < pivot) left++;
else if(result > pivot) right--;
else {
answer++;
break;
}
}
}
System.out.println(answer);
}
public static boolean isOverflow(int a, int b) {
if(a == 0 || b == 0) return false;
if(b > 0) {
if(a > Integer.MAX_VALUE - b) return true;
}
else {
if(a < Integer.MIN_VALUE - b) return true;
}
return false;
}
}