
数学/反素数
数学/反素数
kelianlee
这个作者很懒,什么都没留下…
展开
-
Number With The Given Amount Of Divisors(反素数)
#include<cstdio> #include<algorithm> #include<cstring> #include<cmath> using namespace std; #define LL unsigned long long #define INF 0x3f3f3f3f #define MAXN 1005 int p[]={2,3...原创 2019-03-09 01:39:23 · 146 阅读 · 0 评论 -
More Divisors ZOJ - 2562(反素数)
#include <iostream> #include <cstdio> using namespace std; #define ll unsigned long long #define INF 0x3f3f3f3f3f3f3f3f ll n; ll ans; ll ans1; int p[16] = {2,3,5,7,11,13,17,19,23,29,31...转载 2019-03-10 15:38:45 · 128 阅读 · 0 评论 -
反素数 HDU - 2521
注意a==b的情况! #include <iostream> #include <cstdio> using namespace std; #define ll unsigned long long #define INF 0x3f3f3f3f3f3f3f3f int a,b; int p[16] = {2,3,5,7,11,13,17,19,23,29,31,37...原创 2019-03-10 18:29:03 · 164 阅读 · 0 评论