# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499258 | amunduzbaev | NoM (RMI21_nom) | C++14 | 177 ms | 368 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;
#define ar array
const int mod = 1e9 + 7;
int pre[5][5] = {
{0, 2, 2, 2, 2},
{0, 16, 16, 24, 24},
{0, 288, 384, 480, 576},
{0, 9216, 13824, 23040, 26112},
{0, 460800, 829440, 1428480, 2088960}
};
int bp(int a, int b){
int rr = 1;
while(b){
if(b&1) rr = rr * 1ll * a % mod;
a = a * 1ll * a % mod, b >>= 1;
} return rr;
}
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n, m; cin>>n>>m;
vector<int> a(m);
for(int i=0;i<2*n;i++){
a[i % m]++;
# | 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... |