Return

Code

1 Name: Anonymous 2021-02-05 15:43


public class Parabola ()

{

private int a;

private int b;

private int c;

public Parabola (int myA, int myB, int c)

{

a = myA;

b = myB;

c = myC;

}

public double getAxis ()

{

int num = -1 * b;

int den = 2 * a;

double axis = (double) (num / den);

return axis;

}

public boolean isOnGraph (int x, int y)

{

int rightSide = a*x*x + b*x + c;

boolean onGraph = (y == rightSide);

return (onGraph);

}

}

2 Name: Anonymous 2021-02-06 17:07
>>1
Yes this is a code!
3 Name: Anonymous 2021-02-06 18:56
>>1
Back to /prog/ please
4 Name: Anonymous 2021-02-18 14:47


def paths(G, s, t):

H, M, count = tr(G), set(), 0

while True:

Q, P = {S}, {}

while Q:

u = Q.pop()

if u == t:

count += 1

break

forw = (v for v in G[u] if (u,v) not in M)

back = (v for v in H[u] if (v,u) in M)

for v in chain(forw, back):

if v in P: continue

P{v} = u

Q.add(v)

else:

return count

while u != s:

u, v = P[u], u

if v in G[u]:

M.add((u,v))

else:

M.remove((v,u))


Return
Name:
Leave this field blank: