# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486405 | rainboy | Dijamant (COI16_dijament) | C11 | 38 ms | 332 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;
strcpy(ss[n], s);
return n++;
}
int main() {
int q;
scanf("%d", &q);
while (q--) {
static char cc[16], pp[16];
int n_;
scanf("%s%*s", cc);
while (1) {
scanf("%s", pp);
if (pp[0] == ';')
break;
}
n_ = n;
idx(cc);
printf(n != n_ ? "ok\n" : "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... |