Created
May 18, 2018 08:22
BOJ 백준온라인져지 5533 유니크 풀이
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.*; | |
import java.io.*; | |
/** | |
* https://www.acmicpc.net/problem/5533 | |
* BOJ 백준온라인져지 5533 유니크 풀이 | |
*/ | |
public class Main { | |
private static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); | |
public static void main(String args[]) throws IOException { | |
BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); | |
int N = Integer.parseInt(br.readLine()); | |
int grades[][] = new int[N][3]; | |
for (int i = 0; i < N; i++) { | |
String str1[] = br.readLine().split(" "); | |
for (int j = 0; j < 3; j++) grades[i][j] = Integer.parseInt(str1[j]); | |
} | |
for (int i = 0; i < N; i++) { | |
for (int j = 0; j < 3; j++) { | |
boolean isFound = false; | |
for (int k = 0; k < N; k++) { | |
if (i == k) continue; | |
if (grades[i][j] == grades[k][j]) { | |
grades[k][j] = 0; | |
isFound = true; | |
} | |
} | |
if (isFound) grades[i][j] = 0; | |
} | |
bw.write((grades[i][0] + grades[i][1] + grades[i][2]) + "\n"); | |
} | |
bw.flush(); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
http://ksh-code.tistory.com/279