-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2001_Mathematicians_and_Berries.cpp
42 lines (39 loc) · 1.09 KB
/
2001_Mathematicians_and_Berries.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
/**
* Author: Sohel Rana
* Date: 2020-10-12 13:04:26
* Link: link
**/
#include <bits/stdc++.h>
#define endl '\n'
#define db double
#define ld long double
#define ll long long
#define ull unsigned long long
#define sqr(x) (x) * (x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a/gcd(a,b)) * b)
#define pf(x) push_front(x)
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)x.size()
#define debug(x) cerr << #x << " = " << (x) <<endl
#define unsyncIO ios_base::sync_with_stdio(0); cin.tie(0)
const ld PI = acos((ld)-1);
const int MOD = 1e9+7;
const ll INF = 1e18;
using namespace std;
int main()
{
//freopen("/home/taalpatar_shepai/Documents/my_codes/out.txt", "w", stdout);
// note: basket has it's own weight. keep it in mind.
unsyncIO;
int a[3];
int b[3];
for (int i = 0; i < 3; i++) {
cin >> a[i] >> b[i];
}
cout << a[0] - a[2] << " " << b[0] - b[1] << endl;
return 0;
}