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
var N : real; begin read(N); writeln(round(N),' ',trunc(N)); end.
-
1 2 3 4 5 6
var N : real; begin read(N); writeln(round(N),' ',trunc(N)); end.
-
1 2 3 4 5 6
var N : real; begin readln(N); writeln(round(N),trunc(N)); end.
-
1 2 3 4 5 6
var N : real; begin read(N); writeln(round(N),trunc(N)); end.
-
1 2 3 4 5 6 7 8 9
program dyskolo(input,output); var N,sum,i,j,min:integer; akol : array[1..1000000] of integer; yes:boolean; begin sum:=0; readln(N); for i:=1 to N do read(akol[i]);
...
-
1 2 3 4 5 6 7 8 9
program dyskolo(input,output); var N,sum,i,j,min:integer; akol : array[1..1000000] of integer; yes:boolean; begin sum:=0; readln(N); for i:=1 to N do read(akol[i]);
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,size:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin x:=a[(l+r) div 2];
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,size:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin x:=a[(l+r) div 2];
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,size:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin x:=a[(l+r) div 2];
...
-
1 2 3 4 5 6 7 8 9
program exetasi1(input,output); var n,i,j,position,sum0,min : integer; a : array[1..1000000] of integer; begin readln(n); for i := 1 to n do read(a[i]); if a[1]>0 then sum0 := (a[1] + a[2]) else if a[n]<0 then do sum0 := ( a[n] + a[n - 1])
...
-
1 2 3 4 5 6 7 8 9
Function BarkodOlustur1(Bar12Hane:String ):String; Var tek_toplam, cift_toplam, tum_toplam, i : Integer; begin tek_toplam := 0; cift_toplam := 0;
...
-
1 2 3 4 5 6 7 8
a:array[1..1000] of longint; b : integer; begin while not eof do begin readln(a[b]); writeln(a[b]); end; end.
-
1 2 3 4 5 6 7 8 9
ar a:array[1..1000] of longint; b : integer; begin while not eof begin readln(a[b]); writeln(a[b]); end; end.
-
1 2 3 4 5 6 7
var a:array[1..1000] of longint; b : integer; begin readln(a[b]); writeln(a[b]); end.
-
1 2 3 4 5 6 7
var a:array[1..1000] of longint; b : integer; begin readln(a[b]); writeln(a[b]); end.
-
1 2 3 4 5 6 7 8 9
type roma=array [1..100] of integer; var x,y:roma; n,g,k,i,e,e1:integer; begin readln(n); for i:=1 to n do read (x[i]); for i:=1 to n do begin
...
-
1 2 3 4 5 6 7 8 9
type roma=array [1..100] of integer; var x,y:roma; n,g,k,i,e,e1:integer; begin readln(n); for i:=1 to n do read (x[i]); for i:=1 to n do begin
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,c:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,c:longint; procedure qs(l,r:longint); var i,j,x,temp:longint;
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,c:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin x:=a[(l+r) div 2];
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,size:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin x:=a[(l+r) div 2];
...
-
1 2 3 4 5 6 7 8 9
type roma= array [1..100] of integer; var x:roma; begin readln(n); for i:=1 to n do read(x[i]); k:=1; q:=1 for i:=1 to n-1 do
...
-
1 2 3 4 5 6 7 8 9
program test; var x:byte; begin readln(x); while x<>42 do begin writeln(x);
...
-
1 2 3 4 5 6 7 8 9
program test; var x:byte; begin readln(x); while x<>42 d begin writeln(x);
...
-
1 2 3 4 5 6 7 8 9
program stage25; const a = 4; b = 12; c = 99; d = 2099; var e, f, g, i : integer;
...
-
1 2 3 4 5 6 7 8 9
program stage25; uses wincrt; const a = 4; b = 12; c = 99; d = 2099; var e, f, g, i : integer;
...
-
1 2 3 4 5 6 7 8 9
program diafora(input, output); var N, i, j, temp, thesi, min : integer; a : array[1..1000000] of integer; begin readln(N); thesi:= 0; i:= 0; while i < N do
...
-
1 2 3 4 5 6 7 8
program test; type x = array[1...100] of integer; var y : integer; Loop : Integer; temp : Integer;
...
-
1 2 3 4 5 6 7 8 9
var a:array[1..1000] of longint; b,size:longint; procedure qs(l,r:longint); var i,j,x,temp:longint; begin x:=a[(l+r) div 2];
...


