【高精度】高精度分数

#include <iostream>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#define range(i,a,b) for(int i=a;i<=b;++i)
#define LL long long
#define rerange(i,a,b) for(int i=a;i>=b;--i)
#define fill(arr,tmp) memset(arr,tmp,sizeof(arr))
using namespace std;
int n,m,num[105],dev[105];
void init(){

}
void solve(){
    char t;
    while(cin>>m>>t>>n){
        fill(num,0);fill(dev,0);
        cout<<m<<t<<n<<"=0.";
        num[m]=1;int k=-1;
        bool flag=true;
        range(i,1,104){
            m*=10;
            dev[i]=m/n;
            m%=n;
            if(num[m]){
                k=i+1;
                flag=false;
                break;
            }
            num[m]=i+1;
            if(num[0]){
                k=i+1;
                break;
            }
        }
        range(i,1,k-1)cout<<dev[i];
        cout<<endl;
        if(!flag)cout<<"from "<<num[m]<<" to "<<k-1<<endl;
    }
}
int main() {
    init();
    solve();
    return 0;
}