main
黄海 2 years ago
parent f4348cf5f3
commit 04ff9f7841

@ -1,20 +1,18 @@
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define ll_inf 1ll << 60
const int maxn = 100 + 100;
ll mu[maxn * 100], prim[maxn * 100], check[maxn * 100];
const int N = 100 + 100;
ll mu[N * 100], prim[N * 100], check[N * 100];
int tot = 0;
void getmu() {
mu[1] = 1;
for (int i = 2; i < maxn; i++) {
for (int i = 2; i < N; i++) {
if (!check[i]) {
prim[tot++] = i;
mu[i] = -1;
}
for (int j = 0; j < tot; j++) {
if (prim[j] > maxn / i) {
if (prim[j] > N / i) {
break;
}
check[i * prim[j]] = 1;

Loading…
Cancel
Save