# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45121 | model_code | The grade (info1cup18_thegrade) | C++17 | 319 ms | 4908 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 <algorithm>
#include <cassert>
#define MOD 1000000007LL
using namespace std;
long long fact[1000010], inv[1000010];
int frq[1000010];
long long put (long long n, long long p)
{
long long rez = 1LL;
for (long long i = 0LL; (1LL << i) <= p; i += 1LL)
{
if ((1LL << i) & p) rez *= n, rez %= MOD;
n *= n;
n %= MOD;
}
return rez;
}
int main ()
{
// freopen ("input", "r", stdin);
//freopen ("output4", "w", stdout);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |