problem 3 最大素因子

#include <iostream>
#include <cstdio>
using  namespace std;
const int MAXN = 100000000;
bool prime[MAXN + 10] = {1,1,0};
int allprime[MAXN/10 + 10];
int main()
{
	int i,j;
	int sub = 0;
	for(i = 2; i <= MAXN; i++)
	{
		if(prime[i] == 0)
		{
			allprime[sub++] = i;
			for(j = i + i; j <= MAXN; j += i)
			{
				prime[j] = 1;
			}
		}
	}
	long long  num = 600851475143;
		i = sub;
	while(i--)
	{
		if(!(num % allprime[i]))
		{
			break;

		}
	}
	printf("%d\n",allprime[i]);

	
		
	return 0;
}