qq_40293424的博客

题目链接https://vjudge.net/problem/HDU-1999s(n)是正整数n的真因子之和，即小于n且整除n的因子和.例如s(12)=1+2+3+4+6=16.如果任何数m，s(m)都不等于n,则称n为不可摸数.Input包含多组数据，首先输入T,表示有T组数据.每组数据1行给出n(2<=n<=1000)是整数。Output如果n是不可摸数，...

题目链接https://vjudge.net/problem/UVA-294题目大意，求一个区间内哪个数的约数最多，输出该数和其约数的数目例如 3-10 6的约数最多有4个（1 2 3 6）求取约数个数公式m=(p1)^(x1)*(p2)^(x2)*(p3)^(x3)*……其中p1,p2,p3...是质数（素数）,x1,x2,x3...是它们的指数则m的约数的个数是(x...

Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:Every even integer, greater than 2, can be expressed as the sum of two primes [1]....