Any tip on the Challenge 'I'm So Special' ?
Pretty weird 1... must i just try all numbers until 100?
Search found 3 matches
- Sun Jan 25, 2009 10:16 pm
- Forum: Challenges
- Topic: Challenge 'I'm So Special'
- Replies: 8
- Views: 22992
- Sat Dec 20, 2008 10:22 am
- Forum: Wormageddon
- Topic: Valid java code
- Replies: 3
- Views: 22014
Yea got right code now with modulo.
If you are at a if statement there stays example
X =1 returns a value boolean true or false, 1 or 0.
int right = dir + 1 - 4(dir = 4); means:
int right = dir + 1 - 4 * (if dir = 4(if = true it returns a 1 value)) then the equanation does it -3
If you are at a if statement there stays example
Code: Select all
if (x = 1)
{
}int right = dir + 1 - 4(dir = 4); means:
int right = dir + 1 - 4 * (if dir = 4(if = true it returns a 1 value)) then the equanation does it -3
- Fri Dec 19, 2008 9:39 pm
- Forum: Wormageddon
- Topic: Valid java code
- Replies: 3
- Views: 22014
Valid java code
This is a pretty stupid question but a equation example: (1 = 1) returns 1 or 0 right so why would this not work?: int right = dir + 1 - 4(dir = 4); int left = dir - 1 + 4(dir = 0); This code calculates right and left dir so i can use after this the code: public static int[][] offsets = { { 1, 0 }, ...