1692D - The Clock - CodeForces Solution

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

void seive(bool primes[], int n) {
    for (int i = 1; i <= n; i++) {
        primes[i] = 1;
    }
    primes[1] = 0;
    primes[0] = 0;

    int x = sqrt(n);
    for (int i = 2; i <= x; i++) {
        if (primes[i] == 1) {
            for (int j = i * i; j <= n; j += i) {
                primes[j] = 0;
            }
        }
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie();

    int arr[16]={0,70,140,280,210,350,601,671,741,811,881,951,1202,1272,1342,1412};
    int t;
    cin >> t;
    while (t--){
       string s;
       int x;
       cin >> s >> x;
       int c=0;
       c+=(int)(s[0]-48)*60*10;
       c+=(int)(s[1]-48)*60;
       c+=(int)(s[3]-48)*10;
       c+=(int)(s[4]-48);
       map<int ,int>m;
//       cout << c<<endl;
       int cnt = 0;
       int e=0;
//       cout << c;
       int y = 10000;
       while(y--)
       {
//           e+=x;
           for (int i = 0; i < 16; ++i) {
              if(c==arr[i] && m[arr[i]]!=5){
                  cnt++;
                  m[arr[i]]=5;
              }
           }
           c+=x;
           c=(c%1440);


       }
       cout << cnt<<endl;
    }

}