摘要：
#include#include#include#include#include#include#include#include#include#include#include#include#define tree int o,int l,int r#define lson on) ans+=n-f[i-1]+1; else ans+=n-f[i-1]; } return ans;}bool check(LL k,LL m){ LL t=log10(k); if(k/f[t]==1&&k%f[t]==0&&t+... 阅读全文
