摘要: 数论:当gcd(x,m)=1时,x^(m-1) mod m=1,#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <vector>using namespace std;const int mod = 1000000006;const int mod1= 1000000007;struct node{ long long a,b,c,d;}org;node pows(int m)//n^m{ node ans,tmp; 阅读全文
posted @ 2013-05-19 15:18 qijinbiao1 阅读(682) 评论(0) 推荐(1) 编辑