#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include <cmath>

 #include<stack>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<algorithm>

 using namespace std;

 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)

 typedef long long LL;

 const int INF = (<<)-;

 const int mod=;

 const int maxn=;

 int vis[maxn],r[maxn],s[maxn];

 int main(){

     int n,m;

     while(cin>>n>>m){

         memset(vis,,sizeof(vis));

         memset(r,,sizeof(r));

         memset(s,,sizeof(s));

         int cnt=;

         int t=n;

         r[cnt++]=n/m;

         n=n%m;

         while(!vis[n]&&n){

             vis[n]=cnt;

             s[cnt]=n;//s数组存的是对应的余数

             r[cnt++]=n*/m;//r数组存的是对应的商

             n=n*%m;

         }

         printf("%d/%d = %d.",t,m,r[]);

         for(int i=;i<cnt&i<=;i++){

             if(s[i]==n&&n) printf("(");

             printf("%d",r[i]);

         }

         if (!n) printf("(0");

         if (cnt > ) printf("...");

         printf(")\n");

         printf("   %d = number of digits in repeating cycle\n\n",!n?:cnt-vis[n]);

     }

     return ;

 }