Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define cin(vec) for(auto& i : vec) cin >> i
- #define cin_2d(vec, n, m) for(int i=0; i<n; i++) for(int j=0; j<m && cin >> vec[i][j]; j++);
- #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
- #define cout_2d(vec, r, c) for(int i=0; i<r; i++, cout << "\n") for(int j=0; j<c && cout << vec[i][j] << ""; j++)
- #define cout_map(mp) for(auto& [f, s] : mp) cout << f << " : " << s << "\n"
- #define matrix(grid, n, m) vector < vector <char> > grid(n, vector <char> (m));
- #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
- #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- #define fixed(n) cout << fixed << setprecision(n)
- #define Num_of_Digits(n) ((int)log10(n)+1)
- #define getline(s) getline(cin >> ws, s)
- #define to_decimal(bin) stoll(bin, nullptr, 2)
- #define TC int t; cin >> t; while(t--)
- #define rall(s) s.rbegin(), s.rend()
- #define all(s) s.begin(), s.end()
- #define sz(x) int(x.size())
- #define Pair pair <int, int>
- #define fi first
- #define se second
- #define ll long long
- #define PI acos(-1)
- #define Mod 1'000'000'007
- #define INF 2'000'000'000
- #define EPS 1e-9
- #define endl cout << "\n";
- void Anwar_Rizk(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- #ifndef ONLINE_JUDGE // Anwar Rizk 🥇🖤
- freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
- #endif
- }
- void solve(){
- int d, d1, d2, m, m1, m2, y, y1, y2;
- cin >> d1 >> m1 >> y1 >> d2 >> m2 >> y2;
- y = y2 - y1 - 1;
- int D = 30 - d1, M = 12 - (m1 + 1) + m2;
- int AllDays = M * 30 + D + d2;
- m = AllDays / 30;
- d = (AllDays/30.0 - m) * 30;
- if(m >= 12) y++, m -= 12;
- cout << d << (d > 1 ? " Days " : " Day ") << m << (m > 1 ? " Months " : " Month ") << y << (y > 1 ? " Years" : " Year");
- }
- int main()
- { Anwar_Rizk();
- int t = 1;
- //cin >> t;
- while(t--){
- solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement