QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#777051 | #9622. 有限小数 | chenjiaqiy | WA | 86ms | 3700kb | C++20 | 1.2kb | 2024-11-23 22:28:33 | 2024-11-23 22:28:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 4e5 + 10;
int qsm(int a, int k)
{
int res = 1;
while (k)
{
if (k & 1)
res = res * a;
k >>= 1;
a = (ll)a * a;
}
return res;
}
void solve()
{
ll a, b;
cin >> a >> b;
/*while(b % 2 == 0)
b /= 2;
while(b % 5 == 0)
b /= 5;*/
int now = b / a;
int mx = 0;
for (int i = 0; i <= 25; i++)
{
for (int j = 0; j <= 25; j++)
{
if (1ll * qsm(2, i) * qsm(5, j) <= now && 1ll * qsm(2, i) * qsm(5, j) * b <= 1e9)
mx = max(mx, 1ll * qsm(2, i) * qsm(5, j));
}
}
ll d = mx * b;
ll c = b - a * mx;
cout << c << " " << d << endl;
}
signed main()
{
/*ios::sync_with_stdio(false);
cin.tie(nullptr);*/
int _ = 1;
cin >> _;
while (_--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3604kb
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: 86ms
memory: 3700kb
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)