Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- #include <fstream>
- #include <stdlib.h>
- using namespace std;
- struct polinom
- {
- int koef;
- int power;
- polinom * next;
- };
- bool empty(polinom* top)
- {
- return top == NULL;
- }
- void create_polinom(ifstream &f, polinom* &top)
- {
- polinom*p;
- int n;
- f >> n;
- top = NULL;
- polinom *end = NULL;
- for (int i = 0; i < n; i++)
- {
- p = new polinom;
- f >> p->koef >> p->power;
- if (i == 0)
- {
- p->next = top;
- top = p;
- end = p;
- }
- else
- {
- end->next = p;
- p->next = NULL;
- end = p;
- }
- }
- f.close();
- }
- void order(polinom* &top, polinom* &end)// сортировка по степеням
- {
- int ko, pow;
- polinom *p, *q;
- p = top;
- while (p != end)
- {
- q = p->next;
- while (q)
- {
- if (p->power < q->power)
- {
- ko = p->koef;
- pow = p->power;
- p->koef = q->koef;
- p->power = q->power;
- q->koef = ko;
- q->power = pow;
- }
- q=q->next;
- }
- p = p->next;
- }
- }
- void show(polinom* top)
- {
- polinom *p;
- p = top;
- while (p)
- {
- cout << p->koef << "x^" << p->power << '+';
- p = p->next;
- }
- cout <<0<< endl;
- }
- void main()
- {
- ifstream in("Text.txt");
- polinom* top;
- polinom * *a = new polinom*[2];
- for (int i = 0; i < 2; i++)
- {
- create_polinom(in, a[i]);
- show(a[i]);
- }
- system("pause");
- }
Advertisement
Add Comment
Please, Sign In to add comment