Problem: 3006  User: CCUT06 
Memory: 1216K  Time: 0MS 
Language: C++  Result: Accepted 

#include "iostream"
using namespace std;
const int max = 1000005;
bool prime[1000005] = {false};
int main()
{
	int		i,
			a,
			d,
			n,
			j;

	//创建表
	memset(prime,true,sizeof(prime));
	
	for(i = 3 ; i <= 1000 ; i += 2 )
	{
		for(j = 3 ; j <= ::max / i ; j += 2)
		{
			if(prime[i])
			{
				prime[i * j] = false;	
			}	
		}	
	}
	for(i = 4 ; i <= ::max; i += 2 )
	{
		prime[i] = false;	
	}
	prime[1] = prime[0] = false;
	
	while(cin >> a >> d >> n,a != 0 && d != 0 && n != 0)
	{
		j = 0;
		for (i = a; j < n; i += d)
		{
			if (prime[i])
			{
				j++;
			}
		}
		cout << i - d << endl;
	}
	return 0;
}

• me too!! (0) 123234345 2009-06-12 06:59:05
• Re:实现0MS啦！但是提交时间不同结果也不同啊！^_^， (855) steven7gao 2011-10-16 16:45:59