奔跑的蜗牛_🐌

分类

未归档(2)

/ 注册

全部文章（共2篇）

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...

2019-07-17

0 587

莫比乌斯反演模板

#include <bits/stdc++.h> using namespace std; const int mx = 1e5+5; typedef long long ll; bool vis[mx]; int sum[mx], prim[mx], mu[mx], cnt = 0...

2019-07-16

0 510