摘要：
水题，打素数表即可，都用不着筛法。#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <cmath>using namespace std;const int MAXI = 200;const int MAXV = 1100;int prime[MAXI], I;int facnum[MAXV];void init() { I = 0; memset(prime, 0, sizeof(prime)); prime[I++] 阅读全文
