QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#582747#9376. Gamebu_moWA 567ms3948kbC++201.3kb2024-09-22 17:20:522024-09-22 17:21:01

Judging History

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

  • [2024-09-22 17:21:01]
  • 评测
  • 测评结果:WA
  • 用时:567ms
  • 内存:3948kb
  • [2024-09-22 17:20:52]
  • 提交

answer

#include <bits/stdc++.h>

const int mod = 998244353;

int qpow(int a, int b) {
  int ans = 1, base = a;
  while (b) {
    if (b & 1) ans = 1ll * ans * base % mod;
    base = 1ll * base * base % mod;
    b >>= 1;
  }
  return ans;
}

int T, x, y, fz, fm;

int solve(int x, int y, int cnt1, int cnt2) {
  if (y == 0) return (1ll * qpow(fz, cnt1) * qpow(qpow(fm, cnt1), mod - 2) % mod) * (1ll * qpow(fm - fz, cnt2) * qpow(qpow(fm, cnt2), mod - 2) % mod) % mod;
  if (x == 0) return 0;
  if (x >= y) {
    int ad = (x - 1) / y;
    int prt1 = (1ll * qpow(fz, cnt1 + 1) * qpow(qpow(fm, cnt1 + 1), mod - 2) % mod) * (1ll * qpow(fm - fz, cnt2) * qpow(qpow(fm, cnt2), mod - 2) % mod) % mod;
    int prt2 = (1ll * fm * qpow(fz, mod - 2) % mod - 1ll * qpow(fm - fz, ad + 1) * qpow(1ll * fz * qpow(fm, ad) % mod, mod - 2) % mod + mod) % mod;
    return (1ll * prt1 * prt2 % mod + solve(x % y, y, cnt1, cnt2 + ad)) % mod;
  } else return solve(x, y % x, cnt1 + y / x, cnt2);
}

int main() {
  scanf("%d", &T);
  while (T--) {
    int tmp;
    scanf("%d %d", &x, &y);
    scanf("%d %d %d", &fz, &fm, &tmp);
    fm += fz;
    if (fz == 0) puts("0");
    else printf("%d\n", solve(x, y, 0, 0));
  }
  return 0;
}
/*
1
167959139 481199252
18199423 25950409 149762920
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3892kb

input:

3
1 1
2 2 6
1 3
2 3 6
3 4
7 3 15

output:

499122177
910398850
220911476

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 87ms
memory: 3888kb

input:

100000
1 1000000000
12980050 128257807 266126484
1 1000000000
400255084 123438563 768881284
1000000000 1000000000
24563487 72082135 450057094
1 1000000000
56952077 40876000 193815114
1000000000 1000000000
82048274 239365585 326520865
1000000000 1
309821265 346013425 963168258
1 1
104158269 199365020...

output:

947058399
376449942
612621163
138416357
592200562
45779380
870227707
169499045
86396463
415694940
46851356
951368934
426243016
864656779
750317399
922456360
486881524
824329239
198191519
189360084
966510181
512645443
695650039
703100783
550002158
438470182
246877045
39876086
667870434
405196653
5935...

result:

ok 100000 lines

Test #3:

score: -100
Wrong Answer
time: 567ms
memory: 3948kb

input:

100000
167959139 481199252
18199423 25950409 149762920
773386884 579721198
16629525 28339910 152155823
2087506 268792718
43528658 6471925 90197530
691952768 717268783
516613092 94328992 743662288
45277106 856168102
309821265 346013425 963168258
279198849 527268921
30167950 166388455 577970339
140515...

output:

111307212
952164090
776159793
686215457
349269124
374842963
412084092
79533762
286086009
778147923
155440529
688610964
882386961
953649977
109612740
382211901
900328335
520308570
714433628
161607199
973307502
992272281
796334630
734390111
743921125
574889610
805293646
336501070
475912248
45683411
59...

result:

wrong answer 1st lines differ - expected: '623291477', found: '111307212'