I'm still curious how this kind of glitch is possible. The only way it could happen is if there is something in place to switch votes and they over did it, being forced to mention it.
At brazil at 2014 election (second round with only shills candidates, they rigged the re-election of an candidate and other shill allowed it), it was something like that:
1-You counted some amount of votes and allowed the vote count to run normaly
2-Check if candidate A has less votes than B, if yes, at the next batch of X votes, all votes not for B goes to B. If not the votes works normaly
I'm still curious how this kind of glitch is possible. The only way it could happen is if there is something in place to switch votes and they over did it, being forced to mention it.
Counter = 0;
If(vote == D){
Counter++;
If(counter % 20 == 0){
}
}
If you're using modulo division, you don't have to reset
Counterto 0, fyiAlso code formatting is fucked and it'd be pretty sweet if it wasn't
Doesn't even compile. What does
counterin the modulo conditional refer to? Someone needs to learn to code.True, I’m glad I’m not having to do any real programming till January cause my brain has been fried lately.
Your point is well made, though.
It's 6-7 lines of code (max).
At brazil at 2014 election (second round with only shills candidates, they rigged the re-election of an candidate and other shill allowed it), it was something like that:
1-You counted some amount of votes and allowed the vote count to run normaly
2-Check if candidate A has less votes than B, if yes, at the next batch of X votes, all votes not for B goes to B. If not the votes works normaly
3-Count the next batch of X votes normaly
4-Go back to 2.