#include <bits/stdc++.h>

using namespace std;

// #define int long long
#define fir first
#define sec second
#define mkp make_pair 
#define pb push_back
#define lep( i, l, r ) for ( int i = ( l ); i <= ( r ); ++ i )
#define rep( i, r, l ) for ( int i = ( r ); i >= ( l ); -- i )

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;

char _c; bool _f; template < class type > inline void read ( type &x ) {
	_f = 0, x = 0;
	while ( _c = getchar (), !isdigit ( _c ) ) if ( _c == '-' ) _f = 1;
	while ( isdigit ( _c ) ) x = x * 10 + _c - '0', _c = getchar (); if ( _f ) { x = -x; }
}

template < class type > inline void chkmin ( type &x, type y ) { x = ( x <= y ? x : y ); }
template < class type > inline void chkmax ( type &x, type y ) { x = ( x >= y ? x : y ); }

const int N = 10000005;

int mp[N];
vector < int > g;

string init(int a, int b ) {
  g.clear ();
  string res;
  int tmp = a % b;
  while ( tmp ) {
    if ( mp[tmp] != -1 ) {
      int pos = mp[tmp];
      res.insert ( pos, "(" );
      res += ")";
      break;
    }
    mp[tmp] = res.size ();
    g.push_back ( tmp );
    tmp *= 10;
    res += to_string ( tmp / b );
    tmp %= b;
  }
  for ( int x : g ) {
    mp[x] = -1;
  }
  return res;
}

void help ( int a, int b ) {
  if ( b == 0 ) {
    cout << 0 << '\n';
    return;
  }
  cout << a / b;
  if ( a % b != 0 ) {
    putchar ( '.' );
    string ans = init ( a % b, b );
    for ( char c : ans ) {
      putchar ( c );
    }
  }
  cout << '\n';
}

void Solve () {
  // ios :: sync_with_stdio ( false );
  // cin.tie ( 0 ), cout.tie ( 0 );
  memset ( mp, -1, sizeof ( mp ) );
  for ( int i = 1; i <= 18; i ++ ) {
    int a, b;
    cin >> a >> b;
    help ( a, b );
  }
}

signed main () {
#ifdef judge
  freopen ( "Code.in", "r", stdin );
  freopen ( "Code.out", "w", stdout );
  freopen ( "Code.err", "w", stderr );
#endif
  Solve ();
	return 0;
}