package GoogleCodeJam;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
public class ProblemA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new
InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
for (int j=1; j<=t;j++) {
int n = Integer.parseInt(br.readLine());
int[][] mat = new int[n][n];
int i = 0;
while (i < n) {
mat[i] = Arrays.stream(br.readLine().split("
")).mapToInt(Integer::parseInt).toArray();
i++;
}
int [] ans = new int[3];
calculate(mat, n, ans);
System.out.println("Case #" + j + ": " + ans[0] + " " + ans[1] + "
" + ans[2]);
}
}
private static void calculate(int[][] mat, int n, int[] ans) {
int sum = 0;
int rSum = 0;
int cSum = 0;
HashSet<Integer> set1 = new HashSet<>();
HashSet<Integer> set2 = new HashSet<>();
for (int i = 0; i < n; i++) {
set1 = new HashSet<>();
set2 = new HashSet<>();
for (int j = 0; j < n; j++) {
if (i == j) {
sum += mat[i][j];
}
set1.add(mat[i][j]);
set2.add(mat[j][i]);
}
if (set1.size() != n) {
rSum +=1;
}
if (set2.size() != n) {
cSum +=1;
}
}
ans[0] = sum;
ans[1] = rSum;
ans[2] = cSum;
}
}
package GoogleCodeJam;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class ProblemB {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new
InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
for (int i = 1; i <= t; i++) {
String s = br.readLine();
System.out.println("Case #" + i+ ": " + calculate(s));
}
}
private static String calculate(String s) {
StringBuilder stringBuilder = new StringBuilder();
int current = 0;
for (Character character : s.toCharArray()) {
int val = character - '0';
while (current < val) {
stringBuilder.append('(');
current++;
}
while (current > val) {
stringBuilder.append(')');
current--;
}
stringBuilder.append(val);
}
while (current > 0) {
stringBuilder.append(')');
current--;
}
return stringBuilder.toString();
}
}
package GoogleCodeJam;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class ProblemC {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new
InputStreamReader(System.in));
int t = Integer.parseInt(br.readLine());
for (int i = 1; i <= t; i++) {
int n = Integer.parseInt(br.readLine());
List<Data> pointList = new ArrayList<Data>(3);
int[] arr;
for (int j = 0; j < n; j++) {
arr = Arrays.stream(br.readLine().split("
")).mapToInt(Integer::parseInt).toArray();
pointList.add(new Data(arr[0], arr[1], j));
}
System.out.println("Case #" + i + ": " + calculate(pointList));
}
}
private static String calculate(List<Data> points) {
points.sort(Comparator.comparingInt(o -> o.x));
TreeMap<Integer, Character> ans = new TreeMap<>();
int cTime = -1;
int jTime = -1;
for (Data data : points) {
if (cTime == -1 || cTime <= data.x) {
cTime = data.y;
ans.put(data.index, 'C');
continue;
}
if (jTime == -1 || jTime <= data.x) {
jTime = data.y;
ans.put(data.index, 'J');
continue;
}
return "IMPOSSIBLE";
}
StringBuilder stringBuilder = new StringBuilder();
for (Map.Entry entry : ans.entrySet()) {
stringBuilder.append(entry.getValue());
}
return stringBuilder.toString();
}
static class Data {
int x;
int y;
int index;
public Data(int x, int y, int index) {
this.x = x;
this.y = y;
this.index = index;
}
}
}
--
You received this message because you are subscribed to the Google Groups
"Google Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/google-code/c2a478ef-eb4a-4efb-abec-1a00af09133d%40googlegroups.com.
