Finding inverse

#include <iostream>
#include <vector>
using namespace std;
#define int long long
 
vector<int> sieve_primes(int n) {
    vector<int> primes = {2};
    for (int i = 3; i <= n / 2; i += 2) {
        bool is_prime = true;
        for (int p : primes) {
            if (i % p == 0) {
                is_prime = false;
                break;
            }
        }
        if (is_prime) {
            primes.push_back(i);
        }
    }
    return primes;
}
 
int euler(int n, const vector<int>& primes) {
    vector<int> div;
    for (int p : primes) {
        if (n % p == 0) {
            div.push_back(p);
        }
    }
    if (div.empty()) {
        return n - 1;
    }
    int c = n;
    for (int d : div) {
        c *= (d - 1);
        c /= d;
    }
    return c;
}
 
int fast_exp(int a, int b, int mod) {
    if (b == 0) {
        return 1;
    }
    int g = 1;
    while (b > 1) {
        if (b % 2 == 1) {
            g = (g * a) % mod;
            b--;
        }
        a = (a * a) % mod;
        b /= 2;
    }
    return (a * g) % mod;
}
 
signed main() {
    int a, M;
    cin >> a >> M;
 
    vector<int> primes = sieve_primes(M);
    int e = euler(M, primes);
 
    int r = fast_exp(a, e - 1, M);
 
    if ((r * a) % M == 1) {
        cout << r << endl;
    } else {
        cout << -1 << 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: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED