Advertisement
Guest User

Untitled

a guest
Jun 22nd, 2017
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.47 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  4.  
  5. int foo(char *judge, char *contestant)
  6. {
  7. FILE *f1 = fopen(judge,"r");
  8. FILE *f2 = fopen(contestant,"r");
  9. char s[1000];
  10. char tomb1[1000][1000];
  11. char tomb2[1000][1000];
  12. int k=0,v=0,i,j,index,db=0;
  13.  
  14. while(fgets(s,1000,f1))
  15. {
  16. s[strlen(s)-1] = '\0';
  17. for(i=strlen(s)-1; i>=0; i--)
  18. {
  19. if(!isspace(s[i]))
  20. {
  21. index = i+1;
  22. break;
  23. }
  24. }
  25. //printf("Hossz: %d Utolso space: %d\n",strlen(s),index);
  26. for(i=0; i<index; i++)
  27. {
  28. tomb1[k][i] = s[i];
  29. }
  30. //printf("Hossz: %d Utolso space: %d\n",strlen(tomb1[k]),index);
  31. k++;
  32.  
  33. }
  34. while(fgets(s,1000,f2))
  35. {
  36. s[strlen(s)-1] = '\0';
  37. for(i=strlen(s)-1; i>=0; i--)
  38. {
  39. if(!isspace(s[i]))
  40. {
  41. index = i+1;
  42. break;
  43. }
  44. }
  45. //printf("Hossz: %d Utolso space: %d\n",strlen(s),index);
  46. for(i=0; i<index; i++)
  47. {
  48. tomb2[v][i] = s[i];
  49. }
  50. //printf("Hossz: %d Utolso space: %d\n",strlen(tomb2[v]),index);
  51. v++;
  52. }
  53.  
  54. for(i=0; i<k; i++)
  55. {
  56. if(strcmp(tomb1[i],tomb2[i])==0)
  57. db++;
  58. }
  59.  
  60. if(db==k)
  61. return 1;
  62. else
  63. return 0;
  64.  
  65. fclose(f1);
  66. fclose(f2);
  67. return 0;
  68.  
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement