TwilightKiddy

@TwilightKiddy@programming.dev

• ⁨Comment⁩ on ⁨And 299999999 is divisible by 13⁩ ⁨⁨2⁩ ⁨weeks⁩ ago⁩:

  Well, on the side of easy ones there is “if the last digit is divisible by 2, whole number is divisible by 2”. Also works for 5. And if you take last 2 digits, it works for 4. And the legendary “if it ends with 0, it’s divisible by 10”.

• ⁨Comment⁩ on ⁨And 299999999 is divisible by 13⁩ ⁨⁨2⁩ ⁨weeks⁩ ago⁩:

  The divisability rule for 7 is that the difference of doubled last digit of a number and the remaining part of that number is divisible by 7.

  E.g. 299’999 → 29’999 - 18 = 29’981 → 2’998 - 2 = 2’996 → 299 - 12 = 287 → 28 - 14 = 14 → 14 mod 7 = 0.

  It’s a very nasty divisibility rule. The one for 13 works in the same way, but instead of multiplying by 2, you multiply by 4. There are actually a couple of well-known rules for that, but these are the easiest to remember IMO.

• ⁨Comment⁩ on ⁨gamer stove⁩ ⁨⁨4⁩ ⁨weeks⁩ ago⁩:

  How would one go about using that sink?

• ⁨Comment⁩ on ⁨No idea at all...⁩ ⁨⁨5⁩ ⁨weeks⁩ ago⁩:

  Well, it’s never explicitly stated, but it’s the most convincing theory we have about the origins of Cathedral City and all that came with it.

• ⁨Comment⁩ on ⁨No idea at all...⁩ ⁨⁨5⁩ ⁨weeks⁩ ago⁩:

  I think it’s pretty safe to assume that without Caim there would be no dragons and flower in the first timeline and no maso in the second one. At least people in the second one would survive until the alien invasion. If they fought back successfully, people in both timelines would survive just fine.

• ⁨Comment⁩ on ⁨No idea at all...⁩ ⁨⁨5⁩ ⁨weeks⁩ ago⁩:

  Caim ends up thinking he saved the world, but actually doomed humans in both timelines.

  Zero was stopping the weed. Not only did she have to murder her “sisters” for that, but she also kind of fucked it up, leading to the events of the first game.

• ⁨Comment⁩ on ⁨No idea at all...⁩ ⁨⁨5⁩ ⁨weeks⁩ ago⁩:

  Drakengard games:

  The villain is…

  You. You are the villain.

• ⁨Comment⁩ on ⁨Me after I got fired⁩ ⁨⁨9⁩ ⁨months⁩ ago⁩:

  rand() generates a number from 0 to a constant defined in stdlib, which usually corresponds to the architechture of your compiler. So, for 32 bit systems (assuming all the software in the line is 32 bit, too) it will be 2^31-1 = 2 147 483 647, as 1 bit in integers is reserved for negative numbers and 1 number is 0.

  Though, by design it is guaranteed to be at least 32767, which is a value for 16 bit integers.