1
2
3
4
5
6
7
8
9
eb04afc2bfa381ec
0cfec175f931c0ba
d0c1ca088a1c0c8a
fec175e8e95c0000
005c583d41414141
753b5a89d189e689
d189df29cf31c031
8a14068a341e8834
8a1c168a1730da88
 ...

1
2
3
4
5
6
7
8
9
eb 04 af c2 bf a3 81 ec
0c fe c1 75 f9 31 c0 ba
d0 c1 ca 08 8a 1c 0c 8a
fe c1 75 e8 e9 5c 00 00
00 5c 58 3d 41 41 41 41
75 3b 5a 89 d1 89 e6 89
d1 89 df 29 cf 31 c0 31
8a 14 06 8a 34 1e 88 34
8a 1c 16 8a 17 30 da 88
 ...

1
2
3
4
5
6
 
1000.times  do  |query|
    name = "Unknow"
    status = "deleted" 
    puts "INSERT INTO t_companies (name, status) values(#{name}, #{status})"
end

1
2
3
4
5
6
7
8
9
let x = 4;;
 
let f () = x;;
 
print_int (f ());;
 
let x = 5;;
 
print_int (f ());;

1
2
3
4
5
let x = 4;;
 
let f () = x;;
 
print_int (f ());;

1
2
3
4
5
let x = 4;;
 
let f () = x;;
 
print_int (f x);;

1
2
3
4
5
let x = 4
 
let f () = x
 
print_int (f x)

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
List.rev (fst (List.fold_left (fun (l,n) b -> if n <= 0 then (l,n) else (b::l, n-1)) ([],n) l))

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
 > print_endline "Hello World !" ;;
 Hello World !
 val () : unit = <fun>
 >

1
2
3
4
5
6
7
8
open Array;;
open String;;
open Printf;;
open Str;;
 
let palavra = read_line();;
let tam = String.length palavra;;
let vector = Array.create tam palavra;;
 ...

1
2
3
4
5
6
7
8
open Array;;
open String;;
open Printf;;
open Str;;
 
let palavra = read_line();;
let tam = String.length palavra;;
let vector = Array.create tam palavra;;
 ...

1
2
3
4
5
6
7
8
9
#load "Str.cma";;
open Array;;
open String;;
open Printf;;
open Str;;
 
let palavra = read_line();;
let tam = String.length palavra;;
let vector = Array.create tam palavra;;
 ...

1
print_endline "てっきり、茶髪僕っ子の女の子(中段左。あずみちゃん)と、黒髪ボーイッシュ部長の彼女(中段右。葉平? はひらちゃん? 読み方分からないけど変わった名前だなー)の百合漫画かと思いましたよ。まぁ主人公は表紙の娘だと思っていたから、一段目の「僕」にあずみが束縛されて、そうすると「中段の黒髪の子=あずみの彼女=キマシ」という推論に";;

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
5
6
7
8
/*
 * OpaTetris
 *
 * @author Matthieu Guffroy
 * @author Adam Koprowski (improving control logic & session management;
 *                         no more lost key events)
 * @author Ida Swarczewskaja (improving html structure)
 */
 ...

1
2
3
4
5
6
7
8
9
type 'a bt = Empty | Node of 'a * 'a bt * 'a bt;;
let tt = Node(1, 
              Node(2, 
                   Node (4, Empty, Empty), 
                   Empty), 
              Node(3,
                   Node(5,Empty,
                        Node(6,Empty,Empty)),Empty));;
 
 ...

1
2
3
4
5
6
7
8
9
type 'a bt = Empty | Node of 'a * 'a bt * 'a bt;;
let tt = Node(1, 
              Node(2, 
                   Node (4, Empty, Empty), 
                   Empty), 
              Node(3,
                   Node(5,Empty,
                        Node(6,Empty,Empty)),Empty));;
let internalPathLength tree =
 ...

1
2
3
4
5
let main() = 
print_string "ocaml";
;;
 
main();;

1
type thingy = Hello x | Nothing;;

1
2
3
4
5
6
7
8
9
let pi = 4.0 *. atan 1.0;; 
  
type figure =
   Rectangle of float * float 
  | Circle of float     
  | Triangle of float * float 
 
type region = 
  Figure of figure
 ...

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
5
6
7
8
datatype 'a List = ListNode of 'a * 'a List | Empty
exception EmptyList
 
fun getItem (ListNode (i,_)) = i
  | getItem (Empty) = raise EmptyList
 
fun nextNode (ListNode(_,rest)) = rest
  | nextNode (Empty) = raise EmptyList

1
2
3
4
5
6
7
8
9
let yg x y z=moveto x y;
set_color black;
fill_circle x y z;
set_color white;
fill_rect x (y-z) (2*z) (2*z);
fill_circle x (y+z/2) (z/2);
set_color black;
fill_circle x (y-z/2) (z/2);
draw_circle x y z;
 ...

1
2
3
4
let rec member x s = match s with
[]->false
|hd::tl when hd=x ->true
|hd::tl -> member x tl;;

1
2
3
4
5
6
7
8
9
exception Undefined
;;
type direction = R | L 
;; 
type stat = T | F
;;
type tape = {
   data : int array ;
   pos  : int ;
 ...

1
2
3
4
5
6
7
8
9
 
  
        let rec sqrthelp n half = 
          if ((half*half) > n) then sqrthelp n (half / 2)
                  else if ((half*half) = n) then half
                  else sqrthelp n (3 * half / 2);;
                  
 let my_sqrt n:int =
  let half = (n/2) in
 ...