code decipher
#๐ polynomial addition
rich cypress
real steppe
can anyone help with this?
dont ask to ask , just ask your question and someone who knows the answer will get back to you
trail drift
this is above me
trail drift
bruh i dont even know why the underscores are there def aa_
rich cypress
;-;
u dont need to worry thats a class
wait holdup
the variables are diff self.degree should be == self.order
thick spire
that doesnt work
what does doesn't work mean? what's the expected result and the actual result?
rich cypress
this is another file with unit tests
it doesnt pass the unit tests ie the addition of poly1+p2
giving the code that "doesnt work" an input
the unit test file is flawless and i can reverse engineer it kinda but im at a dead end
otherwise i wouldnt be here tbh
thick spire
this is a bit of a lame unit tester thing, it blocks the original error message and shows you an uninformative message instead
rich cypress
i know
i wish it wouldnt work this way
but it's basically how it's graded
but its to do with the code
west adder
@real steppelemme post the pic , check nd say @trail drift
real steppe
<@671318664280145920>lemme post the pic , check nd say <@393752767644172288>
dont post your question in someone else's thread
create your own thread (read #โ๏ฝhow-to-get-help on how to create a thread like this oen )
thick spire
so you have 2 options to work with your code more efficiently:
- copy your code into a file and run it yourself without the crappy unit tester, your error messages will be readable then
- if you can edit the unit tester, at least temporarily, you can add these lines inside the
except:block to print the error:
import traceback
traceback.print_exc()```how ?
ah wait
west adder
https://discord.com/channels/267624335836053506/1227608240670375997
@real steppe@trail drift
rich cypress
so you have 2 options to work with your code more efficiently:
- copy your code ...
yes but still
idk what doesnt work
proven grail
so what are you having trouble with exactly
rich cypress
this doesnt sum them correctly
burnt fulcrumBOT
drowsy forum
!paste if there's a lot
burnt fulcrumBOT
proven grail
this doesnt sum them correctly
what order are your polynomials stored in? highest degree to smallest, or smallest to highest?
e.g. if i want ax + b, do you store them as a, b or as b, a?
if you append zeros, this adds zeros at the end on the right
this works if you write your polys in ascending powers only
b + ax, c + bx + ax^2, etc
west adder
#1227608240670375997 if anyone free help ya
rich cypress
<#1227608240670375997> if anyone free help ya
go away
rich cypress
west adder
for real, go away
ok sorry
rich cypress
proven grail
<:lemon_fingerguns:754441879990435944>
at a glance your code looks fine except for one thing
you don't check if the result has 0s at the end
rich cypress
it is done in part A
proven grail
idk what part A is
proven grail
you can just share the code here
rich cypress
yea
def add(self, other):
'''Method to find the sum of two polynomials'''
Initialself = self.order #take note of current order
Initialother = other.order #take note of current order
if self.order < other.order: #checks which polynomial is of higher order
while self.order < other.order: #as long as one polynomial is of higher order, append a 0
self.coefficients.append(0)
self.order += 1
elif self.order > other.order: #checks which polynomial is of higher order
while self.order > other.order: #as long as one polynomial is of higher order, append a 0
other.coefficients.append(0)
other.order += 1
NewCoefficients = [] #define a new list to represent the sum of the polynomials
for doinkzoink in range(0, 1+self.order): #go through every term and add terms of the same degree together
NewCoefficients.append((self.coefficients[doinkzoink])+other.coefficients[doinkzoink]) #append the new coefficient to the new list
self.order = Initialself #reset the order to the initial one
other.order = Initialother #reset the order to the initial one
return polynomial(NewCoefficients)
Hey @rich cypress!
rich cypress
;-;
proven grail
read the bot's message
rich cypress
"py def add(self, other):
'''Method to find the sum of two polynomials'''
Initialself = self.order #take note of current order
Initialother = other.order #take note of current order
if self.order < other.order: #checks which polynomial is of higher order
while self.order < other.order: #as long as one polynomial is of higher order, append a 0
self.coefficients.append(0)
self.order += 1
elif self.order > other.order: #checks which polynomial is of higher order
while self.order > other.order: #as long as one polynomial is of higher order, append a 0
other.coefficients.append(0)
other.order += 1
NewCoefficients = [] #define a new list to represent the sum of the polynomials
for doinkzoink in range(0, 1+self.order): #go through every term and add terms of the same degree together
NewCoefficients.append((self.coefficients[doinkzoink])+other.coefficients[doinkzoink]) #append the new coefficient to the new list
self.order = Initialself #reset the order to the initial one
other.order = Initialother #reset the order to the initial one
return polynomial(NewCoefficients) ""
idk how to lol
proven grail
you can literally copy paste what the bot wrote
rich cypress
print('Hello, world!')
proven grail
you used the wrong apostrophe
proven grail
copy paste it from what the bot wrote
rich cypress
ok nmvm
๐ฟ
def __add__(self, other):
'''Method to find the sum of two polynomials'''
Initialself = self.order #take note of current order
Initialother = other.order #take note of current order
if self.order < other.order: #checks which polynomial is of higher order
while self.order < other.order: #as long as one polynomial is of higher order, append a 0
self.coefficients.append(0)
self.order += 1
elif self.order > other.order: #checks which polynomial is of higher order
while self.order > other.order: #as long as one polynomial is of higher order, append a 0
other.coefficients.append(0)
other.order += 1
NewCoefficients = [] #define a new list to represent the sum of the polynomials
for doinkzoink in range(0, 1+self.order): #go through every term and add terms of the same degree together
NewCoefficients.append((self.coefficients[doinkzoink])+other.coefficients[doinkzoink]) #append the new coefficient to the new list
self.order = Initialself #reset the order to the initial one
other.order = Initialother #reset the order to the initial one
return polynomial(NewCoefficients)
ok hot
rich cypress
ffs
class polynomial:
'''Class to represent Polynomials as list(s) of their coefficients.'''
def __init__(self, List):
'''Constructor for the Polynomial class recieving a list of coefficients as inputs.'''
self.coefficients = List #Creates a data attribute named coefficients containing the list of coefficients
assert type(self.coefficients) == list, 'Error: No list provided.' #Checking that the input is in list format.
if len(self.coefficients) == 0: #Checking if the list is null.
self.coefficients = [0] #If list is null/empty, replace it with a list containing a single element, equal to zero.
while self.coefficients[-1] == 0 and len(self.coefficients) > 1: #Removes all zero elements from the end of the list until the last element of the list is non-zero, or the list only contains a zero
self.coefficients.pop(-1)
for variables in self.coefficients:
assert type(variables) == int or type(variables) == float, 'Error: List contains unregognised element(s). Valid elements include integer and float values.' #Checking elements individually to ensure they valid int and float inputs.
self.degree = len(self.coefficients) - 1# Creates a data attribute named degree containing the degree of the represented polynomial, based on the provided list of coefficients, after trailing zeros removed.
if self.degree < 0 :
self.degree == 0
what?
