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
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a,  b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ITH_BIT(m, i) ((m)>>(i) & 1)
#define PPC(x) __builtin_popcount(x)

using namespace std;

#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = std::min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = std::max(a, (T1)b);	}

const int maxN = 1 << 19, mod = 998244353;

int timestamp(int d, int h, int m)
{
	static const std::pair <int, int> MISSED_HOUR = {29, 2};
	std::pair <int, int> currentHour = {d, h};

	h += d * 24;
	m += h * 60;

	if (MISSED_HOUR < currentHour)
		m -= 60;

	return m;
}

int border(int round)
{
	int d = 23 + round + 1 + (round == 5);
	return timestamp(d, 0, 0);
}

void solve()
{
	int x, d, h, m;
	scanf ("%d%d%d%d", &x, &d, &h, &m);

	int now = timestamp(d, h, m);
	int deadline = border(x);
	int result = std::max(deadline - now, 0);
	printf("%d\n", result);
}

int main()
{
	int tc = 1;
//	scanf ("%d", &tc);	

	FOR(cid, 1, tc+1)
	{
//		printf("Case #%d: ", cid);
		solve();
	}
	return 0;
}