CVBB ACM Team 2020-2021:teams:alchemist:weekly_digest_1
https://wiki.cvbbacm.com/
2026-04-30T05:03:00+0800
CVBB ACM Team
https://wiki.cvbbacm.com/
https://wiki.cvbbacm.com/lib/exe/fetch.php?media=favicon.ico
-
text/html
2020-05-09T12:48:28+0800
Anonymous (anonymous@undisclosed.example.com)
2020-2021:teams:alchemist:weekly_digest_1:hardict_code1
https://wiki.cvbbacm.com/doku.php?id=2020-2021:teams:alchemist:weekly_digest_1:hardict_code1&rev=1588999708&do=diff
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
using LL = long long;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
// Euler sieve
int prime[MAXN * 10], cnt_prime;
bool noprime[MAXN * 10];
int mu[MAXN * 10];
vector<int> nozero_mu;
void Euler_sieve(int n);
// main
int N, M, K;
int a[MAXN], b[MAXN], p[MAXN], coef[MAXN * 10];
LL discret[MAXN];
vector<int> fac[MAXN * 10], buck[MAXN * 10];
int solve(int d);
int main() {
//
…