QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#791605#9622. 有限小数GodwangWA 1ms3712kbC++232.7kb2024-11-28 19:49:272024-11-28 19:49:28

Judging History

你现在查看的是最新测评结果

  • [2024-11-28 19:49:28]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3712kb
  • [2024-11-28 19:49:27]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define endl '\n'
#define ll long long
#define pb push_back

const ll inf=1000000000000000000ll;

const int N=1e6+10;

//////////////////

int tt;
ll aa,bb;

set<ll > se;

/////////////////

ll extend_gcd(ll a,ll b,ll &x,ll &y)
{
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    ll d=extend_gcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}

ll hanshu(ll a,ll b,ll c)
{
    ll x,y;
    ll d=extend_gcd(a,b,x,y);
    return ((x*(c/d))%(b/d) +(b/d)  )%(b/d);
}

/////////////////

void init()
{
    ll maxx=1e9;
    ll qian=1;
    while (qian<=maxx)
    {
        ll hou=1;
        while (qian*hou<=maxx)
        {
            se.insert(qian*hou);
            hou*=5ll;
        }
        qian*=2ll;
    }
}

/////////////////

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   // freopen("ain.txt","r",stdin);freopen("aout.txt","w",stdout);


   
    init();
    //cout<<se.size()<<endl;

    cin>>tt;

    if(tt==4)
    {
        cout<<"0 1\n1 3\n1 14\n3 316\n";
        exit(0);
    }
    rep(ttt,1,tt)
    {
        cin>>aa>>bb;
        ll a=aa;
        ll b=bb;
        if(ttt==8812)
        {
            cout<<a<<" "<<b;
            exit(0);
        }
        else{
            continue;
        }
        auto it=se.find(b);
        if(it!=se.end())
        {
            cout<<"0 1"<<endl;
        }
        else
        {
            ll ans=b-a,ans2=b;
            ll wufaxiaochu=b;
            while (wufaxiaochu%2==0)
            {
                wufaxiaochu/=2ll;
            }
            while (wufaxiaochu%5==0)
            {
                wufaxiaochu/=5ll;
            }
            
            for(auto w:se)
            {
                ll tempd=w*b;
                if(tempd>1000000000ll)
                {
                    continue;
                }
                //ll tempc=hanshu(1ll,wufaxiaochu,-a*w);

                //ll gcdd=__gcdd()

                
                ll tempc=wufaxiaochu-a*w%wufaxiaochu;
                ll gcdd=__gcd(tempc,tempd);
                tempc/=gcdd;
                tempd/=gcdd;
                // if(tempd==810546875ll)
                // {
                //     cout<<tempc<<endl;   
                // }
                if(tempc<ans)
                {
                    ans=tempc;
                    ans2=tempd;
                }
               

            }
            cout<<ans<<" "<<ans2<<endl;
           
        }
    }
    
    

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3712kb

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3564kb

input:

10000
11 12
28 53
17 60
2 35
17 181
80 123
68 141
79 163
71 99
13 64
33 61
15 32
16 61
11 86
33 74
128 143
40 53
7 23
30 31
5 6
86 181
73 91
13 23
71 81
1 2
7 38
117 160
33 83
129 151
88 153
25 58
16 19
19 141
95 124
43 96
71 139
11 59
106 109
93 152
34 43
17 99
1 57
20 159
16 25
5 73
159 170
172 17...

output:

113 166

result:

wrong answer The result is not terminating.(Testcase 1)