# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486425 | rainboy | Dijamant (COI16_dijament) | C11 | 840 ms | 404 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>
#include <string.h>
#define N 1000
char ss[N][16]; int n;
int idx(char *s) {
int i;
for (i = 0; i < n; i++)
if (strcmp(ss[i], s) == 0)
return i;
return -1;
}
void add(char *s) {
strcpy(ss[n++], s);
}
int main() {
int q;
scanf("%d", &q);
while (q--) {
static char cc[16], pp[16];
int ok;
scanf("%s%*s", cc);
ok = 1;
while (1) {
scanf("%s", pp);
if (pp[0] == ';')
break;
if (idx(pp) == -1)
ok = 0;
}
if (idx(cc) != -1)
ok = 0;
if (ok) {
printf("ok\n");
add(cc);
} else
printf("greska\n");
}
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... |