Submission #373725

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
3737252021-03-05 13:58:37moratoMate (COCI18_mate)C++17
100 / 100
829 ms13412 KiB
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int sum[2][2001][26], ans[2001][26][26]; // sum[sz][x] = soma dos dp[sz][K][x]
int mod(int a, int b) {
a %= b;
if (a < 0) a += b;
return a;
}
void add_self(int& a, int b) {
a = mod(a + b, MOD);
}
/*
dp[ t ][ x ][ y ] = numero de sequencias de tamanho t ate r que terminam em xy
calculo pra cada r ^ e somo em sum[ t ][ x ][ y ]
*/
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string str; cin >> str;
int n = (int) str.size();
sum[0][0][0] = 1;
for (int r = 0; r < n; r++) {
// vou adicionar o str[r] para buildar um novo bloco
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...