随笔分类 - 莫比乌斯反演

HDU-6053 TrickGCD

摘要：题目连接： https://vjudge.net/problem/HDU 6053 Description You are given an array A , and Zhu wants to know there are how many different array B satisfy th 阅读全文

posted @ 2019-07-17 10:20 奔跑的蜗new 阅读(141) 评论(0) 推荐(0) 编辑

莫比乌斯反演模板

摘要：#include using namespace std; const int mx = 1e5+5; typedef long long ll; bool vis[mx]; int sum[mx], prim[mx], mu[mx], cnt = 0; void get_mu(){ mu[1] = 1; for(int i = 2; i< mx; i++){ ... 阅读全文

posted @ 2019-07-16 19:56 奔跑的蜗new 阅读(126) 评论(0) 推荐(0) 编辑