DilyaraL

демка

Jun 18th, 2018
111
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.33 KB | None | 0 0
  1. #include "stdafx.h"
  2. #include <iostream>
  3. #include <fstream>
  4. #include <stdlib.h>
  5.  
  6. using namespace std;
  7.  
  8. struct polinom
  9. {
  10. int koef;
  11. int power;
  12. polinom * next;
  13. };
  14.  
  15. bool empty(polinom* top)
  16. {
  17. return top == NULL;
  18. }
  19.  
  20. void create_polinom(ifstream &f, polinom* &top)
  21. {
  22. polinom*p;
  23. int n;
  24. f >> n;
  25. top = NULL;
  26. polinom *end = NULL;
  27. for (int i = 0; i < n; i++)
  28. {
  29. p = new polinom;
  30. f >> p->koef >> p->power;
  31. if (i == 0)
  32. {
  33. p->next = top;
  34. top = p;
  35. end = p;
  36. }
  37. else
  38. {
  39. end->next = p;
  40. p->next = NULL;
  41. end = p;
  42. }
  43. }
  44. f.close();
  45. }
  46.  
  47. void order(polinom* &top, polinom* &end)// сортировка по степеням
  48. {
  49. int ko, pow;
  50. polinom *p, *q;
  51. p = top;
  52. while (p != end)
  53. {
  54. q = p->next;
  55. while (q)
  56. {
  57. if (p->power < q->power)
  58. {
  59. ko = p->koef;
  60. pow = p->power;
  61. p->koef = q->koef;
  62. p->power = q->power;
  63. q->koef = ko;
  64. q->power = pow;
  65. }
  66. q=q->next;
  67. }
  68. p = p->next;
  69. }
  70. }
  71.  
  72. void show(polinom* top)
  73. {
  74. polinom *p;
  75. p = top;
  76. while (p)
  77. {
  78. cout << p->koef << "x^" << p->power << '+';
  79. p = p->next;
  80. }
  81. cout <<0<< endl;
  82. }
  83.  
  84. void main()
  85. {
  86. ifstream in("Text.txt");
  87. polinom* top;
  88. polinom * *a = new polinom*[2];
  89. for (int i = 0; i < 2; i++)
  90. {
  91. create_polinom(in, a[i]);
  92. show(a[i]);
  93. }
  94. system("pause");
  95. }
Advertisement
Add Comment
Please, Sign In to add comment