CF630K:Indivisibility(容斥)
2016-03-12 21:07
197 查看
Indivisibility
Time Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
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.
Sample Input
Input
Output
2
解体思路:算出2的倍数,3的倍数,5的倍数,7的倍数,减去任意两个数的倍数,加上任意三个数的倍数,减去任意4个数的倍数
代码如下:
Time Limit:500MS Memory Limit:65536KB 64bit IO Format:%I64d
& %I64u
Submit Status
Description
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.
Sample Input
Input
12
Output
2
解体思路:算出2的倍数,3的倍数,5的倍数,7的倍数,减去任意两个数的倍数,加上任意三个数的倍数,减去任意4个数的倍数
代码如下:
#include<stdio.h> int main(){ long long n,m,x,ans; while(scanf("%lld",&n)!=EOF){ ans=n/2+n/3+n/5+n/7-n/6-n/10-n/14-n/15-n/21-n/35+n/30+n/42+n/70+n/105-n/210; printf("%lld\n",n-ans); } return 0; }
相关文章推荐
- Android中为什么主线程不会因为Looper.loop()里的死循环卡死?
- FZU 2110
- js各种距离区分
- java2的三个版本
- C++抽象类
- 如何使用 Java 8 实现观察者模式
- java设计模式--责任链(一)
- 【cocos2dx 3.2】2048
- logstash的kafka插件使用
- 离线应用程序
- C++怎么调用C#生成的dll文件
- 动态内存简介
- 16. 在工厂方法中读取配置,生成可配置化的对象
- Java中非静态内部类对象持有外部类对象的引用。
- ServletContextListener 详解
- Android 各个版本WebView
- 选取文字的聪明文字联想(Textselection与InputConnection)
- rsyslog与Kafka结合使用
- Node.js 我为何理解客户端多可见了呢
- C++ —— 运算符重载