QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#867014#9622. 有限小数lmz20050701WA 53ms3840kbC++231.7kb2025-01-23 00:25:102025-01-23 00:25:10

Judging History

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

  • [2025-01-23 00:25:10]
  • 评测
  • 测评结果:WA
  • 用时:53ms
  • 内存:3840kb
  • [2025-01-23 00:25:10]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
#define ll long long
#define ull unsigned long long
#define db double
#define P point
#define Fr(i,a,b) for(int i=a;i<=b;i++)
#define Fr_(i,a) for(auto i:a)
#define pb push_back
#define fastio ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pii pair<int,int> 
#define fir first
#define sec second
#define pq priority_queue
#define mkp make_pair
#define memset(a,b) memset(a,b,sizeof(a))
#define new_opt friend bool operator
#define endl '\n'
#define ok cout<<"ok"<<endl

using namespace std;

const int N=2e6+10;
const int N_=1e3+10;
const int M=998244353;
const int inf=2e9;

int n,m;

int f(int x)
{
    int ans=1;
    while(x%2==0)
    {
        ans*=2;
        x/=2;
    }
    while(x%5==0)
    {
        ans*=5;
        x/=5;
    }
    return ans;
}

int cala(int x,int y)
{
    int ans=0;
    while(x)
    {
        ans++;
        x/=y;
    }
    return ans;
}

int check(int x,int y)
{
    return y-x%y;
}

void slv()
{
    int a,b;
    cin>>a>>b;
    int t=f(b);
    b/=t;
    if(b==1)
    {
        cout<<0<<' '<<1<<endl;
        return ;
    }
    int l=cala(1e9,2);
    int r=cala(1e9,5);

    int c=inf;
    int d=inf;
    Fr(i,0,l)
    {
        Fr(j,0,r)
        {
            int tmp=pow(2,i)*pow(5,j);
            if(tmp*t*b>1e9) break;
            //cout<<tmp<<endl;
            int tt=check(a*tmp,b);
            if(tt<c)
            {
                c=tt;
                d=tmp;
            }
        }
    }
    cout<<c<<' '<<d*t*b<<endl;
}
/*
4
1 2
2 3
3 7
19 79
*/

signed main()
{
    fastio;
    int o=1;
    cin>>o;
    while(o--) slv();
}

详细

Test #1:

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

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 4375
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 53ms
memory: 3712kb

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:

1 12
1 828125000
1 60
1 109375
1 231680000
23 960937500
1 36096000
5 326
1 63360
0 1
1 61000
0 1
1 4880
1 10750
1 18500
1 11714560
1 331250
1 898437500
1 31
1 6
1 289600000
1 455000
1 115000000
1 1265625
0 1
1 29687500
0 1
1 415
1 235937500
1 765000000
1 181250
1 2968750
1 4406250
3 24800
1 480
3 34...

result:

wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)