Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
keep_looping(N) -> spawn(fun () -> process_flag(trap_exit, true), Workers = [], create_worker(N, Workers) end). create_worker(N, Workers) when N > 0 -> Super = self(),
...
-
1 2 3 4
my$x35 =chr(176)."55".chr(46);my$x34 ;$x35=$x35."0\x363 E \t1;\10". 1 % 2 .chr(176/1) ."3\x34."; $x34=36 ;print "\x4E\11\x350" .$x35."1".$x34% 32 ."\x38\nH@". chr (80) .";\10Py "."c\x41c".chr ($x34*2 ) ."!Ng! :\x29 \n\7" ;;
-
1 2 3 4 5 6 7 8 9
supervisor(Workers, SuperState, WorkList, Results) -> receive {From, Ref, {add_task, Tasks}} -> if SuperState == busy -> From ! {Ref, {"error", "master is busy"}}, supervisor(Workers, SuperState, WorkList, Results); true -> From ! {Ref, {ok}},
...
-
1 2 3 4 5 6 7 8 9
supervisor(Workers, SuperState, WorkList, Results) -> receive {From, Ref, {add_task, Tasks}} -> if SuperState == busy -> From ! {Ref, {"error", "master is busy"}}, supervisor(Workers, SuperState, WorkList, Results); true -> From ! {Ref, {ok}},
...
-
1 2 3 4 5 6 7 8 9
supervisor(Workers, SuperState, WorkList, Results) -> receive {From, Ref, {add_task, Tasks}} -> if SuperState == busy -> From ! {Ref, {"error", "master is busy"}}, supervisor(Workers, SuperState, WorkList, Results); true -> From ! {Ref, {ok}},
...
-
1 2 3 4 5 6 7 8 9
supervisor(Workers, SuperState, WorkList, Results) -> {From, Ref, {add_task, Tasks}} -> if SuperState == busy -> From ! {Ref, {"error", "master is busy"}}, supervisor(Workers, SuperState, WorkList, Results); true -> From ! {Ref, {ok}}, assign_tasks(Tasks, Workers),
...
-
1 2 3 4 5 6 7 8 9
supervisor(Workers, SuperState, WorkList, Results) -> {From, Ref, {add_task, Tasks}} -> if SuperState == busy -> From ! {Ref, {"error", "master is busy"}}, supervisor(Workers, SuperState, WorkList, Results); true -> From ! {Ref, {ok}}, assign_tasks(Tasks, Workers),
...
-
1 2 3 4 5 6 7 8
loop(Super, Task) -> receive {Ref,{perform_task, Tasks}}-> Result = Tasks(), io:format("no error here"), Super ! {self(), Ref, {result, Result}}, % error occurs on this line io:format("no error here"), loop(Super, Task);
...
-
1 2 3 4 5 6 7 8 9
keep_looping(N) -> spawn(fun () -> process_flag(trap_exit, true), Workers = [], create_worker(N, Workers) end). create_worker(N, Workers) when N > 0 -> Super = self(),
...
-
1 2 3 4 5 6 7 8 9
keep_looping(N) -> spawn(fun () -> process_flag(trap_exit, true), Workers = [], create_worker(N, Workers) end). create_worker(N, Workers) when N > 0 -> Super = self(),
...
-
1
Die Zeichen des Frühlings sind unsichtbar UMS Team
-
1 2 3 4 5 6 7 8 9
class Main { public static void main (String[] args) throws java.lang.Exception { for (int i = 1; i < 1000; i++) { if (i % 2 == 0 | i % 3 == 0) { } else
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> using namespace std; int main() { int a; cin>>a; if(a%5==0) { cout<<"porażka";
...
-
1 2 3 4 5
public static int randomNumber (int max, int min) { int number = (int) (max * Math.random()) + min; return number; }
-
1 2 3 4 5
public static int randomNumber (int max) { int number = (int) (max * Math.random()) + 1; return number; }
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). full_zip_impl([], _, [], _, Result) -> Result; full_zip_impl([H | T], LeftDefault, [], RightDefault, Result) -> full_zip_impl(T, LeftDefault, [], RightDefault, [{H, RightDefault} | Result]); full_zip_impl([], LeftDefault, [H | T], RightDefault, Result) ->
...
-
1 2 3 4 5 6
-module(prog). -export([main/0]). main() -> lists:zip([1, 2], [1, 2]).
-
1 2 3 4 5 6
-module(prog). -export([main/0]). main() -> lists:zip([1, 2, 3], [1, 2]).
-
1 2 3 4 5 6
-module(prog). -export([main/0]). main() -> zip([1, 2, 3], [1, 2]).
-
1 2 3 4 5 6 7 8 9
-module(primes). -author('אוהב חכמה'). -export([primes/1]). check(I, Cnt, Max) when I < Max, (Cnt rem I) == 0 -> 0; check(I, Cnt, Max) when I < Max -> check(I+2, Cnt, Max); check(I, Cnt, Max) -> 1. primes([Max]) -> primes(3, list_to_integer(atom_to_list(Max)), 2, 4);
...
-
1 2 3 4 5 6 7
-module(answer). -compile(export_all). take_first([{X,Y}|T]) -> [X|take_first(T)]; take_first([]) -> [].
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). mealy_step(Input, {State, Outputs}, Fun) -> {NewState, Output} = Fun(State, Input), {NewState, [Output | Outputs]}. mealy(Fun, StartState, Inputs) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). mealy_step(Input, {State, Outputs}, Fun) -> {NewState, Output} = Fun(State, Input), {NewState, [Output | Outputs]}. mealy(Fun, StartState, Inputs) ->
...
-
1 2 3 4 5 6 7 8 9
-module(prog). -export([main/0]). mealy_step(Input, {State, Outputs}, Fun) -> {NewState, Output} = Fun(State, Input), {NewState, [Output | Outputs]}. mealy(Fun, StartState, Inputs) ->
...


