/* https://www.sololearn.com/Discuss/617905/challenge-convert-to-fraction The program accepts a real number as input and converts it to it's fractional form reduced to lower terms. Examples: -1.25 -> -5/4 7 -> 7 -0.56 -> -14/25 */ #include #include // For fabs() and pow #define EPSILON 0.000001d // Floating point precision using namespace std; // Counts number of digits after the decimal point of its argument int countDecimals(double d) { int decimals = 0; while(fabs(d - int(d)) > EPSILON) { d *= 10.0d; decimals++; } return decimals; } // Calculates the greatest common divisor of two numbers int greatestCommonDivisor(int numerator, int denominator) { if (denominator == 0) return numerator; else return greatestCommonDivisor(denominator, numerator % denominator); } // Reduces a fraction to lowest terms void reduce(int &numerator, int &denominator) { int gcd = greatestCommonDivisor(numerator, denominator); numerator /= gcd; denominator /= gcd; } // Converts improper fraction to a mixed form. Returns the integral part int extractInt(int &numerator, int &denominator) { int res = numerator / denominator; numerator -= res * denominator; return res; } int main() { double number = 0; // User input cout << "Enter a number: "; cin >> number; cout << number << endl; // Construct a fraction by multiplying the number by 10 to the power of decimals int denominator = round(pow(10, countDecimals(number))); int numerator = round(number * denominator); // Reduce the fraction to it's lowest terms reduce(numerator, denominator); // Fix to avoid results like 1/-2 if (denominator < 0) { denominator = -denominator; numerator = -numerator; } int integer = extractInt(numerator, denominator); // Output cout << "Result: "; if (integer) cout << integer << " "; if (numerator) cout << numerator << "/" << denominator; cout << endl; return 0; }

Challenge: Convert to fraction :)