51nod 1284 2、3、5、7的倍数 （容斥原理）

题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1284

解题方案：容斥原理

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

using namespace std;

#define FOR(i,k,n) for(int i=k;i<n;i++)
#define FORR(i,k,n) for(int i=k;i<=n;i++)
#define scan(a) scanf("%d",&a)
#define scann(a,b) scanf("%d%d",&a,&b)
#define scannn(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define mst(a,n)  memset(a,n,sizeof(a))
#define ll long long
#define N 1005
#define mod 1000000007
#define INF 0x3f3f3f3f

const double eps=1e-8;
const double pi=acos(-1.0);


int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);

	ll n;
	cin>>n;
	ll ans=n/2+n/3+n/5+n/7-n/(2*3)-n/(2*5)-n/(2*7)-n/(3*5)-n/(3*7)-n/(5*7)+n/(2*3*5)+n/(2*3*7)+n/(2*5*7)+n/(3*5*7)-n/(2*3*5*7);
	cout<<n-ans<<endl;
    return 0;
}