#include #include using namespace std; int main() { unsigned int num1, num2 = 0; // cin >> num1 >> num2; // num1 = 1; // num2 = 4294967295; // max possible value for unsigned int num1 = 1; num2 = 1000000; // SoloLearn limited by time if (!num2) num2 = num1; unsigned int maxFisher = 0; // for (unsigned int num = num2; num >= num1; num--) { // hint: scan from max to min (see line 46) for (unsigned int num = num1; num <= num2; num++) { // usual scan order unsigned int n2 = trunc(sqrt(num)); int numdivs = 0; if (n2*n2 == num) //skip numbers like 625 = 5*25*125 continue; for (unsigned int i = 2; i <= n2; i++) { if (num % i == 0) { numdivs++; if (numdivs>2) break; } } if (numdivs!=2) continue; // uncomment the following line to print all found fisher numbers // cout << num << "\n"; maxFisher = num; // break; // uncomment this line in case of using hint (see line 22) } if (!maxFisher) cout << "Fisher number is not found in given range\n" << flush; else { cout << "Max Fisher number found: " << maxFisher << "\n\nComponents are:\n"; unsigned int n2 = trunc(sqrt(maxFisher)); unsigned int i = 1; for (; i <= n2; i++) { if (maxFisher%i == 0) cout << i << "\n"; } for (; i >= 1; i--) { if (maxFisher%i == 0) cout << maxFisher/i << "\n"; } cout << "\n"; } return 0; } /* found with hint: Max Fisher number found : 4294967275 Components are : 1 5 25 4294967275 858993455 171798691 */

Max Fisher Number In Range