POJ 3048 Max Factor
ソースコード
int main() { int pf[22222]; CL(pf, -1); for (int i = 2; i <= 20000; ++i) if (pf[i] == -1) for (int j = i; j <= 20000; j += i) pf[j] = i; int res = 1; int n; scanf("%d", &n); while (n--) { int a; scanf("%d", &a); if (pf[a] > pf[res]) res = a; } printf("%d\n", res); }