QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #392341 | #7018. Insertion Sort | Slongod | WA | 0ms | 3740kb | C++17 | 571b | 2024-04-17 14:50:01 | 2024-04-17 14:50:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
namespace Slongod{
const int N = 55; int frac[N];
void main()
{
int T , n , k , mod; cin >> T;
for (int c = 1; c <= T; c++) {
cin >> n >> k >> mod; frac[0] = 1; for (int i = 1; i <= n; i++){frac[i] = 1ll * frac[i-1] * i % mod;}
cout << "Case #" << c << ": " << (1ll * k * (n - k) * frac[k] % mod + 1ll * (n - k) * (n - k - 1) * frac[k] % mod + frac[k]) % mod << '\n';
}
}
}int main()
{
ios :: sync_with_stdio(0);
cin.tie(0) , cout.tie(0);
return Slongod :: main(),0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3668kb
input:
4 4 1 998244353 4 2 998244353 4 3 998244353 4 4 998244353
output:
Case #1: 10 Case #2: 14 Case #3: 24 Case #4: 24
result:
ok 4 lines
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3740kb
input:
5000 14 37 557911987 7 10 367410643 16 14 367486993 14 13 257679469 40 1 433152019 6 1 151926713 18 10 831429839 45 23 611504891 43 41 442772417 28 29 651920513 50 43 783397267 34 9 584271757 14 40 136299073 35 24 908302831 32 29 939394321 7 19 925472381 47 24 563986517 42 37 820968349 24 8 36281506...
output:
Case #1: 0 Case #2: -61689600 Case #3: 27680678 Case #4: 82630678 Case #5: 1522 Case #6: 26 Case #7: 497145600 Case #8: 158517076 Case #9: 265540132 Case #10: 24592056 Case #11: 757472701 Case #12: 299738880 Case #13: 75276912 Case #14: 685128802 Case #15: 58404183 Case #16: 352910436 Case #17: 1981...
result:
wrong answer 1st lines differ - expected: 'Case #1: 144021228', found: 'Case #1: 0'