abc228 E(费马小定理)

题目

一直没发现哪里错了，直到同学说了幂指数取模和结果取模不一样。。。

代码: just 快速幂

// Problem: E - Integer Sequence Fair
// Contest: AtCoder - TOYOTA SYSTEMS Programming Contest 2021(AtCoder Beginner Contest 228)
// URL: https://atcoder.jp/contests/abc228/tasks/abc228_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i>= 1;
	}
	return res % mod;
}
void solve()
{
   read(n); read(k); read(m);
   if(m % mod == 0) 
   {
      puts("0"); return ;
   }
   int ans = qpow(m,qpow(k,n,mod-1),mod);
   write(ans);
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   // read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}