# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145133 | radugheo | Mate (COCI18_mate) | C++14 | 2041 ms | 34336 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 MOD 1000000007
using namespace std;
long long l, i, j, q, k, a, x, p;
long long r[2005][30], c[2005][30];
long long d[2005][30][30], sol[2005][30][30];
char y, z, s[2005];
vector <long long> v[30];
int main(){
cin >> (s + 1);
l = strlen(s+1);
c[0][0] = 1;
for (i=1; i<=l; i++){
c[i][0] = 1;
for (j=1; j<=i; j++){
c[i][j] = (c[i-1][j-1] + c[i-1][j]);
if (c[i][j] >= MOD)
c[i][j] -= MOD;
}
}
for (i=1; i<=l; i++){
v[s[i] - 'a'].push_back(i);
}
for (i=l; i>=1; i--){
for (j=0; j<26; j++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |