zoukankan      html  css  js  c++  java
  • hoj 大区间求质数个数 Count prime 线性筛素数

    题目来源:http://acm.hit.edu.cn/hoj/problem/view?id=2276

    Count prime

    My Tags   (Edit)
      Source : SCU Programming Contest 2006 Final
      Time limit : 1 sec   Memory limit : 64 M

    Submitted : 741, Accepted : 177

    Given an integer interval [L, R](L <= R <= 2147483647, R - L <= 1000000), please calculate the number of prime(s) in the interval.

    Input

    Multiple cases.
    There is one line in each case, which contains two integer: L, R.

    Output

    There is only one line for each case, which contains the number of prime(s) in the interval.

    Sample Input
    2 11
    Sample Output
    5
  • 相关阅读:
    8*8LED点阵
    红外收发基础
    MQTT服务器(Win)
    安卓图片显示与网络访问
    Liunx C 编程之多线程与Socket
    JAVA开始(基础篇)
    C语言数据类型及变量整理
    EOS基础全家桶(十五)智能合约进阶2
    EOS基础全家桶(十四)智能合约进阶
    EOS基础全家桶(十三)智能合约基础
  • 原文地址:https://www.cnblogs.com/zn505119020/p/3604857.html
Copyright © 2011-2022 走看看