QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #782537 | #9553. The Hermit | Ail_ijyq | AC ✓ | 78ms | 32380kb | C++20 | 7.1kb | 2024-11-25 20:24:32 | 2024-11-25 20:24:32 |
Judging History
answer
#include<bits/stdc++.h>
#define endl "\n"
// #define int long long
using namespace std;
using i128 = __int128;
using u128 = unsigned __int128;
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
constexpr int N = 2010, M = 20;
constexpr int P = 998244353;
constexpr int INF = 1e9;
template<class T>
constexpr T power(T a, i64 b) {
T res = 1;
for (; b; b /= 2, a *= a) {
if (b % 2) {
res *= a;
}
}
return res;
}
constexpr i64 mul(i64 a, i64 b, i64 p) {
i64 res = a * b - i64(1.L * a * b / p) * p;
res %= p;
if (res < 0) {
res += p;
}
return res;
}
template<i64 P>
struct MLong {
i64 x;
constexpr MLong() : x{} {}
constexpr MLong(i64 x) : x{norm(x % getMod())} {}
static i64 Mod;
constexpr static i64 getMod() {
if (P > 0) {
return P;
} else {
return Mod;
}
}
constexpr static void setMod(i64 Mod_) {
Mod = Mod_;
}
constexpr i64 norm(i64 x) const {
if (x < 0) {
x += getMod();
}
if (x >= getMod()) {
x -= getMod();
}
return x;
}
constexpr i64 val() const {
return x;
}
explicit constexpr operator i64() const {
return x;
}
constexpr MLong operator-() const {
MLong res;
res.x = norm(getMod() - x);
return res;
}
constexpr MLong inv() const {
assert(x != 0);
return power(*this, getMod() - 2);
}
constexpr MLong &operator*=(MLong rhs) & {
x = mul(x, rhs.x, getMod());
return *this;
}
constexpr MLong &operator+=(MLong rhs) & {
x = norm(x + rhs.x);
return *this;
}
constexpr MLong &operator-=(MLong rhs) & {
x = norm(x - rhs.x);
return *this;
}
constexpr MLong &operator/=(MLong rhs) & {
return *this *= rhs.inv();
}
friend constexpr MLong operator*(MLong lhs, MLong rhs) {
MLong res = lhs;
res *= rhs;
return res;
}
friend constexpr MLong operator+(MLong lhs, MLong rhs) {
MLong res = lhs;
res += rhs;
return res;
}
friend constexpr MLong operator-(MLong lhs, MLong rhs) {
MLong res = lhs;
res -= rhs;
return res;
}
friend constexpr MLong operator/(MLong lhs, MLong rhs) {
MLong res = lhs;
res /= rhs;
return res;
}
friend constexpr std::istream &operator>>(std::istream &is, MLong &a) {
i64 v;
is >> v;
a = MLong(v);
return is;
}
friend constexpr std::ostream &operator<<(std::ostream &os, const MLong &a) {
return os << a.val();
}
friend constexpr bool operator==(MLong lhs, MLong rhs) {
return lhs.val() == rhs.val();
}
friend constexpr bool operator!=(MLong lhs, MLong rhs) {
return lhs.val() != rhs.val();
}
};
template<>
i64 MLong<0LL>::Mod = i64(1E18) + 9;
template<int P>
struct MInt {
int x;
constexpr MInt() : x{} {}
constexpr MInt(i64 x) : x{norm(x % getMod())} {}
static int Mod;
constexpr static int getMod() {
if (P > 0) {
return P;
} else {
return Mod;
}
}
constexpr static void setMod(int Mod_) {
Mod = Mod_;
}
constexpr int norm(int x) const {
if (x < 0) {
x += getMod();
}
if (x >= getMod()) {
x -= getMod();
}
return x;
}
constexpr int val() const {
return x;
}
explicit constexpr operator int() const {
return x;
}
constexpr MInt operator-() const {
MInt res;
res.x = norm(getMod() - x);
return res;
}
constexpr MInt inv() const {
assert(x != 0);
return power(*this, getMod() - 2);
}
constexpr MInt &operator*=(MInt rhs) & {
x = 1LL * x * rhs.x % getMod();
return *this;
}
constexpr MInt &operator+=(MInt rhs) & {
x = norm(x + rhs.x);
return *this;
}
constexpr MInt &operator-=(MInt rhs) & {
x = norm(x - rhs.x);
return *this;
}
constexpr MInt &operator/=(MInt rhs) & {
return *this *= rhs.inv();
}
friend constexpr MInt operator*(MInt lhs, MInt rhs) {
MInt res = lhs;
res *= rhs;
return res;
}
friend constexpr MInt operator+(MInt lhs, MInt rhs) {
MInt res = lhs;
res += rhs;
return res;
}
friend constexpr MInt operator-(MInt lhs, MInt rhs) {
MInt res = lhs;
res -= rhs;
return res;
}
friend constexpr MInt operator/(MInt lhs, MInt rhs) {
MInt res = lhs;
res /= rhs;
return res;
}
friend constexpr std::istream &operator>>(std::istream &is, MInt &a) {
i64 v;
is >> v;
a = MInt(v);
return is;
}
friend constexpr std::ostream &operator<<(std::ostream &os, const MInt &a) {
return os << a.val();
}
friend constexpr bool operator==(MInt lhs, MInt rhs) {
return lhs.val() == rhs.val();
}
friend constexpr bool operator!=(MInt lhs, MInt rhs) {
return lhs.val() != rhs.val();
}
};
template<>
int MInt<0>::Mod = 998244353;
template<int V, int P>
constexpr MInt<P> CInv = MInt<P>(V).inv();
using Z = MInt<P>;
constexpr int L = 100000;
int fac[L + 1], invfac[L + 1];
int sumbinom[L + 1][7];
int C(int n, int m) {
if (n < m || m < 0) {
return 0;
}
return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
}
int power(int a, int b) {
int res = 1;
for (; b; b /= 2, a = 1LL * a * a % P) {
if (b % 2) {
res = 1LL * res * a % P;
}
}
return res;
}
void solve() {
fac[0] = 1;
for (int i = 1; i <= L; i++) {
fac[i] = 1LL * fac[i - 1] * i % P;
}
invfac[L] = power(fac[L], P - 2);
for (int i = L; i; i--) {
invfac[i - 1] = 1LL * invfac[i] * i % P;
}
sumbinom[0][0] = 1;
for (int i = 1; i <= L; i++) {
for (int j = 0; j < 7; j++) {
sumbinom[i][j] = (sumbinom[i - 1][j] + sumbinom[i - 1][(j + 6) % 7]) % P;
}
}
int m, n;
cin >> m >> n;
vector<map<int, Z>> dp(m + 1);
Z ans = C(m, n) * Z(n);
for (int i = 1; i <= m; i++) {
dp[i][1] = 1;
for (int k = i * 2; k <= m; k += i) {
for (const auto &[j, cnt] : dp[i]) {
dp[k][j + 1] += cnt;
}
}
}
for (int i = 1; i <= m; i++) {
int b = (m / i) - 1;
for (const auto &[j, cnt] : dp[i]) {
ans -= Z(cnt) * C(b, n - j);
}
}
cout << ans << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T = 1;
// cin >> T;
while (T--) {
solve();
}
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 4ms
memory: 7136kb
input:
4 3
output:
7
result:
ok 1 number(s): "7"
Test #2:
score: 0
Accepted
time: 4ms
memory: 7080kb
input:
11 4
output:
1187
result:
ok 1 number(s): "1187"
Test #3:
score: 0
Accepted
time: 71ms
memory: 32200kb
input:
100000 99999
output:
17356471
result:
ok 1 number(s): "17356471"
Test #4:
score: 0
Accepted
time: 9ms
memory: 9412kb
input:
11451 1919
output:
845616153
result:
ok 1 number(s): "845616153"
Test #5:
score: 0
Accepted
time: 64ms
memory: 32224kb
input:
99998 12345
output:
936396560
result:
ok 1 number(s): "936396560"
Test #6:
score: 0
Accepted
time: 70ms
memory: 32188kb
input:
100000 1
output:
0
result:
ok 1 number(s): "0"
Test #7:
score: 0
Accepted
time: 59ms
memory: 32244kb
input:
100000 15
output:
190067060
result:
ok 1 number(s): "190067060"
Test #8:
score: 0
Accepted
time: 4ms
memory: 7372kb
input:
10 3
output:
299
result:
ok 1 number(s): "299"
Test #9:
score: 0
Accepted
time: 0ms
memory: 7384kb
input:
10 4
output:
743
result:
ok 1 number(s): "743"
Test #10:
score: 0
Accepted
time: 0ms
memory: 7028kb
input:
10 5
output:
1129
result:
ok 1 number(s): "1129"
Test #11:
score: 0
Accepted
time: 3ms
memory: 7080kb
input:
15 6
output:
28006
result:
ok 1 number(s): "28006"
Test #12:
score: 0
Accepted
time: 0ms
memory: 7108kb
input:
15 7
output:
42035
result:
ok 1 number(s): "42035"
Test #13:
score: 0
Accepted
time: 4ms
memory: 7160kb
input:
123 45
output:
214851327
result:
ok 1 number(s): "214851327"
Test #14:
score: 0
Accepted
time: 4ms
memory: 7540kb
input:
998 244
output:
964050559
result:
ok 1 number(s): "964050559"
Test #15:
score: 0
Accepted
time: 4ms
memory: 7424kb
input:
1919 810
output:
379720338
result:
ok 1 number(s): "379720338"
Test #16:
score: 0
Accepted
time: 0ms
memory: 7316kb
input:
1048 576
output:
216543264
result:
ok 1 number(s): "216543264"
Test #17:
score: 0
Accepted
time: 4ms
memory: 7276kb
input:
999 777
output:
635548531
result:
ok 1 number(s): "635548531"
Test #18:
score: 0
Accepted
time: 73ms
memory: 32036kb
input:
99999 77777
output:
448144614
result:
ok 1 number(s): "448144614"
Test #19:
score: 0
Accepted
time: 20ms
memory: 15116kb
input:
34527 6545
output:
748108997
result:
ok 1 number(s): "748108997"
Test #20:
score: 0
Accepted
time: 6ms
memory: 9780kb
input:
12345 12
output:
777496209
result:
ok 1 number(s): "777496209"
Test #21:
score: 0
Accepted
time: 3ms
memory: 7136kb
input:
1 1
output:
0
result:
ok 1 number(s): "0"
Test #22:
score: 0
Accepted
time: 63ms
memory: 32292kb
input:
100000 10101
output:
855985819
result:
ok 1 number(s): "855985819"
Test #23:
score: 0
Accepted
time: 71ms
memory: 32100kb
input:
100000 91919
output:
92446940
result:
ok 1 number(s): "92446940"
Test #24:
score: 0
Accepted
time: 68ms
memory: 32356kb
input:
100000 77979
output:
106899398
result:
ok 1 number(s): "106899398"
Test #25:
score: 0
Accepted
time: 8ms
memory: 9120kb
input:
10000 11
output:
326411649
result:
ok 1 number(s): "326411649"
Test #26:
score: 0
Accepted
time: 78ms
memory: 32136kb
input:
100000 2
output:
15322970
result:
ok 1 number(s): "15322970"
Test #27:
score: 0
Accepted
time: 67ms
memory: 32220kb
input:
100000 3
output:
93355797
result:
ok 1 number(s): "93355797"
Test #28:
score: 0
Accepted
time: 72ms
memory: 32380kb
input:
100000 99998
output:
331850772
result:
ok 1 number(s): "331850772"
Test #29:
score: 0
Accepted
time: 72ms
memory: 32092kb
input:
100000 99996
output:
885066226
result:
ok 1 number(s): "885066226"
Test #30:
score: 0
Accepted
time: 10ms
memory: 9904kb
input:
13115 2964
output:
0
result:
ok 1 number(s): "0"
Test #31:
score: 0
Accepted
time: 68ms
memory: 32156kb
input:
100000 17
output:
425792977
result:
ok 1 number(s): "425792977"
Test #32:
score: 0
Accepted
time: 61ms
memory: 32360kb
input:
99991 16
output:
667323936
result:
ok 1 number(s): "667323936"
Test #33:
score: 0
Accepted
time: 76ms
memory: 32008kb
input:
99991 17
output:
627396741
result:
ok 1 number(s): "627396741"
Test #34:
score: 0
Accepted
time: 75ms
memory: 32284kb
input:
99991 18
output:
874158501
result:
ok 1 number(s): "874158501"
Test #35:
score: 0
Accepted
time: 69ms
memory: 32248kb
input:
100000 100000
output:
99999
result:
ok 1 number(s): "99999"
Test #36:
score: 0
Accepted
time: 61ms
memory: 30552kb
input:
94229 94229
output:
94228
result:
ok 1 number(s): "94228"
Test #37:
score: 0
Accepted
time: 66ms
memory: 30664kb
input:
94229 94223
output:
476599876
result:
ok 1 number(s): "476599876"
Test #38:
score: 0
Accepted
time: 4ms
memory: 7152kb
input:
2 1
output:
0
result:
ok 1 number(s): "0"
Test #39:
score: 0
Accepted
time: 0ms
memory: 7180kb
input:
2 2
output:
0
result:
ok 1 number(s): "0"
Test #40:
score: 0
Accepted
time: 4ms
memory: 7024kb
input:
3 1
output:
0
result:
ok 1 number(s): "0"
Test #41:
score: 0
Accepted
time: 2ms
memory: 7136kb
input:
3 2
output:
2
result:
ok 1 number(s): "2"
Test #42:
score: 0
Accepted
time: 3ms
memory: 7024kb
input:
3 3
output:
2
result:
ok 1 number(s): "2"
Test #43:
score: 0
Accepted
time: 0ms
memory: 7084kb
input:
9 2
output:
44
result:
ok 1 number(s): "44"
Test #44:
score: 0
Accepted
time: 3ms
memory: 7112kb
input:
9 3
output:
206
result:
ok 1 number(s): "206"
Test #45:
score: 0
Accepted
time: 4ms
memory: 7080kb
input:
9 4
output:
441
result:
ok 1 number(s): "441"
Test #46:
score: 0
Accepted
time: 3ms
memory: 7152kb
input:
9 7
output:
224
result:
ok 1 number(s): "224"
Test #47:
score: 0
Accepted
time: 49ms
memory: 24544kb
input:
70839 22229
output:
0
result:
ok 1 number(s): "0"
Test #48:
score: 0
Accepted
time: 42ms
memory: 23392kb
input:
65536 17
output:
698801006
result:
ok 1 number(s): "698801006"
Test #49:
score: 0
Accepted
time: 40ms
memory: 23400kb
input:
65535 17
output:
433312902
result:
ok 1 number(s): "433312902"
Test #50:
score: 0
Accepted
time: 74ms
memory: 32208kb
input:
99856 317
output:
932131332
result:
ok 1 number(s): "932131332"
Test #51:
score: 0
Accepted
time: 71ms
memory: 32008kb
input:
99856 318
output:
398997854
result:
ok 1 number(s): "398997854"
Test #52:
score: 0
Accepted
time: 72ms
memory: 31896kb
input:
99856 2
output:
984791559
result:
ok 1 number(s): "984791559"
Test #53:
score: 0
Accepted
time: 68ms
memory: 32244kb
input:
100000 50000
output:
309108799
result:
ok 1 number(s): "309108799"
Extra Test:
score: 0
Extra Test Passed