hihocoder1311 二进制小数

#include <bits/stdc++.h>
using namespace std;
map<int, int>mp;
string s, ans;
int BKDRHash(string s){
    long long seed=131;
    long long hash=0;
    int i = 0;
    while(i<s.size()&&s[i]) hash=hash*seed+(s[i++]);
    return (hash & 0x7FFFFFFF);
}
string Multiply(string s,int x){//模版
    reverse(s.begin(),s.end());
    int cmp=0;
    for(int i=0;i<s.size();i++){
        cmp=(s[i]-‘0‘)*x+cmp;
        s[i]=(cmp%10+‘0‘);
        cmp/=10;
    }
    while(cmp){
        s+=(cmp%10+‘0‘);  
        cmp/=10;  
    }
    reverse(s.begin(),s.end());
    return s;
}
bool f(string s){
    int i;
    for(i=0;i<s.size();i++)
        if(s[i] != ‘0‘) break;
    if(i>=s.size()) return 1;
    return 0;
}
int main(){
    int T, flag, l;
    cin>>T;
    while(T--){
        cin>>s;
        int i = s.size()-1;
        while(i>=0&&s[i]==‘0‘) i--;
        if(i>=0&&s[i]!=‘5‘) {
            cout<<"NO"<<endl;
            continue;
        }
        ans = "";mp.clear();
        flag = 0;
        s.erase(0,2);
        l = s.size();
        while(mp[BKDRHash(s)] == 0){
            mp[BKDRHash(s)] = 1;
            s = Multiply(s, 2);
            if(f(s)){
                flag = 1;
                break;
            }
            if(s.size() != l) s.erase(0, 1), ans += ‘1‘;
            else ans += ‘0‘;
        }
        if(flag == 1) cout<<"0."<<ans<<endl;
        else cout<<"NO"<<endl;
    }
    return 0;
}