Advertisement
gavrilo93

poredjenje 2

Dec 21st, 2012
51
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.02 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #define MAX_SIZE 20
  4.  
  5.  
  6.  
  7. void ucitaj(FILE *in, int a[MAX_SIZE][MAX_SIZE], int *n)
  8. {
  9. int j, i, k;
  10.  
  11.  
  12. fscanf(in ,"%d", n);
  13. k = *n;
  14.  
  15. for(i=0; i<k; i++){
  16. for(j=0; j<k; j++){
  17. fscanf(in, "%d", &a[i][j]);
  18. }
  19. }
  20.  
  21. }
  22.  
  23. void ispisi (FILE *out, int a[MAX_SIZE][MAX_SIZE], int n)
  24. {
  25. int j, i;
  26. int k = n;
  27.  
  28. for(i=0; i<k; i++){
  29. printf("\n");
  30.  
  31. for(j=0; j<k; j++){
  32.  
  33. fprintf(out, "%d", a[i][j]);
  34. }
  35. }
  36.  
  37. }
  38. int Poredjenje(int niz1[MAX_SIZE][MAX_SIZE], int niz2[MAX_SIZE][MAX_SIZE], int n1, int n2){
  39.  
  40. int j1, j2, i1, i2, k1, k2;
  41. int istina=0;
  42. int u;
  43. u = n1-n2+1;
  44. for(i1=0; j1<u; i1++){
  45. for(j1 =0; j1<u; j1++){
  46. if((niz1[i1][j1])==(niz2[0][0])){
  47. for(k1=1;k1<n2;k1++){
  48. for(k2=1; k2<n2; k2++){
  49. if((niz1[i1+k1][j1+k2])!=(niz2[k1][k2]))
  50. {
  51. break;
  52. }else {
  53. return 1;
  54. }
  55. }
  56. }
  57.  
  58. }
  59. }
  60. }
  61. return 0;
  62. }
  63.  
  64. int main ()
  65. {
  66. int big[MAX_SIZE][MAX_SIZE], big_n;
  67. int small[MAX_SIZE][MAX_SIZE], small_n;
  68.  
  69. FILE *in;
  70. if((in = fopen("matrica.txt", "r"))==NULL) {printf("fajl se nije ucitao\n");}
  71. FILE *out;
  72. out = fopen("ispis.txt", "w");
  73.  
  74. /*if(()==NULL){
  75. printf("Datoteka nije otvorena\n"); }
  76. */
  77. ucitaj(in, big, &big_n);
  78. ucitaj(in, small, &small_n);
  79.  
  80. puts("Big:"); ispisi(out, big, big_n); printf("\n");
  81. puts("Small:"); ispisi(out, small, small_n); printf("\n");
  82.  
  83. fclose(in);
  84. fclose(out);
  85.  
  86. if( Poredjenje(big, small, big_n, small_n))
  87. {
  88. printf("matrica small ulazi u sastav matrice big\n");
  89. }
  90.  
  91.  
  92.  
  93. return 0;
  94. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement