# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97931 | 314rate | Shell (info1cup18_shell) | C++14 | 526 ms | 48204 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 ll;
typedef long double ld;
const int MOD=(int)1e9+7;
int add(int a,int b)
{
a+=b;
if(a>=MOD)
{
a-=MOD;
}
if(a<0)
{
a+=MOD;
}
return a;
}
int mul(int a,int b)
{
return a*(long long)b%MOD;
}
const int N=(int)1e6+7;
# | 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... |