d613: Prime Gap

最新推荐文章于 2025-04-01 20:31:37 发布

lixihan

最新推荐文章于 2025-04-01 20:31:37 发布

阅读量508

点赞数

文章标签： integer numbers input each output less

本文链接：https://blog.csdn.net/lixihan/article/details/5199880

版权

本文介绍了一个计算特定整数所在素数间隙长度的程序设计任务。该任务要求对于给定的正整数，找出包含该数的最长素数间隙，并输出其长度。素数间隙是指两个连续素数之间的复合数序列。文章提供了程序实现思路及示例输入输出。

摘要由CSDN通过智能技术生成

内容：

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 .

输入说明：

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.

输出说明：

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.

范例输入：

若題目沒有特別說明，則應該以多測資的方式讀取，若不知如何讀取請參考 a001 的範例程式。

范例输出：

My Program:

program Project1;
const max=2000000;
var a:array[1..max]of boolean;
    i,j,n,res:longint;
begin
     for i:=1 to max do a[i]:=true;
     i:=2;
     while i<max do
     begin
          if a[i] then
          begin
               j:=i+i;
               while j<max do
               begin
                    if a[j] then a[j]:=false;
                    j:=j+i;
               end;
          end;
          i:=i+1;
     end;
     a[1]:=false;
     while not eof do
     begin
          readln(n);
          if n=0 then exit;
          res:=0;
          i:=n;
          while not(a[i]) do begin inc(res);inc(i); end;
          i:=n;
          while not(a[i]) do begin inc(res);dec(i); end;
          writeln(res);
     end;
end.