Ostrichcrab的博客

容斥原理+组合数学。。#include<cstdio>#define ll long longusing namespace std;int main(){ ll n; scanf("%lld",&n); ll ans = 0; ans+=n/2; ans+=n/3; ans+=n/5; ans+=n/7; ans-=n/2/3; ans-=n/...

先把n素因子分解，再用位运算，枚举倍数，加上容斥原理#include<stdio.h>#include<vector>using namespace std;#define ll long longll work(ll r, ll n){ vector<ll> p; for(ll i = 2; i * i <= n; i++){ if...