forked from alexprut/HackerRank
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.java
68 lines (55 loc) · 1.4 KB
/
Solution.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
64
65
66
67
68
/**
4 5 6 7
4 6 7 7
4 6 8 8
*/
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the fairRations function below.
static int fairRations(int[] B) {
int sum = 0;
for (int i = 0; i < B.length; i++) {
sum += B[i];
}
if (sum % 2 != 0) {
return -1;
}
int counter = 0;
for (int i = 0; i < B.length - 1; i++) {
if (B[i] % 2 != 0) {
B[i]++;
B[i+1]++;
counter += 2;
}
}
return counter;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int N = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[] B = new int[N];
String[] BItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < N; i++) {
int BItem = Integer.parseInt(BItems[i]);
B[i] = BItem;
}
int result = fairRations(B);
if (result == -1) {
bufferedWriter.write("NO");
} else {
bufferedWriter.write(String.valueOf(result));
}
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}