# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116811 | ntrung03 | Lozinke (COCI17_lozinke) | C11 | 1090 ms | 512 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.
#pragma Ofast
#include <stdio.h>
#include <string.h>
char s[20002][12];
int main(int argc, char *argv[]) {
int n;
scanf("%d\n",&n);
int res = 0;
for(int i=0;i<n;i++) scanf("%s\n",s[i]);
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
if(i!=j&&strstr(s[i], s[j])){
res++;
}
printf("%d",res);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |