We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Mathematics
  3. Number Theory
  4. Primitive Problem
  5. Discussions

Primitive Problem

  • subhajit104
     + 3 comments
    #include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll n , s_primitive,number;

ll power(ll a, ll b, ll mod){
    if(b == 0)
        return 1;
    ll temp = power(a,b>>1,mod)%mod;
    temp = (temp*temp)%mod;
    if(b&1)
        temp = temp*a%mod;
    return temp;
}