# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
44505 | MatheusLealV | Mate (COCI18_mate) | C++17 | 1708 ms | 55672 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>
#define N 2005
#define mod (1000000000 + 7)
using namespace std;
typedef long long ll;
string s;
int n, q, qtd[30][N];
ll dp[N][30][30], ch[N][N];
vector<int> pos[30];
ll choose(int a, int b)
{
if(a == b || b == 0) return 1;
if(b == 1) return a;
if(b > a) return 0;
if(ch[a][b] != -1) return ch[a][b];
return ch[a][b] = (choose(a - 1, b - 1) + choose(a - 1, b))%mod;
}
void solve(int a, int b)
{
for(int len = 1; len <= n; len ++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |