• API
• FAQ
• Tools
• Archive
SHARE
TWEET

# Untitled

a guest Feb 10th, 2016 386 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
1. #include <bits/stdc++.h>
2.
3. #define forn(i, n) for (int i = 0; i < int(n); i++)
4. #define ford(i, n) for (int i = int(n) - 1; i >= 0; i--)
5. #define fore(i, l, r) for (int i = int(l); i < int(r); i++)
6. #define correct(x, y, n, m) (0 <= (x) && (x) < (n) && 0 <= (y) && (y) < (m))
7. #define all(a) (a).begin(), (a).end()
8. #define sz(a) int((a).size())
9. #define pb(a) push_back(a)
10. #define mp(x, y) make_pair((x), (y))
11. #define x first
12. #define y second
13.
14. using namespace std;
15.
16. typedef long long li;
17. typedef long double ld;
18. typedef pair<int, int> pt;
19.
20. template<typename X> inline X abs(const X& a) { return a < 0? -a: a; }
21. template<typename X> inline X sqr(const X& a) { return a * a; }
22.
23. const int INF = int(1e9);
24. const li INF64 = li(1e18);
25. const ld EPS = 1e-9, PI = 3.1415926535897932384626433832795;
26.
27. int h, m;
29.
31.     if (scanf("%d:%d%d", &h, &m, &add) != 3) return false;
32.     return true;
33. }
34.
35. inline void solve() {
37.         if (++m == 60) {
38.             m = 0;
39.             if (++h == 24) h = 0;
40.         }
42.     }
43.     printf("%02d:%02d\n", h, m);
44. }
45.
46. int main() {
47. #ifdef SU1
48.     assert(freopen("input.txt", "rt", stdin));
49.     //assert(freopen("output.txt", "wt", stdout));
50. #endif
51.
52.     cout << setprecision(10) << fixed;
53.     cerr << setprecision(5) << fixed;
54.