QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#737461#9622. 有限小数3071752286TL 1ms3848kbC++141.8kb2024-11-12 15:53:492024-11-12 15:53:50

Judging History

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

  • [2024-11-12 15:53:50]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3848kb
  • [2024-11-12 15:53:49]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
unsigned long long maxf=1e19;
unsigned long long a,b,c,d,e,f;
unsigned long long qu2[100],qu5[100];
unsigned long long qu(unsigned long long x,unsigned long long y)
{
	if(x==2&&qu2[y]!=0) return qu2[y];
	if(x==5&&qu5[y]!=0) return qu5[y];
	unsigned long long res=1,cy=y,cx=x;
	while(y!=0)
	{
		if(y%2==1) res=res*x;
		y/=2;
		x=x*x;
	}
	if(cx==2)return qu2[cy]=res;
	else return qu5[cy]=res;
}
unsigned long long twocut(unsigned long long l,unsigned long long r,unsigned long long x)
{
	if(r-l<=1)
	{
		if(l*b>x*a) return l;
		else return r;
	}
	unsigned long long mid=(l+r)/2;
	if(b*mid>x*a) return twocut(l,mid,x);
	else return twocut(mid,r,x);
}
unsigned long long gcd1(unsigned long long x,unsigned long long y)
{
	if(x<y) swap(x,y);
	unsigned long long res;
	while(y!=0)
	{
		res=x;
		x=y;
		y=res%y;
	}
	return x;
}
int main()
{
	unsigned long long T;
	cin>>T;
	while(T--)
	{
		unsigned long long minc=1e16,mind;
		cin>>a>>b;
		unsigned long long bb=b;
		while(bb%5==0) bb/=5;
		while(bb%2==0) bb/=2;
		if(bb==1)
		{
			cout<<0<<" "<<1<<endl;
			continue;
		}
		for(unsigned long long i=0;i<=(unsigned long long)(log(maxf)/log(5));i++)
		{
			for(unsigned long long j=0;j<=(unsigned long long)(log(maxf)/log(2))&&qu(2,i)*qu(5,j)<=maxf;j++)
			{
				f=qu(2,i)*qu(5,j);
				e=twocut(1,f,f);
				
				d=b*f;
				if(b*e<=f*a) break;
				unsigned long long gcdd=gcd1(b*e-f*a,d);
				c=(b*e-f*a)/gcdd;
				d=d/gcdd;
				if(minc>c&&d<=1e9)
				{
					minc=c;
					mind=d;
				}
//				if(f==2) cout<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<e<<" "<<f<<" "<<minc<<" "<<" "<<mind<<endl;
			}
		}
		cout<<minc<<" "<<mind<<endl;
	}
	return 0;
} 
/*
99
1 2
2 3
3 7
19 79
28 53
194999 799999
*/

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3848kb

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
Time Limit Exceeded

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:


result: