can someone explain why explicit conversion is needed?
there is a + operator defined in the byte struct, why is it not used in a + b?

i guess byte are implicitly converted to ints, but how to use the byte + operator then?

OP solved it, closing. Please provide more context also in raising issues next time.

I dont understand, what am I approximating?
I just use f and push the values until it fits.

Something is wrong. My Solution does not use init value

Sure, you have to start from sprint: SRS...SRS

what does this mean? is identical not near?

Expected must be near: .0000024999968750, but got: .0000024999968750
Test Failed
Expected: True
But was: False

I understand description such that 111,112,113,114,115 has greater than 100% average, is that so?

I wanted to know which combination of 135 elements from [R,S] does one need to get to the result 161453 when s = 829
This is one example of the first test in attempt. I can not compute 161453

If you take
RRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRS
you get 112744

If you take
RRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRSRRSRSRSRSRSRS
you get 160825

and no solution in between seems to fit aswell

RRRS means that t = 4. In your example it will be 134 times R and 1 S. And yes, this isn't a good variant

s=829, t=135
what is the RRRS combination to get 161453?
I dont see it

It was already with the words {"dragon", "no", "dog", "on", "good", "offspring"}. I have increased the number of these tests. Thanks for the review

You need to include a test like {ab,ba,c}
My solution is fake for this reason, maybe for more.

or just remove the test for negative number. In think in that case you dont need an explanation. You return 0 anyways in that case, so nothing to gain from it

VB, does the description differ in the languages?

In what language?