#include <iostream>
#include <cmath>

// Function to calculate the greatest common divisor (GCD) using Euclidean algorithm
int gcd(int a, int b) {
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

// Function to simplify the fraction
void simplifyFraction(int &numerator, int &denominator) {
    int commonDivisor = gcd(numerator, denominator);
    numerator /= commonDivisor;
    denominator /= commonDivisor;
}

int main() {
    int numGames;
    std::cout << "Enter the number of games: ";
    std::cin >> numGames;

    for (int i = 0; i < numGames; ++i) {
        int achievementsAvailable, achievementsUnlocked;
        std::cout << "Enter the number of achievements available for game " << i + 1 << ": ";
        std::cin >> achievementsAvailable;

        std::cout << "Enter the number of achievements unlocked by Makorsha-Manov for game " << i + 1 << ": ";
        std::cin >> achievementsUnlocked;

        int numerator = achievementsUnlocked * 100;
        int denominator = achievementsAvailable;

        simplifyFraction(numerator, denominator);

        std::cout << "Percentage of achievements unlocked for game " << i + 1 << ": " << numerator << " / " << denominator << "\n\n";
    }

    return 0;
}