Fast Mod

lukas · Post by **lukas** » Fri Dec 05, 2008 10:51 am

my code:

0<0<1</1<*-p

m!nus · Post by **m!nus** » Fri Dec 05, 2008 1:50 pm

mh yeah, kinda the only solution

btw: what's the point of opening an extra thread? it's the same solution as for 'Mod'

brazzy · Post by **brazzy** » Sun Dec 14, 2008 1:58 am

It's a separate challenge. I suppose there might be people whose solution for "Mod" involves iterated subtraction, though I'd actually consider that far more difficult. Maybe instead of "Fast Mod" have an "Undivided Mod" where you can't use the / instruction?

quangntenemy · Post by **quangntenemy** » Sun Aug 30, 2009 10:24 am

What's the point of this challenge when we can use the exact solution from the other challenge?

nighthalk · Post by **nighthalk** » Sun Aug 30, 2009 11:47 pm

because some users *guilty* did this with subtraction

sabretooth · Post by **sabretooth** » Mon Aug 31, 2009 7:33 am

nighthalk wrote:because some users *guilty* did this with subtraction

true, but if that was the case, the solution to this challenge is then shown in the 'challenges solved' forum of the other challenge....

jonik555 · Post by **jonik555** » Fri Mar 26, 2010 2:37 pm

Code: Select all

0<1<1^1^/*-p

I use this because it is shorter to use if inputs arent like 0< but ie. 14444***+

Napoleon · Post by **Napoleon** » Sun May 29, 2016 6:56 pm

Well two easy challenges... King rat was much more of a challenge

Code: Select all

0<1</1<*0<1v-p

[/code]