中间素数1312.txt

程序设计比赛较为实用的一些代码,希望对别人能有帮助

#include<iostream.h>
int array[169]={1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83
,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193
,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313
,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443
,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587
,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709
,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853
,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991
,997};
int nextprim(int sum);
int main()
{
 int inx,iny;
 int dex;
 int i;
 int low,high;
 while(cin>>inx>>iny)
 {   
      dex=nextprim(inx);
   if(2*iny-1>dex+1)
   {
	   cout<<inx<<" "<<iny<<":";
       for(i=0;i<=dex;i++)
	   cout<<" "<<array[i];
	   cout<<endl;
	   continue;
   }
      if(dex%2!=0)
	  {
      high=dex/2+iny;
	  low=dex/2+1-iny;
	  cout<<inx<<" "<<iny<<":";
       for(i=low;i<=high;i++)
	  cout<<" "<<array[i];
	  }
	  else
	  {
          high=dex/2+iny-1;
	      low=dex/2-iny+1;
	     if(low==high)
		 {
	      cout<<inx<<" "<<iny<<":";
	      cout<<" "<<array[low];
	      cout<<endl;
	      continue;
	  }
	  cout<<inx<<" "<<iny<<":";
       for(i=low;i<=high;i++)
	  cout<<" "<<array[i];
	  }
	  cout<<endl;
 }
return 0;
}
int nextprim(int sum)
{
int i;
  if(sum<=array[84])
  { for(i=0;i<=84;i++)
      if(array[i]>=sum)
		break;
  }
  else
  {
      for(i=84;i<169;i++)
      if(array[i]>=sum)
		break;
  }
  if(array[i]==sum)return i;
  else return (i-1);
return -1;
}