Primes

最新推荐文章于 2022-07-14 20:11:20 发布

转载最新推荐文章于 2022-07-14 20:11:20 发布 · 145 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/hebozi/archive/2012/08/05/2624221.html

Primes

Time Limit: 3000MS

Description

In a pavilion, visitors will get a hitherto unknown cutting-edge interactive experience, a field full of imagination and the joy of the information communication interactive experience show will be a new form, from the audience into the exhibition hall of the first step, will and handheld terminals are inseparable, future human dream surprise from the visitors palm expansion.

In the waiting area of dream garden, visitors began their wonderful experience tour, waiting for the visitors can use mobile phone terminal to participate in interactive games, and dream theater inside the virtual character Kr. Kong to guess the number of games. When the screen appears an integer X, if you can send Kr. Kong faster than its closest prime answers, you will get a beat all gifts.

For example: when the appearance of the screen 22, your answer should be 23; when the screen 8, your answer should be 7; if the X itself is a prime number, then answer X; if the closest X primes are two, then the answer is greater than its prime.

Input

The first line: N to guess the integer number of the next N rows, each row having a positive integer X1<=N<=5 1<=X<=1000

Onput

The output of N rows, each row corresponds to X closest to its prime.

Sample Input

Sample Output

代码：

#include<stdio.h>
int n;
int h[1005];

void init()
{
   for(int i=1;i<1005;i++)
    h[i]=1;
    h[1]=0;
for(int i=2;i<105;i++)
{
     int j=2;
  while(i*j<1005)
  {
     h[i*j]=0;
     j++;
  }
    }
}

int main()
{
   init();
   scanf("%d",&n);
   int x;
   while(n--)
   {
      scanf("%d",&x);
   if(h[x])
   {
      printf("%d\n",x);
   continue;
      }
      for(int i=x+1,j=x-1;i<1005,j>=1;i++,j--)
       {
     if(h[i]&&h[j])
     {
       printf("%d\n",i);
    goto loop;
           }
       if(h[i])
       {
    printf("%d\n",i);
    goto loop;
    }
    if(h[j])
    {
       printf("%d\n",j);
    goto loop;
    }
      }
      loop:;
   }
   return 0;
}

转载于:https://www.cnblogs.com/hebozi/archive/2012/08/05/2624221.html