# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
297614 | Hehehe | Mate (COCI18_mate) | C++14 | 1792 ms | 26464 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> //:3
#define DIM 2010
#define MOD 1000000007
using namespace std;
//ifstream cin ("date.in");
//ofstream cout ("date.out");
int v[DIM],c[DIM][DIM],f[DIM],dp[DIM][30][30],a[DIM][30];
char l1,l2;
int n,i,j,x,y,q,lg;
int main (){
string s;
cin >> s;
n = s.size();
for (i=1;i<=n;i++)
v[i] = s[i - 1] - 'a' + 1;
c[0][0] = 1;
for (i=1;i<=n;i++){
c[i][0] = 1;
for (j=1;j<=i;j++){
c[i][j] = c[i-1][j] + c[i-1][j-1];
if (c[i][j] >= MOD)
c[i][j] -= MOD;
}}
/// a[i][x] - in cate moduri pot selecta s[i],j (am nevoie sa stiu pozitia primului)
for (i=1;i<=n;i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |