# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23123 | model_code | Calvinball championship (CEOI15_teams) | C11 | 1000 ms | 1812 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 <stdio.h>
#define MAXN 10000
#define MP 1000007
static int n, seq[MAXN];
static int
gen_part_until (int len_gen, int max_part, int matches, int *seen)
{
int p;
if (len_gen == n)
{
*seen = ((*seen + 1) % MP);
return matches;
}
for (p = 1; p <= max_part; p++)
if (gen_part_until (len_gen + 1, max_part, matches && seq[len_gen] == p, seen))
return 1;
return gen_part_until (len_gen + 1, max_part + 1, matches && seq[len_gen] == max_part + 1, seen);
}
int main (void)
{
int i, k = 0;
scanf ("%d", &n);
for (i = 0; i < n; i++)
scanf ("%d", &seq[i]);
gen_part_until (0, 0, 1, &k);
printf ("%d\n", k);
return 0;
}
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |