-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUva11286.java
More file actions
65 lines (58 loc) · 1.78 KB
/
Uva11286.java
File metadata and controls
65 lines (58 loc) · 1.78 KB
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
import java.util.*;
import java.io.*;
public class Uva11286
{
public static void main(String[] args) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder("");
int n ;
int [] a = new int[5];
HashMap<Key,Integer> map = new HashMap<>();
while( ( n = Integer.parseInt(br.readLine()) ) != 0 ){
map.clear();
int ans = -1 , max = 0 ;
for (int i = 0; i < n; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
for (int j = 0; j < 5; j++) {
a[j] = Integer.parseInt(st.nextToken());
}
Arrays.sort(a);
Key k = new Key(a);
if( map.containsKey(k) ){
int val = map.get(k);
map.put(k,++val);
} else {
map.put(k,1);
}
if( map.get(k) > max ){
max = map.get(k);
ans = map.get(k);
} else if( map.get(k) == max ){
ans += map.get(k);
}
}
sb.append(ans).append('\n');
}
System.out.print(sb.toString());
br.close();
}
static class Key
{
int [] a ;
public Key(int[] a) {
this.a = a;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Key key = (Key) o;
return Arrays.equals(a, key.a);
}
@Override
public int hashCode() {
return Arrays.hashCode(a);
}
}
}