# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22440 | Lazy Against The Machine (#40) | Fully Generate (KRIII5_FG) | C++98 | 0 ms | 0 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 <cstdio>
#include <ctime>
#include <cstdlib>
using namespace std;
long long arr[60000];
long long nuj[60000];
long long nuj2[60000];
long long str[60000];
constexpr int mod = 1000000007;
// calculate n^k % m
long long modpow(long long n, long long k)
{
long long ret = 1;
n %= mod;
while (k)
{
if (k & 1)
ret = (ret * n) % mod;
n = (n * n) % mod;
k /= 2;
}
return ret;
}
int main()
{
arr[1] = 1;
arr[2] = 2;
nuj[1] = 1;