[Beginning Visual C++2008 ] calculate primes

from [Beginning Visual C++2008 ] 
#include<iostream>
#include<iomanip>
using std::cout;
using std::cin;
using std::endl;
using std::setw;

int main()
{
   long* pprime = 0; //initialize long point;
   long max = 4; // number of primes required;
   long count = 3; // number of primes found;
   long found = 0; // indicates when a prime found;
   long trial = 5;// candidate the prime

   pprime = new long[max];

   cout << "please enter the number of primes you would like (at least 4):"<<endl;
   cin >> max;

   if (max<=4)
	   max = 4;

   *pprime = 2;
   *(pprime+1) = 3;
   *(pprime+2) = 5;

   do
   {
	   trial+=2;
	   found =0;
	   for(int i=0;i<count;i++)
	   {
		   found = trial%*(pprime+i)==0;
		   if (found)
			   break;
	   }
	   if (found == 0)
		   *(pprime+count++) = trial;
   }while(count<max);

   for(int i=0;i<max;i++)
   {
	   if(i%5 == 0)
		   cout<<endl;
	   cout<<setw(5)<<*(pprime+i);

   }

   delete [] pprime;
   pprime = 0;
   cout<<endl;
   return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值