HDU_2136】的更多相关文章

Problem Description Everybody knows any number can be combined by the prime number. Now, your task is telling me what position of the largest prime factor. The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc. Specially, LPF(1) = 0.   In…
#include <iostream> #include <stdio.h> #include <math.h> #include <algorithm> using namespace std; // hdu 2136 /* 0 1 2 3 4 5 6 7 8 9 10 11 1 0 1 1 1 1 1 1 0 1 2 1 2 1 2 1 1 0 1 2 1 3 2 1 2 3 1 0 1 2 1 3 2 4 1 2 3 1 0 1 2 1 3 2 4 1…