Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 10; % peddlers-IV under every helper-III
y = 1000000; % net dollars minimum
z = 1; % retire counter minimum
assert(10==Pyramidad(y,z))
|
2 | Pass |
%%
x = 10; % peddlers-IV under every helper-III
y = 1999000; % net dollars minimum
z = 2; % retire counter minimum
assert(10==Pyramidad(y,z))
|
3 | Pass |
%%
x = 5; % peddlers-IV under every helper-III
y = 373000; % net dollars minimum
z = 3; % retire counter minimum
assert(5==Pyramidad(y,z))
|
Equidistant numbers containing certain value in an interval
70 Solvers
How many trades represent all the profit?
460 Solvers
223 Solvers
Is the paranthesis sequence balanced ?
73 Solvers
477 Solvers