Indivisibility——Codeforce

IT City company developing computer games decided to upgrade its way to reward its employees. Now it looks the following way. After a new game release users start buying it actively, and the company tracks the number of sales with precision to each transaction. Every time when the next number of sales is not divisible by any number from 2 to 10 every developer of this game gets a small bonus.

A game designer Petya knows that the company is just about to release a new game that was partly developed by him. On the basis of his experience he predicts that n people will buy the game during the first month. Now Petya wants to determine how many times he will get the bonus. Help him to know it.

Input

The only line of the input contains one integer n (1 ≤ n ≤ 1018) — the prediction on the number of people who will buy the game.

Output

Output one integer showing how many numbers from 1 to n are not divisible by any number from 2 to 10.

Example
Input

12

Output

2

不会写 ，百度了题解。

容斥原理：要计算几个集合并集的大小，我们要先将单个集合的大小计算出来，然后减去两个集合相交的部分，再加回三个集合相交的部分，再减去四个集合相交的部分，以此类推，一直计算到所有集合相交的部分。
题意：
给你一个数n；要求求出1-n中不能被2-10整除的数；
被4，6，8整除的数一定能被2整除。
同理，我们只需要求出能被2,3,5,7整除的数的个数之和用之去减n即可得出答案。 由此需要用到上述的容斥原理。

#include<iostream>
#include<cstdio>
#include<string.h>
#include<string>
#include<queue>
#include<algorithm>
#include<vector>
using namespace std;
/*/集合 容斥原理要计算几个集合并集的大小，我们要先将单个集合的大小计算出来，然后减去两个集合相交的部分，再加回三个集合相交的部分，再减去四个集合相交的部分，以此类推，一直计算到所有集合相交的部分。

所以这个题目要求的是不是2 3 5 7的倍数，可以求是2 3 5 7的倍数之后，再减去即可。

这样就会用到容斥原理，先求仅仅只是整除2 3 5 7的数量，再减去整除了它们之间两两的乘积的数量，再加上整除它们三个之间的乘积的数量，再加上整除四个的数量。；*/
int main()
{
    long long a,b,c;
    while(scanf("%lld",&a)!=EOF)
    {
        long long sum;
        sum=(a-(a/2+a/3+a/5+a/7)+(a/6+a/10+a/14+a/15+a/21+a/35)-a/30-a/42-a/70-a/105+a/210);
        cout<<sum<<endl;
    }
    return 0;
}