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
- Java7
- 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
def NWD(a, b) if b==0 return a return NWD(b, a%b) end while true begin a = gets.split
...
-
1 2 3 4 5 6 7 8 9
def solve(f, min, max) middle = 0 while(min != max) do middle = (min+max)/2 if (f(middle)>0) max = middle else min = middle end
...
-
1 2 3 4 5 6 7 8 9
def solve(f, min, max) middle = 0 while(min != max) do middle = (min+max)/2 if (f(middle)>0) max = middle else min = middle end
...
-
1 2 3 4 5 6 7 8 9
def solve(f, min, max) middle = 0 while(min != max) do middle = (min+max)/2 if (f(middle)>0) max = middle else min = middle end
...
-
1 2 3 4 5 6 7 8 9
require "ostruct" module Scarlet class << self def init ssss , mod , h h.each do | m , *h | next unless ssss.methods.include? m a = ssss.method( m ).call *h
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true:
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true:
...
-
1 2 3 4 5 6 7 8 9
def nwd(a, b) if b==0 return a end return nwd(b, a%b) end while true
...
-
1 2 3 4 5
suma = 0 while (x = gets.to_i) > 0 suma += x puts suma*"9" end
-
1 2 3 4 5
suma = 0 while (x = gets.to_i) > 0 suma += x puts suma*"9" end
-
1 2 3 4 5 6 7 8 9
while true begin x = gets.split rescue break end n = x[0].to_i s = x[1].to_i if n*9>=s
...
-
1 2 3 4 5 6 7 8 9
while true begin s = gets.split rescue break end n = x[0].to_i s = x[1].to_i if n*9>=s
...
-
1 2 3 4 5 6 7 8 9
while true begin s = gets.split rescue break end n = x[0].to_i s = x[1].to_i if n*9>=s
...
-
1 2 3 4 5
suma = 0 while (x = gets.to_i) > 0 suma += x puts suma end
-
1 2 3 4 5
suma = 0 while (x = gets.to_i) > 0 suma += x puts suma end
-
1 2 3 4 5
suma = 0 while (x = gets.to_i) > 0 suma += x puts x end
-
1 2 3 4 5
suma = 0 while (x = gets.to_i) > 0 suma += x puts x end
-
1 2 3 4 5
suma = 0 while x = gets.to_i suma += x puts x end
-
1 2 3 4 5
suma = 0 while x = gets suma += x puts x end
-
1 2 3 4 5
suma = 0 while x = gets suma += x puts x end
-
1 2 3
while x = gets puts x end
-
1 2 3
while x = gets puts x end


