![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
ArcWarden
这个作者很懒,什么都没留下…
展开
-
SPOJ 3871 GCD Extreme
#include#include#include#include#define N 1000001#define ll long longusing namespace std;int p[N];ll a[N];void solve(){ for(int i=2;i for(ll i=2;i {原创 2014-07-18 21:12:53 · 321 阅读 · 0 评论 -
FZU1759 Super A^B mod C
//用公式A^B % C = A ^(B % PHI(C) + PHI(C) ) % C处理一下B,注意B是大数,所以要用大数取模的方法,然后进行常规的幂取模。#include#include#include#include#define ll long longusing namespace std;ll A,B,C;ll geteular(ll n){原创 2014-07-18 14:41:26 · 497 阅读 · 0 评论