codeforces_630J_Divisibility
2016-03-05 16:33
2461 查看
J. Divisibility
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 invented a new way to reward its employees. 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 divisible by all numbers 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
divisible by all numbers from 2 to 10.
Examples
input
output
第一次试着打cf的简单题,三个小时只过了5题,渣渣的。
这道题其实就是求出2—10的最小公倍数2520就好了。
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 invented a new way to reward its employees. 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 divisible by all numbers 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
divisible by all numbers from 2 to 10.
Examples
input
3000
output
1
第一次试着打cf的简单题,三个小时只过了5题,渣渣的。
这道题其实就是求出2—10的最小公倍数2520就好了。
#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> using namespace std; int main() { long long n; scanf("%lld",&n); long long ans=n/2520; printf("%lld\n",ans); return 0; }
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query
- Codeforces Gym100342E Minima