-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAnBCompilationError.java
More file actions
63 lines (47 loc) · 1.41 KB
/
AnBCompilationError.java
File metadata and controls
63 lines (47 loc) · 1.41 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
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class AnBCompilationError
{
public static void main( String[] args )
{
Scanner s = new Scanner( System.in );
int n = s.nextInt();
int[] firstSet = new int[n];
for(int i=0;i<n;i++)
firstSet[i] = s.nextInt();
Arrays.sort( firstSet );
int[] secondSet = new int[n-1];
for(int i=0;i<n-1;i++)
secondSet[i] = s.nextInt();
Arrays.sort( secondSet );
int[] thirdSet = new int[n-2];
for(int i=0;i<n-2;i++)
thirdSet[i] = s.nextInt();
Arrays.sort( thirdSet );
boolean diffFound =false;
for(int i=0;i<n-1;i++)
{
if(firstSet[i]!=secondSet[i])
{
System.out.println( firstSet[i] );
diffFound = true;
break;
}
}
if(!diffFound)
System.out.println( firstSet[n-1] );
diffFound= false;
for(int i=0;i<n-2;i++)
{
if(secondSet[i]!=thirdSet[i])
{
System.out.println( secondSet[i] );
diffFound = true;
break;
}
}
if(!diffFound)
System.out.println( secondSet[n-2] );
}
}