QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#771065#9622. 有限小数eweWA 302ms3744kbC++141.7kb2024-11-22 09:27:582024-11-22 09:28:04

Judging History

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

  • [2024-11-22 09:28:04]
  • 评测
  • 测评结果:WA
  • 用时:302ms
  • 内存:3744kb
  • [2024-11-22 09:27:58]
  • 提交

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;
    while (b % 2 == 0)
        b /= 2;
    while (b % 5 == 0)
        b /= 5;

    for (int cnt2 = 0, base = b; base <= lim; base *= 2, cnt2++)
    {
        for (int cnt5 = 0, val = base; val <= lim; val *= 5, cnt5++)
        {
            int k = val / b;
            for (int i = 0, dd = val; i <= cnt2; i++, dd /= 2)
            {
                for (int j = 0, fm = dd; j <= cnt5; j++, fm /= 5)
                {
                    int ansc = ((fm - a * k % fm) + fm) % fm;
                    if (ansc < c)
                    {
                        c = ansc;
                        d = val;
                    }
                }
            }
        }
    }
    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: 3744kb

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: 302ms
memory: 3680kb

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 3
1 828125000
1 3
1 21875
1 231680000
23 960937500
1 36096000
5 326
1 63360
0 1
1 61000
0 1
1 4880
1 5375
1 9250
1 11714560
1 331250
1 898437500
1 31
1 3
1 289600000
1 455000
1 115000000
1 1265625
0 1
1 14843750
0 1
1 415
1 235937500
1 765000000
1 90625
1 2968750
1 4406250
3 6200
1 15
3 347500
1 9...

result:

wrong answer The result is not terminating.(Testcase 3)