hdu 2136 Largest prime factor

开始用线性删选，结果一下循环就超时了，，，，，，，，

#include<iostream>#define Max  1000000using namespace std;int a[Max];int main(){int i, j, count  = 1;for( i=2; i < Max; i++ ){if(!a[i]){for( j=i; j < Max; j += i )a[j] = count;count++;}}int n;while(scanf("%d", &n) != EOF )printf("%d\n", a[n]);return 0;}