| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 19982 | rlatkddn212 | 괄호 (kriii4_R) | C++14 | 2000 ms | 2500 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 <iostream>
#include <math.h>
#include <queue>
#include <vector>
#include <string.h>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <deque>
#include <sstream>
#include <array>
using namespace std;
const long long mod = 1000000007;
long long f[100001];
long long binomialCoeff(long long n, long long k)
{
long long res = 1;
if (k > n - k)
k = n - k;
for (int i = 0; i < k; ++i)
{
res *= (n - i);
res /= (i + 1);
res %=mod;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||