2018 年 8月 23 日随笔档案 - erge1998

摘要： #include#include#include#include#include#include#include#include#include#include#include#define inf 0x3f3f3f3fusing namespace std;type... 阅读全文

posted @ 2018-08-23 13:21 erge1998 阅读(68) 评论(0) 推荐(0) 编辑

摘要： #include#include#include#include#include#include#include#include#include#include#include#define inf 0x3f3f3f3fusing namespace std;type... 阅读全文

posted @ 2018-08-23 13:19 erge1998 阅读(101) 评论(0) 推荐(0) 编辑

摘要： https://vjudge.net/problem/51197/origin#include#include#include#include#include#include#include#include#include#include#include#define... 阅读全文

posted @ 2018-08-23 13:16 erge1998 阅读(94) 评论(0) 推荐(0) 编辑

摘要： https://vjudge.net/problem/24768/origin#include#include#include#include#include#include#include#include#include#include#include#define... 阅读全文

posted @ 2018-08-23 13:15 erge1998 阅读(123) 评论(0) 推荐(0) 编辑

摘要： #include#define MAX_N 50005using namespace std;//求欧拉函数值 O(n^0.5)int euler[MAX_N];int sum[MAX_N];//o(MAX_N)时间筛出欧拉函数值的表void euler_phi2()... 阅读全文

posted @ 2018-08-23 13:13 erge1998 阅读(98) 评论(0) 推荐(0) 编辑

摘要： #include#include#include#includeusing namespace std; const int ma =30000005;int ans[30000005];void solve(){ int top=ma >> 1,b; f... 阅读全文

posted @ 2018-08-23 13:12 erge1998 阅读(59) 评论(0) 推荐(0) 编辑

摘要： #include#include#include#include#define maxn 10000000using namespace std;int a[maxn];int b[maxn];int n;long long pow(int a,int b){ ... 阅读全文

posted @ 2018-08-23 13:09 erge1998 阅读(87) 评论(0) 推荐(0) 编辑

摘要： #include#include#includeusing namespace std;const int MAX_N=100000000;int prime[MAX_N];//素数表bool is_prime[MAX_N+1];int n;//返回n以内的素数的个数... 阅读全文

posted @ 2018-08-23 13:07 erge1998 阅读(86) 评论(0) 推荐(0) 编辑

erge