Oh my god I could have saved myself so much work by making 6==0

Pretty nice, thank you for new knowledge!

This is nice but does not deal with nested parenthesis of the same type and missing digits (i.e. implied 1s)

This comment is hidden because it contains spoiler information about the solution

Maybe still not efficient enough?

Basic tests Smaller numbers (5 of 5 Assertions) Larger numbers STDERR:

Traceback: in in proper_fractions MemoryError

first,timeout,i rewrite it,then memory error

I'm agree. There is something unclear with instruction and/or tests.

384194 3 52292 8 4 x:1 f:343427.82000000000000000000 c:54383.68000000000000000000 x:2 f:299346.97460000000000000000 c:56559.02720000000000000000 x:3 f:251768.35663800000000000000 c:58821.38828800000000000000 x:4 f:200500.01904914000000000000 c:61174.24381952000000000000 x:5 f:145340.77580109420000000000 c:63621.21357230080000000000 x:6 f:86079.78550282622600000000 c:66166.06211519283200000000 x:7 f:22496.11695271818078000000 c:68812.70459980054528000000 x:8 f:-45641.70413850081907660000 c:71565.21278379256709120000 -45641.70413850081907660000 false shell test cast, why [384194 3 52292 8 4] return true? it should be false?

the variable text1,will lose \n when use echo in bash...how to fix it?

Thank you, I added examples. Please check=)

eg: queue_time([2,10,3,4],2)

You have 2 box.

first , one box takes 2,and other one takes 10. 2 ,10

second, the box taken 2 will plus 3,the other box also 10. 2+3=5 ,10

because, 5<10,so the '10' box cannot take the number '4' 5+4=9 ,10

At last, you cann't take any number ,then you compare the boxs,return the max 10

the desc is not clear.DEC dec dEc DECM... should show in the test case

the test cases didn't cosider thant $1 and $2 have commmon divisor.for example 4 6. when $1 and $2 have common divisor, the solution $1*$2*$(seq 1 n) is wrong.

how to un-pubilish?

i am newbee,i dont know how to add more test cases.i will fixed it!

Oh my god I could have saved myself so much work by making 6==0

Pretty nice, thank you for new knowledge!

This is nice but does not deal with nested parenthesis of the same type and missing digits (i.e. implied 1s)

This comment is hidden because it contains spoiler information about the solution

Maybe still not efficient enough?

Basic tests

Smaller numbers (5 of 5 Assertions)

Larger numbers

STDERR:

Traceback:

in

in proper_fractions

MemoryError

first,timeout,i rewrite it,then memory error

I'm agree. There is something unclear with instruction and/or tests.

384194 3 52292 8 4

x:1 f:343427.82000000000000000000 c:54383.68000000000000000000

x:2 f:299346.97460000000000000000 c:56559.02720000000000000000

x:3 f:251768.35663800000000000000 c:58821.38828800000000000000

x:4 f:200500.01904914000000000000 c:61174.24381952000000000000

x:5 f:145340.77580109420000000000 c:63621.21357230080000000000

x:6 f:86079.78550282622600000000 c:66166.06211519283200000000

x:7 f:22496.11695271818078000000 c:68812.70459980054528000000

x:8 f:-45641.70413850081907660000 c:71565.21278379256709120000

-45641.70413850081907660000

false

shell test cast, why [384194 3 52292 8 4] return true? it should be false?

the variable text1,will lose \n when use echo in bash...how to fix it?

Thank you, I added examples.

Please check=)

eg: queue_time([2,10,3,4],2)

You have 2 box.

first , one box takes 2,and other one takes 10. 2 ,10

second, the box taken 2 will plus 3,the other box also 10. 2+3=5 ,10

because, 5<10,so the '10' box cannot take the number '4' 5+4=9 ,10

At last, you cann't take any number ,then you compare the boxs,return the max 10

the desc is not clear.DEC dec dEc DECM... should show in the test case

the test cases didn't cosider thant $1 and $2 have commmon divisor.for example 4 6.

when $1 and $2 have common divisor, the solution $1*$2*$(seq 1 n) is wrong.

how to un-pubilish?

i am newbee,i dont know how to add more test cases.i will fixed it!

## Loading more items...