# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97169 | Kastanda | Riddick's Cube (IZhO13_riddicks) | C++11 | 2021 ms | 484 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 MXN = 5;
struct Generator
{
int n, m, cur, MX;
Generator (int _n, int _m)
{
n = _n; m = _m;
MX = 1; cur = 0;
for (int i = 1; i <= n; i++)
MX *= m;
}
inline vector < int > Next()
{
vector < int > R;
if (cur == MX)
return (R);
int tmp = cur;
for (int i = 0; i < n; i++)
R.push_back(tmp % m), tmp /= m;
cur ++; return (R);
}
};
int n, m, A[MXN][MXN], B[MXN][MXN], C[MXN][MXN];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |