sicily 1500. Prime Gap

原创 2015年11月17日 16:38:12

1500. Prime Gap

Constraints

Time Limit: 1 secs, Memory Limit: 32 MB

Description

The sequence of n ? 1 consecutive composite numbers (positive integers that are not prime and not equal to 1) lying between two successive prime numbers p and p + n is called a prime gap of length n. For example, 24, 25, 26, 27, 28 between 23 and 29 is a prime gap of length 6.

Your mission is to write a program to calculate, for a given positive integer k, the length of the prime gap that contains k. For convenience, the length is considered 0 in case no prime gap contains k.

Input

The input is a sequence of lines each of which contains a single positive integer. Each positive integer is greater than 1 and less than or equal to the 100000th prime number, which is 1299709. The end of the input is indicated by a line containing a single zero.

Output

The output should be composed of lines each of which contains a single non-negative integer. It is the length of the prime gap that contains the corresponding positive integer in the input if it is a composite number, or 0 otherwise. No other characters should occur in the output.

Sample Input

10
11
27
2
492170
0

Sample Output

4
0
6
0
114

题目分析

如果输入为素数,则输出0
否则输出左右两个素数的差
考察筛法求素数


#include <stdio.h>
#include <memory.h>

int prime[100000];
int count;

void init() {
  bool visited[1299710];
  memset(visited, true, sizeof(visited));
  for (int c = 2; c < 1299710; ++c)
    if (visited[c])
      for (int d = c + c; d < 1299710; d += c)
        visited[d] = false;
  count = 0;
  for(int c = 2; c < 1299710; ++c)
    if (visited[c])
      prime[count++] = c;
}

int main()
{
  init();
  
  int key;
  while (scanf("%d", &key) && key) {
    for (int c = 0; c < count; ++c) {
      if (key == prime[c]) {
        printf("0\n");
        break;
      } else if (key < prime[c]) {
        printf("%d\n", prime[c] - prime[c - 1]);
        break;
      }
    }
  }
  return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

Sicily 1500. Prime Gap

Description The sequence of n ? 1 consecutive composite numbers (positive integers that are not...

1500 Prime Gap + 判定素数isPrime的三种方法

#include #include using namespace std; const int N=1000; int prime1[N]; int num,j,k; bool isPrim...

Prime Gap(素数表+二分)

Description The sequence of n − 1 consecutive composite numbers (positive integers that are not p...

POJ 3518 Prime Gap

Prime Gap Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8397 Accepted: 4924 ...

poj 3518 Prime Gap

题意大致是:给定一个数,判断它位于哪两个素数之间,输出这两个素数的差。如果它本身是素数则输出0; 题目分析:题目思路很简单,无非就是求出...

POJ 3518 : Prime Gap - 素数筛

题意:长度为n素数间隔:两个相邻素数p和p+n之间,n-1个连续合数组成的序列给出一个正整数k,编写一个程序,计算包含k的素数间隔的长度。若没有包含k的素数间隔,则长度为0。分析:令ans[k]为 包...

POJ3518_Prime Gap【素数】【水题】

POJ3518_Prime Gap【素数】【水题】

UVA - 1644 Prime Gap

The sequence of n - 1 consecutive composite numbers (positive integers that are not prime and not eq...
  • kun768
  • kun768
  • 2014年12月17日 20:42
  • 441

POJ_3518_Prime Gap(Miller-Robin素性测试)

Prime Gap Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 7587   Acce...

Prime Gap

Prime Gap Crawling in process... Crawling failed Time Limit:5000MS     Memory Limit:65536KB     ...
  • ren_hui
  • ren_hui
  • 2013年04月06日 09:32
  • 449
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:sicily 1500. Prime Gap
举报原因:
原因补充:

(最多只允许输入30个字)