Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- int foo(char *judge, char *contestant)
- {
- FILE *f1 = fopen(judge,"r");
- FILE *f2 = fopen(contestant,"r");
- char s[1000];
- char tomb1[1000][1000];
- char tomb2[1000][1000];
- int k=0,v=0,i,j,index,db=0;
- while(fgets(s,1000,f1))
- {
- s[strlen(s)-1] = '\0';
- for(i=strlen(s)-1; i>=0; i--)
- {
- if(!isspace(s[i]))
- {
- index = i+1;
- break;
- }
- }
- //printf("Hossz: %d Utolso space: %d\n",strlen(s),index);
- for(i=0; i<index; i++)
- {
- tomb1[k][i] = s[i];
- }
- //printf("Hossz: %d Utolso space: %d\n",strlen(tomb1[k]),index);
- k++;
- }
- while(fgets(s,1000,f2))
- {
- s[strlen(s)-1] = '\0';
- for(i=strlen(s)-1; i>=0; i--)
- {
- if(!isspace(s[i]))
- {
- index = i+1;
- break;
- }
- }
- //printf("Hossz: %d Utolso space: %d\n",strlen(s),index);
- for(i=0; i<index; i++)
- {
- tomb2[v][i] = s[i];
- }
- //printf("Hossz: %d Utolso space: %d\n",strlen(tomb2[v]),index);
- v++;
- }
- for(i=0; i<k; i++)
- {
- if(strcmp(tomb1[i],tomb2[i])==0)
- db++;
- }
- if(db==k)
- return 1;
- else
- return 0;
- fclose(f1);
- fclose(f2);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement