Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Get smallest dividers
//Title of this code #include <iostream> #include <cmath> using namespace std; /* IDEA: Get biggest dividers and put togethet in sorted order */ int getSmallestDividers(int num) { if (num < 1) return -1; if (num == 1) return 1; int out = 0; int j = 0; for (int i = 9; i > 1; --i) { while (num % i == 0) { num /= i; out += pow(10, j) * i; ++j; } } if (num > 1) return -1; return out; } int main() { cout << getSmallestDividers(14) << endl; cout << getSmallestDividers(36) << endl; cout << getSmallestDividers(80) << endl; cout << getSmallestDividers(810) << endl; }
run
|
edit
|
history
|
help
0
Synchro#1
star print1
CharSearch
Square of maximum
Przesylka
stl_sizeof
pow implementation
derive* -> gcc
27
Test 5(2020)