dukig的博客

typedef long long ll;ll fac[10050], num;//素因数,素因数的个数void init(ll n) {//唯一分解定理 num = 0; ll cpy = n; int m = (int)sqrt(n + 0.5); for (int i = 2; i <= m; ++i) { if (cpy % i ...

链接:https://vjudge.net/problem/UVA-10375题意：给定公式 C(m,n) = m!/((m-n)！*n!)),给定4个数p,q,r,s,求C(p,q)/C(r,s);思路：为阶层的每一个数用唯一分解定理分解。这种大数相除精度高的题要用唯一分解定理。#include<iostream>#include<algorithm>...

链接：https://vjudge.net/problem/POJ-1845题意：给定2个自然数a,b，求a^b的所有约数的和#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#define mod 99...