[51nod1742]開心的小Q 數論分塊

[51nod1742] Solution #include<bits/stdc++.h> #define rep(i,a,b) for(ll i=(a);i<=(b);i++) #define ll long long using namespace std; const ll N=1e5; ll v[N],cnt,l,r; ll sum(ll x,ll n){ ll last=1,r; ll

>>阅读原文<<