-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathA and B and Compilation Errors.cpp
73 lines (68 loc) · 1.35 KB
/
A and B and Compilation Errors.cpp
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
72
73
#include<bits/stdc++.h>
using namespace std ;
#define pb push_back
#define pf push_front
#define vi vector <int>
#define vl vector <long>
#define vll vector <long long>
#define vii vector <vector <int> >
#define vpii vector <pair <int , int> >
#define vpll vector <pair <long , long> >
#define Fi(i,L,R) for (int i = L; i <= R; i++)
#define Fd(i,R,L) for (int i = R; i >= L; i--)
#define fast ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
void swap_int(int *a , int *b)
{
int temp = *a ;
*a = *b ;
*b = temp ;
}
int solve (int testcase)
{
int n , i , j , flag1 = 0 , flag2 = 0 , pos1 , pos2 ;
cin >> n ;
vi v1(n+1) ;
vi v2(n) ;
vi v3(n-1) ;
Fi (i , 1, n) cin >> v1[i];
Fi (i , 1, n-1) cin >> v2[i];
Fi (i , 1, n-2) cin >> v3[i];
sort (v1.begin() ,v1.end()) ;
sort (v2.begin() ,v2.end()) ;
sort (v3.begin() ,v3.end()) ;
Fi(i , 1 ,n-1)
{
if (v1[i] != v2[i])
{
flag1 = 1 ;
pos1 = i ;
break ;
}
}
if (flag1 == 1)
cout << v1[pos1] << '\n';
else
cout << v1[n] <<'\n' ;
Fi (j , 1 , n-2)
{
if (v2[j] != v3[j])
{
flag2 = 1 ;
pos2 = j ;
break ;
}
}
if (flag2 == 1)
cout << v2[pos2] ;
else
cout << v2[n-1] << '\n';
}
int main()
{
fast
int t = 1 ;
// cin>>t ;
while (t--)
solve (1) ;
return 0 ;
}