Finding inverse

input/code.cpp: In function 'std::vector<long long int> factors(long long int)':
input/code.cpp:17:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int i = 1; i < size(f); i++) {
      |                     ~~^~~~~~~~~

#include <iostream>
#include <vector>
using namespace std;
#define int long long
 
vector<int> factors(int n) {
    vector<int> f;
    for (int i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            f.push_back(i);
            n /= i;
        }
    }
    if (n > 1) f.push_back(n);
    vector<int> ff;
    ff.push_back(f[0]);
    for (int i = 1; i < size(f); i++) {
        if (f[i] != ff[size(ff) - 1]) ff.push_back(f[i]);
    }
    return ff;
}
 
int euler(int n, const vector<int>& f) {
    int c = n;
    if (size(f) == 1) return n - 1;
    for (int d : f) {
        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> f = factors(M);
    int e = euler(M, f);
 
    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: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED