UVA 10139

#include <iostream> using namespace std; int Primes[6550]; int Len; void getprime() { bool flag[65537] = { false }; for (int i = 2; i < 65537; ++i) if (!flag[i]) for (int j = i + i; j < 65537; j += i) flag[j] = true; for (int i = 2; i < 65537; ++i) if (!flag[i]) Primes[Len++] = i; } int main() { int a, b; getprime(); while (cin >> a >> b) { int temp = b,dim,sumdim; bool flag = true; if (a == 0) { if (b == 1) cout << b << " divides " << a << "!" << endl; else cout << b << " does not divide " << a << "!" << endl; continue; } if (b == 0) { cout << b << " does not divide " << a << "!" << endl; continue; } for (int i = 0; Primes[i] * Primes[i] <= temp && i < Len; ++i) { dim = 0; while (temp % Primes[i] == 0) { dim++; temp /= Primes[i]; } if (dim) { sumdim = 0; for (int j = Primes[i]; j <= a; j *= Primes[i]) sumdim += a / j; if (dim > sumdim) { flag = false; break;} } } if (temp == b || temp != 1) //b 是一个质数 或temp是质数 { if (a < temp) flag = false; } if (flag) cout << b << " divides " << a << "!" << endl; else cout << b << " does not divide " << a << "!" << endl; } return 0; }