『算法-ACM 竞赛-数学-数论』HDU 1299 +POJ 2917 Diophantus of Alexandria （因子个数函数+公式推导）Diophantus of Alexandria was an egypt mathematician living in Alexandria. He was one of the first mathematicians to study equa

『算法-ACM 竞赛-数学-数论』HDU 12151 七夕节七夕节 Problem Description七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:”你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!”人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下: 数字 N 的因子就是所有比 N 小又能被 N 整除的所有正整数,如 12 的因子有 1,2,3

『算法-ACM 竞赛-数学-数论』HDU 12151 七夕节 Plus （因子和线性筛）Problem Description 12七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下: 12数字N的因子就是所有比N小又能被N整除的所

『算法-ACM 竞赛-数学-数论』HDU 1098 Ignatius’s puzzle （费马小定理+打表）Ignatius’s puzzle Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this pro

『算法-ACM 竞赛-数学-数论』HDU - 6395 Let us define a sequence as below 分段矩阵快速幂Your job is simple, for each task, you should output Fn module 109+7.InputThe first line has only one integer T, indicates the numb

『算法-ACM 竞赛-数学-数论』HDU - 6322 打表找规律123456789101112131415161718In number theory, Euler's totient function φ(n) counts the positive integers up to a given integer n that are relatively prime to n. It

『算法-ACM 竞赛-数学-数论』HDU - 6124 Euler theorem (打表找规律）HazelFan is given two positive integers a,b， and he wants to calculate amodb. But now he forgets the value of b and only remember the value of a, pleas

『算法-ACM 竞赛-数学-数论』Find Integer（勾股数定理）Problem Description 12345people in USSS love math very much, and there is a famous math problemgive you two integers n,a,you are required to find 2 integers b,c suc

『算法-ACM 竞赛-数学-数论』Alice and Bob (CodeForces - 346A )推导12345678910111213141516It is so boring in the summer holiday, isn't it? So Alice and Bob have invented a new game to play. The rules are as fo

『算法-ACM 竞赛-数学-数论』-欧拉筛 模板ACM 常用模板合集123456789101112131415161718192021222324252627typedef long long ll;bool ok[maxn];int prime[maxn],phi[maxn],cnt;void sieve(){ phi[1]=1; for(ll i=2;i<maxn