『算法-ACM 竞赛-数学-数论』HDU 5019 revenge of GCDRevenge of GCD Problem Description In mathematics, the greatest common divisor (gcd), also known as the greatest common factor (gcf), highest common factor (hcf

『算法-ACM 竞赛-数学-数论』HDU 4675 GCD of Sequence(莫比乌斯反演+卢卡斯定理求组合数+乘法逆元+快速幂取模）先放知识点：莫比乌斯反演卢卡斯定理求组合数乘法逆元快速幂取模 GCD of Sequence 12345678910 Alice is playing a game with Bob.Alice shows N integers a 1, a 2, …, a

『算法-ACM 竞赛-数学-数论』HDU 2802 F(N) 公式推导或矩阵快速幂Giving the N, can you tell me the answer of F(N)?InputEach test case contains a single integer N(1<=N<=10^9). The input is terminated by a set

『算法-ACM 竞赛-数学-数论』HDU 2582 F(N) 暴力打表找规律This time I need you to calculate the f(n) . (3<=n<=1000000) f(n)= Gcd(3)+Gcd(4)+…+Gcd(i)+…+Gcd(n).Gcd(n)=gcd(C[n][1],C[n][2],……,C[n][n-

『算法-ACM 竞赛-数学-数论』HDU 2197 本原串 (推规律）由 0 和 1 组成的串中，不能表示为由几个相同的较小的串连接成的串，称为本原串，有多少个长为 n（n<=100000000)的本原串？答案 mod2008.例如，100100 不是本原串，因为他是由两个 100 组成，而 1101 是本原串。Input输入包括多个数据，每个数据一行，包括一个整数 n，代表串的长

『算法-ACM 竞赛-数学-数论』HDU 2136（素数筛选法）Everybody knows any number can be combined by the prime number.Now, your task is telling me what position of the largest prime factor.The position of prime 2 is 1, prim

『算法-ACM 竞赛-数学-数论』HDU 2104 丢手绢（离散数学 mod N+ 剩余类 生成元）+（最大公约数）The Children’s Day has passed for some days .Has you remembered something happened at your childhood? I remembered I often played a game calle

『算法-ACM 竞赛-数学-数论』HDU 1792 A New Change Problem （GCD+打表找规律）Problem DescriptionNow given two kinds of coins A and B,which satisfy that GCD(A,B)=1.Here you can assume that there are enough coins for

『算法-ACM 竞赛-数学-数论』HDU 1495 非常可乐Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是 seeyou 却不这么认为。因为每次当 seeyou 买了可乐以后，阿牛就要求和 seeyou 一起分享这一瓶可乐，而且一定要喝的和 seeyou 一样多。但 seeyou 的手中只有两个杯子，它们的容量分别是 N 毫升和 M 毫升 可乐的体积为 S （S<1

『算法-ACM 竞赛-数学-数论』Hdu 1452 Happy 2004（积性函数性质+和函数公式+快速模幂+乘法逆元）Consider a positive integer X,and let S be the sum of all positive integer divisors of 2004^X. Your job is to determine S modulo 29 (the res