forked from adityabisoi/ds-algo-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
solution.java
71 lines (56 loc) · 2.12 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
69
70
71
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 {
// organizingContainers function
static String organizingContainers(int[][] Box) {
//Create a bag for the amount of each ball and the sizes of containers
LinkedList<Integer> containers = new LinkedList<>();
LinkedList<Integer> balls = new LinkedList<>();
for(int i = 0; i < Box.length; i++){
int rowSum = 0;
int colSum = 0;
for(int j = 0; j < Box[0].length; j++){
rowSum += Box[i][j];
colSum += Box[j][i];
}
balls.add(colSum);
containers.add(rowSum);
}
//Check if the two bags are equal
containers.removeAll(balls);
if(containers.isEmpty())
return "Possible";
else
return "Impossible";
}
private static final Scanner scanner = new Scanner(System.in);
// mian function
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int q = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int qItr = 0; qItr < q; qItr++) {
int n = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
int[][] container = new int[n][n];
for (int i = 0; i < n; i++) {
String[] containerRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int j = 0; j < n; j++) {
int containerItem = Integer.parseInt(containerRowItems[j]);
container[i][j] = containerItem;
}
}
String result = organizingContainers(container);
bufferedWriter.write(result);
bufferedWriter.newLine();
}
bufferedWriter.close();
scanner.close();
}
}