The current answers all focus on decimal digits, when applying the “add all digits and see if that divides by 3”. That trick actually works in hex as well; e.g. 0x12 can be divided by 3 because 0x1 + 0x2 = 0x3. And “converting” to hex is a lot easier than converting to decimal. Pseudo-code: … Read more
We can do this as follow: Maintaining an array sum which at index ith, it contains the modulus sum from 0 to ith. For each index ith, we need to find the maximum sub sum that end at this index: For each subarray (start + 1 , i ), we know that the mod sum … Read more
The MOD keyword only exists in the DAX language (tabular dimensional queries), not TSQL Use % instead. Ref: Modulo
Unlike C or C++, Python’s modulo operator (%) always return a number having the same sign as the denominator (divisor). Your expression yields 3 because (-5) / 4 = -1.25 –> floor(-1.25) = -2 (-5) % 4 = (-2 × 4 + 3) % 4 = 3. It is chosen over the C behavior because … Read more
result = n % 3; if( result < 0 ) result += 3; Don’t perform extra mod operations as suggested in the other answers. They are very expensive and unnecessary.
Use math.fmod(x,y) which does what you want: Returns the remainder of the division of x by y that rounds the quotient towards zero. http://www.lua.org/manual/5.2/manual.html#pdf-math.fmod
It’s the modulus operator, as mentioned, which returns the remainder of a division operation. Examples: 3%5 returns 3, as 3 divided by 5 is 0 with a remainder of 3. 5 % 10 returns 5, for the same reason, 10 goes into 5 zero times with a remainder of 5. 10 % 5 returns 0, … Read more
Edit Apr 19, 2013: Modulo function updated to handle boundary cases as noted by aka.nice and arr_sea: static const double _PI= 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348; static const double _TWO_PI= 6.2831853071795864769252867665590057683943387987502116419498891846156328125724179972560696; // Floating-point modulo // The result (the remainder) has same sign as the divisor. // Similar to matlab’s mod(); Not similar to fmod() – Mod(-3,4)= 1 fmod(-3,4)= -3 … Read more
As explained in the comments, the different behaviour is by design. The different languages just ascribe different meanings to the % operator. You ask: How can I use modulus operator in C#? You can define a modulus operator yourself that behaves the same way as the Python % operator: int mod(int a, int n) { … Read more
In Erlang, 5 rem 3. gives 2, and -5 rem 3. gives -2. If I understand your question, you would want -5 rem 3. to give 1 instead, since -5 = -2 * 3 + 1. Does this do what you want? mod(X,Y) when X > 0 -> X rem Y; mod(X,Y) when X < … Read more