Bus tours

#include <bits/stdc++.h>

#define REP(i, a, b) for (int i = a; i < b; i++)

// Type Aliases for 1D and 2D vectors with initialization
#define vll(n, val)  \
  vector<long long>( \
      n, val)  // 1D vector of long longs with size n, initialized to val
#define ll long long
#define vvi(n, m, val) \
  vector<vector<int>>( \
      n,               \
      vector<int>(m, val))  // 2D vector of ints (n x m), initialized to val
#define vvll(n, m, val)      \
  vector<vector<long long>>( \
      n, vector<long long>(  \
             m, val))  // 2D vector of long longs (n x m), initialized to val

using namespace std;

void print_vector(vector<int> &x) {
  for (int v : x) {
    cout << v << " ";
  }
  cout << "\n";
}

void print_matrix(vector<vector<int>> &matrix) {
  cout << "\n"
       << "----------------" << "\n";
  for (vector<int> row : matrix) {
    print_vector(row);
  }
  cout << "\n"
       << "----------------" << "\n";
}

int modpow(int x, int n, int m) {
  if (n == 0) return 1 % m;
  long long u = modpow(x, n / 2, m);
  u = (u * u) % m;
  if (n % 2 == 1) u = (u * x) % m;
  return u;
}

vector<int> factors(int n) {
  vector<int> f;
  for (int x = 2; x * x <= n; x++) {
    while (n % x == 0) {
      f.push_back(x);
      n /= x;
    }
  }
  if (n > 1) f.push_back(n);
  return f;
}

int euler_totient(int n) {
  vector<int> prime_factors = factors(n);
  // print_vector(prime_factors);
  int result = 1;
  int last_factor = 2;
  int last_factor_count = 0;
  for (int factor : prime_factors) {
    if (factor == last_factor) {
      last_factor_count++;
    } else {
      result *= (last_factor - 1);
      for (int i = 1; i < last_factor_count; i++) {
        result *= last_factor;
      }
      last_factor = factor;
      last_factor_count = 1;
    }
  }
  result *= (last_factor - 1);
  for (int i = 1; i < last_factor_count; i++) {
    result *= last_factor;
  }
  return result;
}

ll gcd(ll a, ll b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}

ll lcd(long a, long b) {
  ll g = gcd(a, b);
  return a * b / g;
}

int main() {
  int n, q;

  cin >> n >> q;

  vector<int> a(q);
  vector<int> b(q);

  for (int i = 0; i < q; i++) {
    cin >> a[i] >> b[i];
  }

  for (int i = 0; i < q; i++) {
    cout << lcd(a[i], n) / a[i] << "\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

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED