2011年8月1日
PKU 2429 GCD & LCM Inverse
摘要： 大数分解pollard-rho素数判定miller-rabin#include<stdio.h>#include<time.h>#include<stdlib.h>#define LL unsigned long long#define nmax 2005LL factor[nmax], num[nmax], minx, ans;int flen, nnum;LL modular_multi(LL a, LL b, LL c) { LL ret; ret = 0, a %= c; while (b) { if (b & 1) { ret += a; 阅读全文
posted @ 2011-08-01 16:06 qingyezhu 阅读(350) 评论(0) 推荐(0)