Language: C++

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

#define st              first
#define nd              second
#define pb              push_back
#define lwb             lower_bound
#define upb             upper_bound
#define Size(a)         int((a).size())
#define reset(s, n)     memset(s, n, sizeof(s))
#define bit(n, i)       (((n) >> (i)) & 1)
#define cntbit(n)       __builtin_popcountll(n)
#define all(a)          (a).begin(), (a).end()
#define unique(a)       (a).resize(unique(all(a)) - (a).begin())
#define Max(a, b, c)    max(max((ll)(a), (ll)(b)), (ll)(c))
#define Min(a, b, c)    min(min((ll)(a), (ll)(b)), (ll)(c))

typedef long double ld;
typedef long long ll;

const int MOD = 1e9 + 7;
const ll INF = 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-7;
inline ll fpow(ll n, ll k, ll p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
inline int inv(int a, ll p = MOD) {return fpow(a, p - 2, p);}
inline ll lcm(ll a, ll b) {return a / __gcd(a, b) * b;}
inline void onbit(ll &a, int i){a |= 1LL << i;}
inline void offbit(ll &a, int i){onbit(a, i), a -= (1LL << i);}

const int N = 1e5 + 5;

ll n, m, k;

int size_clique = 0;
int root;

int visit[N];
vector<long long> clique;
vector<long long> a;
vector<long long> f;

void dfs(int u){
  visit[u] = 1;
  if(!visit[f[u]]){
    dfs(f[u]);
  } else{
    u = f[u];
    root = u;
    clique[0] = u;
    while(f[u] != root){
      u = f[u];
      clique[++size_clique] = u;
    }
    size_clique++;
  }
}

void solve(){
  clique.assign(N, 0);
  a.assign(N, 0);
  f.assign(N, -1);
  ll x;
  cin >> n >> x >> m;
  a[1] = x;
  for(int i = 2; i < N; i++){
    long long value = (a[i - 1] * a[i - 1]) % m;
    a[i] = value;
    if(a[i] == 0){
      long long res = 0;
      for(int i = 1; i <= n; i++){
        res += a[i];
      }
      return;
    }
    f[a[i - 1]] = a[i];
    if(f[a[i]] != -1){
      break;
    }
  }

  dfs(x);
  int cnt = 0;
  long long res = 0;
  for(int i = 1; i <= n; i++){
    if(a[i] != root){
      res += a[i];
      cnt++;
    } else{
      break;
    }
  }

  for(int i = 1; i < size_clique; i++){
    clique[i] += clique[i - 1];
  }

  n -= cnt;

  int p = n / size_clique;
  res += p * clique[size_clique - 1];
  cout << res << "\n";

  n %= size_clique;

  if(n > 0)
    res += clique[n - 1];

  cout << res << "\n";



}

main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0); 
  cout.tie(0);
  cout << fixed << setprecision(10);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  int query = 1;
  // cin >> query;
  int start = 1000 * clock() / CLOCKS_PER_SEC;
  while(query--) solve();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC  - start << "ms\n";
}


Compiler output:
a.cc: In function 'void dfs(int)':
a.cc:44:3: error: reference to 'visit' is ambiguous
   44 |   visit[u] = 1;
      |   ^~~~~
In file included from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:80,
                 from a.cc:1:
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:38:5: note:                 'int visit [100005]'
   38 | int visit[N];
      |     ^~~~~
a.cc:45:7: error: reference to 'visit' is ambiguous
   45 |   if(!visit[f[u]]){
      |       ^~~~~
/usr/include/c++/14/variant:1855:5: note: candidates are: 'template<class _Visitor, class ... _Variants> constexpr std::__detail::__variant::__visit_result_t<_Visitor, _Variants ...> std::visit(_Visitor&&, _Variants&& ...)'
 1855 |     visit(_Visitor&& __visitor, _Variants&&... __variants)
      |     ^~~~~
a.cc:38:5: note:                 'int visit [100005]'
   38 | int visit[N];
      |     ^~~~~
a.cc: At global scope:
a.cc:115:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  115 | main(){
      | ^~~~