Advertisement
Guest User

Untitled

a guest
Oct 22nd, 2019
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.13 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int main()
  4. {
  5. FILE* job = fopen ("annyahelp2.txt", "r");
  6. int *j, n, m;
  7. fscanf (job,"%d%d", &m, &n);
  8. int a[n][m], (*i)[m];
  9. for( i = a; i < a+n; i++)
  10. for( j = *i; j < *i+m; j++)
  11. fscanf (job,"%d", j);
  12. m = udal (n, m, a);
  13. for( i = a; i < a+n; i++)
  14. {
  15. for( j=*i; j<*i+m; j++)
  16. printf ("%d ", *j);
  17. printf ("\n");
  18. }
  19. return 0;
  20. }
  21. int udal ( int n, int m, int a[n][m])
  22. {
  23. int *i, k, t, *p, *g, *f, *j;
  24. k=1;
  25. while (k<=m)
  26. {
  27. t=m;
  28. for( j = *a; j < *a+m; j++, t--, k++)
  29. {
  30. for (i = j; i < j+n*m; i+=t)
  31. {
  32. if (*i==0)
  33. break;
  34. }
  35. if (i < a+n*m)
  36. {
  37. k++;
  38. continue;
  39. }
  40. else
  41. {
  42. for (g = j;g < *a+m; g++)
  43. for (f = j; f < *a+m*n; f+=m)
  44. *j=*(j+1);
  45. m--;
  46. t--;
  47. }
  48. }
  49. }
  50. return m;
  51. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement