# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20007 | algoshipda | 창문 (kriii4_C) | C++14 | 0 ms | 1720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long lld;
const lld MOD = 1e9 + 7;
inline void mult(lld& a, lld b)
{
a%=MOD;
b%=MOD;
a = 1ll * a * b % MOD;
}
inline lld mult2(lld a, lld b)
{
a%=MOD;
b%=MOD;
return 1ll * a * b % MOD;
}
pair<lld, lld> extgcd(lld a, lld b)
{
if(b == 0) return {1,0};
pair<lld, lld> t = extgcd(b, a%b);
return {t.second, t.first - t.second*(a/b)};
}
lld inv(lld a)
{
return (extgcd(a, MOD).first % MOD + MOD ) % MOD;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |