CodeForces-630 K. Indivisibility【容斥原理】

最新推荐文章于 2022-07-09 22:56:18 发布

hope1262946533

最新推荐文章于 2022-07-09 22:56:18 发布

阅读量333

点赞数

分类专栏：组合数学 =====codeforces=====

本文链接：https://blog.csdn.net/liuke19950717/article/details/50859225

版权

=====codeforces===== 同时被 2 个专栏收录

75 篇文章 0 订阅

订阅专栏

组合数学

15 篇文章 0 订阅

订阅专栏

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

题意：

问1-n 中多少个数不能被2-10中所有数整除

题解;

需要用到容斥原理，但是要转化一下，把含有公因子的元素处理后，就成了求1-n 中不能被2 3 5 7整除的数的个数了

#include<stdio.h>
#include<string.h>
using namespace std;
typedef long long ll;
int main()
{
    ll n;
    while(~scanf("%lld",&n))
    {
        ll ans=n-n/2-n/3-n/5-n/7;//一项
        ans=ans+n/6+n/10+n/14+n/15+n/21+n/35;//两项
        ans=ans-n/30-n/42-n/70-n/105;//三项
        ans=ans+n/210;//四项
        printf("%I64d\n",ans);
    }
    return 0;
}