我是从lightoj法官做的this problem（抱歉给予链接，我不知道如何添加图片）。这是纯粹的基于几何的问题，我的appoarch是这导致接受的解决方案。 代码 #include <bits/stdc++.h>
using namespace std;
int main() {
int t,temp;
cin>>t;
temp=t;
我是新来的python，我很难通过使用平分法找到多项式的根。到目前为止，我有2种方法。一个用于评估值x def eval(x, poly):
"""
Evaluate the polynomial at the value x.
poly is a list of coefficients from lowest to highest.
:param x: Argument at wh
k = 0.019;
Pstar = 100;
H = 33;
h = 0.1;
X = 36;
N = round(X/h);
t = zeros(1,N+1);
P = zeros(1,N+1);
P(1) = 84;
t(1) = 0;
yHeun = zeros(1,N+1);
yHeun(1)=84;
a = 1; b = 100;
while b-a >0.5
def findRoot1(x, power, epsilon):
low = 0
high = x
ans = (high+low)/2.0
while abs(ans**power - x) > epsilon:
if ans**power < x:
low = ans
else:
high = ans
正如标题中提到的，当我运行这段代码时，我得到了'None'。 def isIn(char, aStr):
'''
char: a single character
aStr: an alphabetized string
returns: True if char is in aStr; False otherwise
'''
if l