spnooyseed的博客

#include <bits/stdc++.h>#pragma GCC optimize(3 , "Ofast" , "inline")using namespace std;typedef long long ll ;const int INF = 0x3f3f3f3f , N = 1e5 + 10 ;const int mod = 998244353 ; void re...

莫比乌斯反演欧拉降幂#include <bits/stdc++.h>using namespace std;typedef long long ll ;const int mod = 59964251 ;const int N = 1e5 + 10 ;int prime[N] , vis[N] , mu[N] , tot , sum[N] ;ll qmi(ll a , ...

区间加 ， 区间最值#include <bits/stdc++.h>#pragma GCC optimize(3 , "Ofast" , "inline")using namespace std;typedef long long ll ;const int INF = 0x3f3f3f3f , N = 1e5 + 10 ;void read(int &x){ ...