Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Polynom:
- def __init__(self,*coef):
- self.coef = coef
- def __add__(self,p):
- a=self.coef
- b=p.coef
- c=[]
- if len(a) < len(b):
- for i in range(len(a)):
- c.append(a[len(a)-i-1]+ b[len(b)-i-1])
- c.reverse()
- for i in range(len(b)-len(a)):
- c.insert(i,b[i])
- else:
- for i in range(len(b)-1):
- c.append(a[len(a)-i-1]+ b[len(b)-i-1])
- c.reverse()
- for i in range(len(a)-len(b)):
- c.insert(i,a[i])
- print(c)
- return c
- def __mul__(self,p):
- a=self.coef
- b=p.coef
- c=[]
- if len(a) < len(b):
- for i in range(len(a)):
- c.append(a[len(a)-i-1] * b[len(b)-i-1])
- c.reverse()
- for i in range(len(b)-len(a)):
- c.insert(i,b[i])
- else:
- for i in range(len(b)-1):
- c.append(a[len(a)-i-1] * b[len(b)-i-1])
- c.reverse()
- for i in range(len(a)-len(b)):
- c.insert(i,a[i])
- print(c)
- return c
- def __sub__(self,p):
- a=self.coef
- b=p.coef
- c=[]
- if len(a) < len(b):
- for i in range(len(a)):
- c.append(a[len(a)-i-1] - b[len(b)-i-1])
- c.reverse()
- for i in range(len(b)-len(a)):
- c.insert(i,b[i])
- else:
- for i in range(len(b)-1):
- c.append(a[len(a)-i-1] - b[len(b)-i-1])
- c.reverse()
- for i in range(len(a)-len(b)):
- c.insert(i,a[i])
- print(c)
- return c
- def __eq__(self,p):
- a=self.coef
- b=p.coef
- c=0
- if (len(a)==len(b)):
- for i in range(len(a)):
- if a[i]==b[i]:
- c+=1
- if (c==len(a)):
- return True
- else:
- return False
- A=Polynom(2,4,6)
- B=Polynom(2,4,6)
- print(A==B)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement