There is NO official Otland's Discord server and NO official Otland's server list. The Otland's Staff does not manage any Discord server or server list. Moderators or administrator of any Discord server or server lists have NO connection to the Otland's Staff. Do not get scammed!
New resources must be posted under Resources tab. A discussion thread will be created automatically, you can't open threads manually anymore.

Reply to thread

Message

You're still having the same problem. Your "tries" is an unsigned 64-bit integer, it can never be bigger than then biggest possible unsigned 64-bit integer value. That's illogical. Also, even if you confirm that "tries" is lower than that, it does not guarantee that you won't wraparound (or "overflow" as you call it, but mind that semantically it's not correct) after multiplying it by another number.
Consider that you have two numbers: a, b and you need to make sure without multiplying them that the result of said multiplication wouldn't be bigger than c. How would you solve it?
a * b <= c
a <= c/b or b <= c/a
Of course you need to make sure that a or b (whichever you divide by) is not equal 0. You already do that with "tries", but not with "skillTries", so watch out. Dividing may also not be the optimal solution, but this example should give you a better understanding.

<blockquote data-quote="kay" data-source="post: 2750412" data-attributes="member: 181118">You&#039;re still having the same problem. Your &quot;tries&quot; is an unsigned 64-bit integer, it can never be bigger than then biggest possible unsigned 64-bit integer value. That&#039;s illogical. Also, even if you confirm that &quot;tries&quot; is lower than that, it does not guarantee that you won&#039;t wraparound (or &quot;overflow&quot; as you call it, but mind that semantically it&#039;s not correct) after multiplying it by another number.Consider that you have two numbers: a, b and you need to make sure without multiplying them that the result of said multiplication wouldn&#039;t be bigger than c. How would you solve it?a * b &lt;= ca &lt;= c/b or b &lt;= c/aOf course you need to make sure that a or b (whichever you divide by) is not equal 0. You already do that with &quot;tries&quot;, but not with &quot;skillTries&quot;, so watch out. Dividing may also not be the optimal solution, but this example should give you a better understanding.</blockquote>

[QUOTE="kay, post: 2750412, member: 181118"] You're still having the same problem. Your "tries" is an unsigned 64-bit integer, it can never be bigger than then biggest possible unsigned 64-bit integer value. That's illogical. Also, even if you confirm that "tries" is lower than that, it does not guarantee that you won't wraparound (or "overflow" as you call it, but mind that semantically it's not correct) after multiplying it by another number. Consider that you have two numbers: a, b and you need to make sure without multiplying them that the result of said multiplication wouldn't be bigger than c. How would you solve it? a * b <= c a <= c/b or b <= c/a Of course you need to make sure that a or b (whichever you divide by) is not equal 0. You already do that with "tries", but not with "skillTries", so watch out. Dividing may also not be the optimal solution, but this example should give you a better understanding. [/QUOTE]

Verification