/ * ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- - Algorithm for decomposition factor
2005-03-13
Rainfly ------------------------------------- * /
#include #include
INT main () {INT i = 2, J, K, N, FLAG = 0, FLAG1 = 0; cout << "Please enter an integer:"; cin >> n; while (1) // Forever loop {for (; i ) if (n% i == 0) // i is definitely the number, n is definitely not a prime number {Flag = 1; Flag1 = 1; cout << i << "×" ; N = N / I; Break;}} (flag) {flag = 0; CONTINUE;} if (flag1) cout << n << endl; else cout << n << "is a magple number, can not decompose << Endl; Break;
Return 0;}
