QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#771146 | #9622. 有限小数 | ewe | WA | 289ms | 3732kb | C++14 | 1.7kb | 2024-11-22 10:07:46 | 2024-11-22 10:07:46 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define fopen \
freopen("E:/vscode/oi/in.txt", "r", stdin); \
freopen("E:/vscode/oi/out.txt", "w", stdout);
#define ios \
ios::sync_with_stdio(0); \
cin.tie(0);
#define i64 long long
#define ull unsigned i64
#define pii pair<int, int>
#define pdd pair<double, double>
#define ld long double
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
#define de(x) cout << #x << " = " << x << '\n'
#define MAXP 20
#define int i64
const int N = 1e5 + 10, M = 1e2 + 10, lim = 1e9;
const double eps = 1e-12;
const double PI = acos(-1);
bool Mst;
void solve()
{
int a, b, c = lim, d;
cin >> a >> b;
for (int x = b; x <= lim; x *= 2)
{
for (int y = x; y <= lim; y *= 5)
{
int c2 = 0, c5 = 0, now = y;
while (now % 2 == 0)
now /= 2, c2++;
while (now % 5 == 0)
now /= 5, c5++;
for (int i = 0, p = now; i <= c2; i++, p *= 2)
for (int j = 0, q = p; j <= c5; j++, q *= 5)
{
int k = y / b, nc = (q - a * k % q) % q;
if (nc < c)
{
c = nc;
d = y;
}
}
}
}
cout << c << ' ' << d << '\n';
}
bool Med;
signed main()
{
ios;
// fopen;
cerr << (&Med - &Mst) / 1024 / 1024;
int t = 1;
srand(time(0));
cout << fixed << setprecision(12);
cin >> t;
for (int i = 1; i <= t; i++)
{
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3732kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 4375 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 289ms
memory: 3676kb
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 64 1 61000 0 32 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 2 1 29687500 0 160 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 3 24800 1 480 ...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)