1
2
3
4
5
6
7
8
9
MMMMMMMMMMMMMMMMMMMMMMMMMM#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<map>
using namespace std;
 ...

1
> "Hello world."

1
2
3
4
5
x = int(input()) 
while x != 42
  printl(x)
  x = int(input())
end

1
2
3
4
5
6
7
8
9
! Copyright (C) 2006 Daniel Ehrenberg
! See http://factorcode.org/license.txt for BSD license.
USING: kernel math sequences strings io combinators ascii ;
IN: rot13
 
: rotate ( ch base -- ch ) [ - 13 + 26 mod ] [ + ] bi ;
 
: rot-letter ( ch -- ch )
    {
 ...

1
2
3
4
5
6
7
8
9
Module ZahlC
  Sub Main()
    Dim a, b, c, i As Integer
    a = 1
    b = 1
    c = 1
    
    For i = 1 To 10
      If i = 10 Then
 ...

1
2
3
4
5
6
7
8
9
class Test( param )
   a = "Hello world"
   b = param
   init
      > "Initializing test"
   end
 
   function show()
   > "Self: ", self
 ...

1
2
3
4
5
x = int(input()) 
while x != 42
  printl(x)
  x = int(input())
end

1
2
3
4
5
x = int(input()) 
while x != 42
  printl(x)
  x = int(input())
end

1
2
3
4
5
6
class Exc0 {
public static void main(String args[]) {
int d = 0;
int a = 42 / d;
}
}

1
2
3
4
5
6
7
8
9
class a
{
public static void main(String args[])
{
int d,s;
d=0;
s=42/d;
//System.out.println(s);
}
 ...

1
2
3
4
5
6
7
8
9
class a
{
public static void main(String args[])
{
int d,s;
d=0;
s=42/d;
System.out.println(s);
}
 ...

1
2
3
4
5
6
7
8
i=1
while i!=0 :
        if x=0 :
                i=0
        else :
                x=input("Entre une vitesse en Km/h : ")
                print(x, " Km/h est égal a ", x*1.609," miles par heure")
                i+=1

1
2
3
4
5
6
7
8
9
function getDiv(n)
        sum=0
        count=0
        v= 1/2
        c= pow(n, v)
        for x in  [1:c+1]
                if(n%x==0)
                        sum=sum+pow(x, 2)
                        sum=sum+pow(n/x, 2)
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        count=count+1
        if curr==1: return count
        if curr%2==0 :  return Hailstones2(curr/2, count)
        return Hailstones2((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        count=count+1
        if curr==1: return count
        if curr%2==0 :  return Hailstones2(curr/2, count)
        return Hailstones2((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        count=count+1
        if curr==1: return count
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        if curr==1: return count
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        if curr==1: return count+1
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        if curr==1: return count+1
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones2(curr, count)
        if curr==1: return count+1
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones2(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
9
function Hailstones(curr, count)
        if curr==1: return count+1
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
function Hailstones(curr)
        return Hailstones(curr, 0)
end
 ...

1
2
3
4
5
6
7
8
function Hailstones(curr)
        return Hailstones(curr, 0)
function Hailstones(curr, count)
        if curr==1: return count+1
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end

1
2
3
4
5
6
7
8
function Hailstones(curr, count)
        if curr==1: return count
        count=count+1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
 
print(Hailstones(13, 0))

1
2
3
4
5
6
7
8
function Hailstones(curr, count)
        if curr==1: return count
        count+=1
        if curr%2==0 :  return Hailstones(curr/2, count)
        return Hailstones((3*curr)+1, count)
end
 
print(2)

1
hola

1
2
3
4
5
6
7
8
9
function isPrime(n)
        for x in [2:n]
                if(n%x==0): return false
        end
        return true
end
 
function gpf(n)
        for x in [n-1:2]
 ...

1
2
3
4
5
6
7
8
9
function isPrime(n)
        for x in [2:n]
                if(n%x==0): return false
        end
        return true
end
 
function gpf(n)
        for x in [n-1:2]
 ...

1
2
3
4
5
6
7
8
9
function isPrime(n)
        for x in [2:n]
                if(n%x==0): return false
        end
        return true
end
 
function gpf(n)
        for x in [n-1:2]
 ...

1
2
3
4
5
6
7
8
9
function isPrime(n)
        for x in [2:n]
                if(n%x==0): return false
        end
        return true
end
 
function gpf(n)
        for x in [n-1:2]
 ...

1
2
3
4
5
6
7
8
function isPrime(n)
        for x in [2:n]
                if(n%x==0): return false
        end
        return true
end
 
printl(isPrime(5))