#include #include #include using namespace std; inline int greatest2Divisor(int n) {//returns greatest power of 2 int i = 0; while ((int)(n / pow(2, i))) i++; return i - 1; } //returns binary value of input //the hardest way inline int toBin(int n) {//returns binary value of input int output = 0, maxPower = greatest2Divisor(n); while (maxPower>=0) { if ((n - pow(2, maxPower)) >= 0) { n -= pow(2, maxPower); output = 10 * output + 1; } else output = 10 * output; maxPower--; } return output; } inline int toOct(int input) {//retruns octal value of input int octalOutput = 0, power=1; while (input != 0) { octalOutput += (input % 8)*power; input /= 8; power *= 10; } return octalOutput; } inline bool isQuix(int n) {//returns true, if n ist quix number int bin, oct; bin = toBin(n); oct = toOct(n); return (bin % n == 0 && bin%oct == 0); } inline string printResult(int n) {//checks all values up to n string output = ""; for (int i = 1; i <= n; i++) { if (isQuix(i)) output += to_string(i) + ",\n"; } return output.substr(0, output.size() - 2); } int main() { int input; string output; cout << "Please give an Integer value greater than to 1: " << endl; cin >> input; if(cin.fail()) cout << "The given string is not an integer!" << endl; else if (input < 1) cout << "The given integer is lessthan 1!" << endl; else { output = printResult(input); if (output == "") cout << "There is no Quix Numbers between 1 and " << input << "!" << endl; else { cout << "Here are all Quix Numbers between 1 and " << input << "!" << endl; cout << output<

Quix numbers