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
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << (x) << '\n'

const int beg_h = 12, beg_m = 12, end_h = 24, end_m = 0;

struct runda {
  int nr;
  int p_d;
  int d_d;

  runda(int numer, int poczatek) {
    nr = numer;
    p_d = poczatek;
    d_d = (poczatek < 27) ? poczatek + 1 : 29;
  }
};

void solve(void) {
  int x, d, h, m; cin >> x >> d >> h >> m;

  vector<runda> rundy;
  for (int i = 1; i <= 5; i++) {
    rundy.emplace_back(i, 22 + i);
  }

  runda obecna = rundy[x - 1];

  auto do_konca_dnia = [&] (int h, int min, int k_h, int k_min) {
    return 60 * (k_h - h) + k_min - min;
  };

  int ans = do_konca_dnia(h, m, end_h, end_m);
  if (x == 5) {
    if (d < 29 || h < 2) {
      ans -= 60;
    }

    if (d < 29) {
      ans += do_konca_dnia(0, 0, end_h, end_m) * (29 - d);
    }
  } else {
    if (d == obecna.p_d) {
      ans += do_konca_dnia(0, 0, end_h, end_m);
    }
  }
  cout << ans << "\n";
}

signed main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int t;
  t = 1;
  // cin >> t;
  while (t--) solve();
  return 0;
}