QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#771106#9622. 有限小数eweWA 593ms3800kbC++141.7kb2024-11-22 09:52:562024-11-22 09:53:00

Judging History

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

  • [2024-11-22 09:53:00]
  • 评测
  • 测评结果:WA
  • 用时:593ms
  • 内存:3800kb
  • [2024-11-22 09:52:56]
  • 提交

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

const int N = 1e5 + 10, M = 1e2 + 10, lim = 1e9, cnt = 1e3;
const double eps = 1e-12;
const double PI = acos(-1);

bool Mst;
#define int i64

void solve()
{
    int a, b, c, d;
    cin >> a >> b;
    c = lim;

    for (int k = 1; k <= cnt; k++)
    {
        int val = k * b;
        if (val > lim)
            break;
        int c2 = 0, c5 = 0;
        int x = k;
        while (x % 2 == 0)
            x /= 2, ++c2;
        while (x % 5 == 0)
            x /= 5, ++c5;
        for (int i = 0, x = val; i <= c2; i++, x /= 2)
            for (int j = 0, y = x; j <= c5; j++, y /= 5)
            {
                int nc = (y - a * k % y) % y;
                int g = __gcd(nc, val);
                nc /= g;
                if (nc < c)
                {
                    c = nc;
                    d = val / g;
                }
            }
    }
    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: 3696kb

input:

4
1 2
2 3
3 7
19 79

output:

0 1
1 3
1 14
3 316

result:

ok 4 case(s)

Test #2:

score: -100
Wrong Answer
time: 593ms
memory: 3800kb

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
5 1696
1 60
1 7
7 90500
23 3936
5 282
5 326
1 63360
0 1
1 31232
0 1
1 4880
1 10750
1 18500
7 1430
3 10600
1 2944
1 31
1 6
7 113125
11 36400
3 7360
1 51840
0 1
1 304
0 1
1 415
9 94375
16 19125
1 4640
1 608
1 72192
3 775
1 480
13 88960
1 944
1 43600
1 76
2 215
1 6336
1 29184
17 79500
0 1
3 11680
...

result:

wrong answer Jury found better answer than participant's 1 < 5 (Testcase 2)