Advertisement
Guest User

Untitled

a guest
Dec 7th, 2019
102
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.79 KB | None | 0 0
  1. #define _CRT_SECURE_NO_WARNINGS
  2. #include <stdio.h>
  3. #include <stdlib.h>
  4.  
  5. typedef struct {
  6. double X;
  7. double Y;
  8. double Z;
  9. }koord;
  10.  
  11. int main()
  12. {
  13. int db = 0;
  14. koord akt;
  15. koord* tomb, * tmp;
  16.  
  17. while (scanf_s("%lf,%lf,%lf", &akt.X, &akt.Y, &akt.Z) == 0)
  18. {
  19. db++;
  20. //Nyujtozkodo dinamikus tomb
  21. tmp = (koord*)malloc(sizeof(koord) * db);
  22. for (int i = 0; i < db; ++i)
  23. {
  24. tmp[i] = tomb[i];
  25. }
  26. free(tomb);
  27. tomb = tmp;
  28. //Idaig
  29. //Berakom a most beolvasott értéket
  30. tomb[db - 1] = akt;
  31. }
  32. //Itt már lesz egy coord nevű tömböd, aminek count db eleme van
  33. double max = tomb[1].Z - tomb[0].Z;
  34. int indmax;
  35. for (int j = 1; j < db; j++) {
  36. if (tomb[j].Z - tomb[j - 1].Z > max) {
  37. tomb[j].Z - tomb[j - 1].Z == max;
  38. indmax = j - 1;
  39. }
  40. }
  41. return 0;
  42. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement