Submission #20383255

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<bitset>
#include<deque>
#include<cstdlib>
#include<set>
#include<ctime>
#define ll long long
#define mp make_pair
using namespace std;
ll read()
{
	ll x=0,f=1;
	char c=getchar();
	while(c>'9'||c<'0')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return f*x;
}
int mts[12];
ll A,B,C;
ll pow_mod(ll a,ll b,ll mod)
{
	ll ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		a=a*a%mod;
		b>>=1;
	}
	return ans;
}
int main()
{
	for(int i=2;i<=9;++i)
	{
		int num=1,tmp=i;
		num++;
		tmp=tmp*i%10;
		while(tmp!=i)
		{
			num++;
			tmp=tmp*i%10;
		 } 
		mts[i]=num;
	//	cout<<i<<": "<<mts[i]<<'\n';
	}
	A=read(),B=read(),C=read();
	if(A%10==1) cout<<1<<'\n';
	else if(A%10==0) cout<<0<<'\n';
	else 
	{
		ll tmp=pow_mod(B,C,mts[A%10]-1);
	//	cout<<tmp<<'\n';
		if(!tmp) tmp+=mts[A%10]-1;
		cout<<pow_mod(A,tmp,10)<<'\n';

		
	}
	return 0;
 }

Submission Info

Judge Result