Alien Sunset

#include <bits/stdc++.h>
using namespace std;


int h[21];
int l[21][100];

int main() {
  int n;
  cin >> n;
  int ld = 0;
  for(int i=0;i<n;i++) {
    int r, t;
    cin >> h[i] >> r >> t;
    ld = max(ld, h[i]);
    if(t<r){
      for(int j=0;j<h[i];++j)l[i][j]=1;
      while(t<=r)l[i][t++]=0;
    }
    else if (t>r){
      while(++r<t)l[i][r]=1;
    }
  }
  for(int ct=0;ct<ld*1825;ct++) {
    int foo=0;
    for(int i=0;i<n;++i)foo+=1-l[i][ct%h[i]];
    if(foo == n) {
      cout << ct << endl;
      return 0;
    }
  }
  cout << "impossible" << endl;
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED