//这是由GPT-4编写的代码，仅使用检测是否正确，不代表本人写出
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <iomanip>
using namespace std;
int gcd(int a, int b) {
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}
string formatFraction(int numerator, int denominator) {
    int divisor = gcd(numerator, denominator);
    numerator /= divisor;
    denominator /= divisor;
    if(denominator == 1)return to_string(numerator);
    map<int, int> remainderPosition;
    string nonRepeatingPart, repeatingPart;
    int remainder = numerator % denominator;
    int pos = 0;
    while (remainder && remainderPosition.find(remainder) == remainderPosition.end()) {
        remainderPosition[remainder] = pos;
        remainder *= 10;
        nonRepeatingPart += to_string(remainder / denominator);
        remainder %= denominator;
        ++pos;
    }
    if (remainder) {
        int repeatStart = remainderPosition[remainder];
        repeatingPart = nonRepeatingPart.substr(repeatStart);
        nonRepeatingPart = nonRepeatingPart.substr(0, repeatStart);
        return "." + nonRepeatingPart + "(" + repeatingPart + ")";
    } 
	else{
        return "." + nonRepeatingPart;
    }
}
vector<pair<int, int>> candles(18);
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int length, time;
    for (int i = 0; i < 18; ++i) {
        cin >> length >> time;
        candles[i] = make_pair(length, time);
	}
    for (const auto& candle : candles) {
        int length = candle.first;
        int time = candle.second;
		if(length%time==0){
			cout<<length/time<<endl;
			continue;
		}
        // Format the fraction
        string result = formatFraction(length, time);
        cout <<length/time<< result << '\n';
    }

    return 0;
}