Wow, just wow. You really are a smart one.

Ha! This is realy clever!

already figure out. I should go to sleep, still very clever solution

Read the answer to the post below, it's explained there.

too smart for me, if someone could to explain it once more and more detalaised, would appresiate.

Raised as issue

pff. does anyone know what I should read to get what is happening there?

Thank you!

A very good solution. Better than using 5 or more methods on Strings that slow down the program. Really good.

Aggree with you. I'm not sure that O(n^2) is a best practice. It looks compact but not optimal.

wrong solution:
test weight(322,156) should return 306.48749781747574

I agree that test with big values of row and pos are necessary, because
most of recursion algorithms throws stack overflow exception when row > 10 000.
for example weight(32000,11234)