zoukankan      html  css  js  c++  java
  • Codeforces--630J--Divisibility(公倍数)

    
    J - Divisibility

    Crawling in process... Crawling failed Time Limit:500MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

    Description

    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.

    Sample Input

    Input
    3000
    
    Output
    1
    求在1--n中可以被2--10全部整除的数字的个数,很明显,被2--10全部整除就是求2--10这几个数的最小公倍数,好吧,就是2520
    #include<cstdio>
    #include<iostream>
    using namespace std;
    int main()
    {
    	__int64 n;
    	while(cin>>n)
    	{
    		cout<<n/2520<<endl;
    	}
    	return 0;
    }

  • 相关阅读:
    RedisCacheTool参考其中的文件读写功能
    eclipse eayExplorer 查看代码的资源管理器打开方式
    有关写代码效率的问题
    Eclipse
    解决pdm打开只显示表名不显示字段的步骤
    绝对定位元素的水平垂直居中
    Maven依赖之Scope
    无提示关闭弹出窗口
    Maven模块与模块间的依赖
    Maven+Hibernate4注解0配置示例
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273413.html
Copyright © 2011-2022 走看看