求 a 乘 b 对 p 取模的值。
数据范围
1≤a,b,p≤10^18
样例
输入样例:
3
4
5
输出样例:
2
a*b其实就是b个a相加:a+a+a+a+a....a+a+a+a
但是由于a和b都很,因此采用快速幂的思想
把 b写成二进制形式,然后如果二进制最后一位为1就加上它a*(2^n)次方(n与这位的位置有关)
并且每次计算后取模就可以了
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<stack>
#include<string>
#include<algorithm>
#include<unordered_map>
#include<map>
#include<bitset>
#include<cstring>
#include <unordered_set>
//#include<priority_queue>
#include<queue>
#include<deque>
#include<set>
#include<stdlib.h>
#define dbug cout<<"*****hear*****"<<endl;
#define rep(a,b,c) for(ll a=b;a<=c;a++)
#define per(a,b,c) for(ll a=b;a>=c;a--)
#define no cout<<"NO"<<endl;
#define yes cout<<"YES"<<endl;
#define endl "\n"//交互题一定要关!!!!!!!!!
#define lowbit(x) (x&-x)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//priority_queue<int,vector<int>,greater<int> >q;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> PII;
typedef pair<long double,long double> PDD;
ll INF = 0x3f3f3f3f;
//const ll LINF=LLONG_MAX;
// int get_len(int x1,int y1,int x2,int y2)
// {
// return (x2-x1)*(x2-x1) + (y2-y1)*(y2-y1);
// }
const ll N = 2e5+ 10;
// const ll mod1 =998244353;
const ll mod2 =1e9+7;
// const ll hash_num = 3e9+9;
ll n,m,ca;
ll arr[N],brr[N],crr[N],drr[N];
//ll h[N],ne[N],e[N],w[N],book[N],idx;
//ll idx;
// void add(ll a, ll b , ll c)
// {
// e[idx] = b, w[idx] = c,ne[idx] = h[a], h[a] =idx ++ ;
// }
void solve()
{
ll a,b,c;
cin >> a >> b >> c;
ll res=0;
while(b)
{
if(b&1)res=(res+a)%c;
b >>= 1;
a=(a*2)%c;
}
cout << res;
}
int main()
{
IOS;
ll _;
_=1;
//scanf("%lld",&_);
//cin>>_;
ca=1;
while(_--)
{
solve();
ca++;
}
return 0;
}