- 博客(14)
- 资源 (23)
- 收藏
- 关注
原创 【欧拉函数模板】
单次lognint phi(int x){ int ret = x; for (int i = 2; i * i <= x; i++) { if (x % i == 0) { ret = ret / i * (i - 1); for (; x % i == 0; x /= i);
2015-10-11 08:29:06 427
原创 【求组合数模板】
for (int i = 0; i <= n; ++i) { C[i][0] = 1 % P; for (int j = 1; j <= i; ++j) { C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P; } }
2015-10-06 00:33:57 1226
原创 【树状数组】【尺取法】
#include // hdu5497#include #include #include using namespace std;#define lowbit(x) x&(-x)const int maxn = 1e5+10;int a[maxn];int t[2][maxn]; int n,m; typedef long long ll;int sum(in
2015-10-05 23:50:44 377
原创 树状数组模板
void add(int x){ for(int i=x;i<=n;i+=lowbit(i)) sum[i]++; } int query(int x){ int ret=0; for(int i=x;i>0;i-=lowbit(i)) ret+=sum[i]; return ret; }
2015-10-05 22:03:01 308
原创 前n个素数的乘积表
1, 2, 6, 30, 210, 2310, 30030, 510510, 9699690, 223092870, 6469693230, 200560490130, 7420738134810, 304250263527210, 13082761331670030, 614889782588491410
2015-10-01 23:55:00 1554
原创 筛选素数模板
#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; const int maxn = 1e7 + 10;bool t[maxn];int pri[maxn/
2015-10-01 21:24:28 593
原创 求n^k的前3位和后3位
E - Leading and TrailingTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit Status Practice LightOJ 1282DescriptionYou are given two integers: n and k, y
2015-10-01 20:59:50 466
原创 【lightoj1336】素数分解
1336 - Sigma FunctionPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBSigma function is an interesting function in Number Theory. I
2015-10-01 20:42:54 474
原创 【欧拉函数】【二分】【欧拉函数模板】
1370 - Bi-shoe and Phi-shoePDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBBamboo Pole-vault is a massively popular sport in Xzhil
2015-10-01 18:43:12 422
人工智能的未来
2018-12-13
数学建模matlab代码大礼包
2018-08-31
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人