A-M baby

Task/Even-or-odd/Fish/even-or-odd.fish

@@ -0,0 +1,4 @@
+<v"Please enter a number:"a
+ >l0)?!vo     v          <                        v    o<
+^      >i:a=?v>i:a=?v$a*+^>"The number is even."ar>l0=?!^>
+             >      >2%0=?^"The number is odd."ar ^

Task/Even-or-odd/Groovy/even-or-odd-1.groovy

@@ -0,0 +1,2 @@
+def isOdd = { int i -> (i & 1) as boolean }
+def isEven = {int i -> ! isOdd(i) }

Task/Even-or-odd/Groovy/even-or-odd-2.groovy

@@ -0,0 +1,3 @@
+1.step(20, 2) { assert isOdd(it) }
+
+50.step(-50, -2) { assert isEven(it) }

Task/Even-or-odd/Icon/even-or-odd.icon

@@ -0,0 +1,3 @@
+procedure isEven(n)
+    return n%2 = 0
+end

Task/Even-or-odd/J/even-or-odd-1.j

@@ -0,0 +1,4 @@
+   2 | 2 3 5 7
+0 1 1 1
+   2|2 3 5 7 + (2^89x)-1
+1 0 0 0

Task/Even-or-odd/J/even-or-odd-2.j

@@ -0,0 +1,4 @@
+   (= <.&.-:) 2 3 5 7
+1 0 0 0
+   (= <.&.-:) 2 3 5 7+(2^89x)-1
+0 1 1 1

Task/Even-or-odd/J/even-or-odd-3.j

@@ -0,0 +1,4 @@
+   {:"1@#: 2 3 5 7
+0 1 1 1
+   {:"1@#: 2 3 5 7+(2^89x)-1
+1 0 0 0

Task/Even-or-odd/J/even-or-odd-4.j

@@ -0,0 +1,2 @@
+   1 (17 b.) 2 3 5 7
+0 1 1 1

Task/Even-or-odd/Lang5/even-or-odd.lang5

@@ -0,0 +1,4 @@
+: even?  2 % not ;
+: odd?  2 % ;
+1 even? .   # 0
+1 odd? .    # 1

Task/Even-or-odd/Liberty-BASIC/even-or-odd.liberty

@@ -0,0 +1,3 @@
+n=12
+
+if n mod 2 = 0 then print "even" else print "odd"

Task/Even-or-odd/Mathematica/even-or-odd.mathematica

@@ -0,0 +1 @@
+EvenQ[8]

Task/Even-or-odd/Maxima/even-or-odd.maxima

@@ -0,0 +1,2 @@
+evenp(n);
+oddp(n);

Task/Even-or-odd/Mercury/even-or-odd.mercury

@@ -0,0 +1,10 @@
+even(N)  % in a body, suceeeds iff N is even.
+odd(N).  % in a body, succeeds iff N is odd.
+
+% rolling our own:
+:- pred even(int::in) is semidet.
+
+% It's an error to have all three in one module, mind; even/1 would fail to check as semidet.
+even(N) :- N mod 2 = 0.   % using division that truncates towards -infinity
+even(N) :- N rem 2 = 0.   % using division that truncates towards zero
+even(N) :- N /\ 1 = 0.    % using bit-wise and.