# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16304 | who7117 | 뚊 (kriii3_EE) | C11 | 0 ms | 0 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 MAX 100
int compare(char*, char*, int);
int _input(int, int);
void main()
{
unsigned int N, M, result;
char eyfa[MAX], eeyfa[MAX];
char eyfa2[MAX], eeyfa2[MAX];
scanf("%d %d", &N, &M); // N : stage M : eyfa size
while (N > 0)
{
fflush(stdin);
fgets(eyfa, M + 2, stdin); // why +2?
eyfa[strlen(eyfa) - 1] = '\0'; // '\n' change
fflush(stdin);
fgets(eyfa2, M + 2, stdin); // why +2?
eyfa2[strlen(eyfa2) - 1] = '\0'; // '\n' change
fflush(stdin);
fgets(eeyfa, sizeof(eeyfa), stdin);
eeyfa[strlen(eeyfa) - 1] = '\0';
fflush(stdin);
fgets(eeyfa2, sizeof(eeyfa2), stdin);
eeyfa2[strlen(eeyfa2) - 1] = '\0';
result = compare(eyfa, eeyfa, M);
if (result == 0) printf("Eyfa");
else printf("Not Eyfa");
printf("\n");
result = compare(eyfa2, eeyfa2, M);
if (result == 0) printf("Eyfa");
else printf("Not Eyfa");
printf("\n");
N--;
}
}
int compare(char *str1, char *str2, int M)
{
int cnt = 0;
for (int i = 0; i < M; i++)
{
for (int y = cnt; cnt < y + 2; cnt++)
{
if (str1[i] != str2[cnt]) return 1;
}
}
return 0;
}