zoukankan      html  css  js  c++  java
  • 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的倍数,容斥原理。

    代码如下:

     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 typedef long long LL;
     4 const double eps = 1e-6;
     5 const int INF = 2e9;
     6 const LL LNF = 9e18;
     7 const int mod = 1e9+7;
     8 const int maxn = 1e3+10;
     9 
    10 int main()
    11 {
    12     LL n;
    13     cin>>n;
    14     LL ans = 0, a[4] = {2,3,5,7};
    15     for(int s = 1; s<(1<<4); s++)
    16     {
    17         LL cnt = 0, val = 1;
    18         for(int j = 0; j<4; j++)
    19         if((1<<j)&s)
    20         {
    21             cnt++;
    22             val *= a[j];
    23         }
    24         ans += (cnt&1)? (n/val):(-n/val);
    25     }
    26     cout << n-ans <<endl;
    27 }
    View Code


  • 相关阅读:
    java中的io笔记
    Android面试
    使用org.apache.commons.net.ftp包开发FTP客户端,实现进度汇报,实现断点续传,中文支持
    linux基本命令学习
    jmeter简单的压力测试
    linux配置tomcat项目包
    linux配置jdk环境
    mysql插入大量数据
    jmeter压测mysql数据库
    selenium+python自动化元素定位
  • 原文地址:https://www.cnblogs.com/DOLFAMINGO/p/7538656.html
Copyright © 2011-2022 走看看