The Unicode value 110 corresponds to the lowercase letter "n".
so "n","o",...
would be:
(110+n)/110
where n can be 0 to some number before pass 'z'

But this is not recommended, since the bytes are not well represented as a unicode values.
Because a unicode scalar value can be sometimes represented by more than 1 byte.
Read the docs about indexing in String.
https://doc.rust-lang.org/book/ch08-02-strings.html

Very clever, when the problem can further be grow if there is more conditions, and this code can grow with more combinations

thank you for your code. it was enlighning.
Others just use as u32, but you make sure with try_into() to convert from i16 to u16.
And it fails, because -10 cannot be represented in u16, you give a default value with unwrap_or(0).
And it's safer than just use "as u32".
And I didnt know much about safer conversion with ::from(<smaller_type>)

ahahahahah :)

I didnt know that you can change the signature to "mut a:u64".
Good solution!

It's a clever solution, so you ask this:

a+b <= c

a+c <= b

b+c <= a

For that loop, but I think it would be better with a+c "<" b.

Because, it's part of triangle existence theorem.