题目链接:https://ac.nowcoder.com/acm/problem/15079
题意:
题解:由于n太大直接枚举肯定不行,可以用容斥原理,先求出2,5,11,13各自的倍数个数用n减去它们的和,但发现它们中的共同倍数会被减多次,因此还要加上两两各自的倍数个数,以此类推,最后形成加减交错的式子。
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
while(cin>>n){
ll a=n/2+n/5+n/11+n/13;
ll b=n/(2*5)+n/(2*11)+n/(2*13)+n/(5*11)+n/(5*13)+n/(11*13);
ll c=n/(2*5*11)+n/(2*5*13)+n/(5*11*13)+n/(2*11*13);
ll d=n/(2*5*11*13);
cout<<n-(a-b+c-d)<<endl;
}
return 0;
}