QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #318164 | #6956. Many Topological Problems | luyiming123 | AC ✓ | 50ms | 3924kb | C++23 | 370b | 2024-01-30 16:47:55 | 2024-01-30 16:47:55 |
Judging History
answer
# include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(void)
{
int Test; scanf("%d", &Test);
while(Test--)
{
int n, k; scanf("%d%d", &n, &k);
int prod = 1;
for(int i = 2; i <= n; i++) prod = 1ll * prod * min(i - 1, k) % mod * i % mod;
printf("%d\n", prod);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 50ms
memory: 3924kb
input:
10 1 1 700503 623646 939811 584922 752155 569391 348265 116258 839298 839298 800391 216447 150847 116426 370812 168588 1000000 407619
output:
1 972550684 617838838 561525568 470024873 910196299 782371500 133886363 868118624 262962652
result:
ok 10 lines