Experimental Educational Round: VolBIT Formulas Blitz K. Indivisibility —— 容斥原理

题目链接：http://codeforces.com/contest/630/problem/K

K. Indivisibility

time limit per test

0.5 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

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.

Examples

input

12

output

2

题解：

实际上是除去2,3,5,7的倍数，容斥原理。

代码如下：

 #include<bits/stdc++.h>
 using namespace std;
 typedef long long LL;
 const double eps = 1e-;
 const int INF = 2e9;
 const LL LNF = 9e18;
 const int mod = 1e9+;
 const int maxn = 1e3+;

 int main()
 {
     LL n;
     cin>>n;
     LL ans = , a[] = {,,,};
     for(int s = ; s<(<<); s++)
     {
         LL cnt = , val = ;
         for(int j = ; j<; j++)
         if((<<j)&s)
         {
             cnt++;
             val *= a[j];
         }
         ans += (cnt&)? (n/val):(-n/val);
     }
     cout << n-ans <<endl;
 }