# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1038817 | vjudge1 | Binaria (CCO23_day1problem1) | C++17 | 106 ms | 20948 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.
// Dit me fryingduc
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fore(i, a, b) for (int i = (a); i <= (b); i++)
#define pb emplace_back
const int mod = 1e6 + 3;
int binpow(int a, int b)
{
if (b == 0) return 1ll;
int ans = binpow(a, b / 2ll);
return ans * ans % mod * (b & 1ll ? a : 1ll) % mod;
}
int nCk(int n, int k)
{
int ans = 1;
if (k > n || n < 0 || k < 0) return 0;
fore(i, k + 1, n) ans = ans * i % mod;
fore(i, 1, n - k) ans = ans * binpow(i, mod - 2) % mod;
return ans;
}
signed main()
{
cin.tie(0)->sync_with_stdio(0);
int n, k;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |