Advertisement
nankovmkd

ispitna 1

Feb 4th, 2019
128
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.98 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. void polni(int n , int m, int a[n][m])
  4. {
  5. int i, j;
  6. for(i = 0; i < n; i++)
  7. {
  8. for(j = 0; j < m; j++)
  9. {
  10. scanf("%d", &a[i][j]);
  11. }
  12. }
  13. }
  14.  
  15. void pecati(int n , int m, int a[n][m])
  16. {
  17. int i, j;
  18. for(i = 0; i < n; i++)
  19. {
  20. for(j = 0; j < m; j++)
  21. {
  22. printf("%d ", a[i][j]);
  23. }
  24. printf("\n");
  25. }
  26. }
  27.  
  28. int main()
  29. {
  30. int n, m, i, j, k;
  31. scanf("%d%d", &n, &m);
  32. int a[n][m];
  33. polni(n, m, &a);
  34. printf("\n");
  35. int flag = 0;
  36. for(i = 0; i < n; i++)
  37. {
  38. flag = 0;
  39. for(j = 0; j < m; j++)
  40. {
  41. if(a[i][j] == 0)
  42. {
  43. flag++;
  44. continue;
  45. }
  46. printf("%d ", a[i][j]);
  47. }
  48. for(k = 0; k < flag; k++)
  49. {
  50. printf("0 ");
  51. }
  52. printf("\n");
  53. }
  54.  
  55. //pecati(n, m, a);
  56. return 0;
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement