# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
953620 | LucaIlie | Cubeword (CEOI19_cubeword) | C++17 | 1070 ms | 8368 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;
const int MAX_ID = 62;
const int MIN_LEN = 3;
const int MAX_LEN = 10;
const int MOD = 998244353;
vector<string> s[MAX_LEN + 1];
unordered_map<char, int> id;
int m;
int coef[MAX_ID][MAX_ID], prod[MAX_ID][MAX_ID][MAX_ID];
int solve() {
int ans = 0;
for ( int a = 0; a < m; a++ ) {
for ( int b = 0; b < m; b++ ) {
for ( int c = 0; c < m; c++ ) {
prod[a][b][c] = 0;
for ( int i = 0; i < m; i++ )
prod[a][b][c] = (prod[a][b][c] + (long long)coef[a][i] * coef[b][i] % MOD * coef[c][i]) % MOD;
}
}
}
for ( int a = 0; a < m; a++ ) {
for ( int b = 0; b < m; b++ ) {
for ( int c = 0; c < m; c++ ) {
Compilation message (stderr)
# | 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... |