QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #767292 | #9622. 有限小数 | Heenpei | WA | 2ms | 3680kb | C++17 | 1.6kb | 2024-11-20 20:27:08 | 2024-11-20 20:27:10 |
Judging History
answer
#include<bits/stdc++.h>
#include<map>
#include<queue>
#include<set>
#include<vector>
#define int long long
#define ull unsigned long long
#define endl '\n'
#define all(s) s.begin(),s.end()
#define xx first
#define yy second
#define inf 0x3f3f3f3f3f3f3f3f
#define N 1000005
#define mod 1000000007//998244353
#define double long double
#define lowbit(x) ((x)&(-x))
//#define ll long long
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define pll pair<int,int>
#define __lcm(a,b) (a/__gcd(a,b)*b)
const double pi=acos(-1);
const int P=233333;
const int PP=1313131;
const int mod1=1000001011;
const int mod2=(1ll<<31)-1;
using namespace std;
int qmi(int b,int k)
{
int ans=1;
while(k)
{
if(k&1) ans*=b;
b*=b,k>>=1;
}
return ans;
}
vector<int> v;
void init(int n)
{
//int cnt=0;
for(int i=0;i<=20;i++)
{
for(int j=0;j<=10&&qmi(2,i)*qmi(5,j)<=n;j++)
{
int x=qmi(2,i)*qmi(5,j);
v.push_back(x);
//cout<<++cnt<<" "<<qmi(2,i)*qmi(5,j)<<endl;
}
}
sort(all(v));
}
bool check(int x)
{
while(x%2==0) x/=2;
while(x%5==0) x/=5;
return x==1;
}
int arr[N];
void solve()
{
int a,b;cin>>a>>b;
int ans=b-a,id=b;
for(auto i:v)
{
if(i*a>b) break;
else if(b-a*i<ans)
{
ans=b-a*i;
id=i*b;
}
}
cout<<ans<<" "<<id<<endl;
}
void gettest(int t,int T)
{
}
signed main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int T=1;
cin>>T;
init(1000000);
if(T==-1)
{
gettest(209,T);
return 0;
}
while(T--)
{
solve();
//cout<<"&\n";
}
return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3680kb
input:
4 1 2 2 3 3 7 19 79
output:
0 4 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3632kb
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 25 53 26 120 3 560 11 1810 43 123 5 282 5 326 28 99 12 256 28 61 2 64 29 122 31 430 8 148 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 4 3 190 43 160 17 166 22 151 65 153 8 116 3 19 46 705 29 124 10 192 68 139 4 295 3 109 59 152 9 43 14 495 7 2850 59 795 9 25 23 730 11 170 7 179 3 65 64...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)