Alien Sunset

#include <iostream>
using namespace std;
int N;

int H[22222];
int R[22222];
int T[22222];

bool ok(int t){
  for (int i=0; i<N; ++i){
    int g=t%H[i];
    if (R[i]<=T[i]){
      if (R[i]<g && g<T[i]) return 0;
    }else{
      if (g<T[i] || R[i]<g) return 0;
    }
  }
  return 1;
}

int main(){
  cin >> N;
  int mxh=0;
  for (int i=0; i<N; ++i){
    cin >> H[i] >> R[i] >> T[i];
    mxh=max(mxh, H[i]);
  }
  for (int i=0; i<mxh*1825; ++i){
    if (ok(i)){
      cout << i << "\n";
      return 0;
    }
  }
  cout << "impossible\n";
}

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