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
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 cntprim (input,output); var N , i, j ,m , counter : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to N div i do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m , counter : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to N div i do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to N div i do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to N div i do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to N din i do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to m do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do if a[i] then for j:=2 to m do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do for j:=2 to m do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do for j:=2 to m do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N)); for i:=2 to m do for j:=2 to m do a[i*j]:=false;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; end; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N));
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j ,m : integer; a : array [1..5000000] of boolean; end; begin read(N); for i:=1 to N do a[i]:=true; m:=trunc(sqrt(N));
...
-
1 2 3 4 5 6 7 8 9
program RLE; uses crt; var s : string; j : byte; procedure count(s : string; var i : byte); begin if i = 1 then exit else if s[i] <> s[i-1]
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var N , i, j : integer; function fact (m : integer) : integer; begin if (m=0) or (m=1) then fact:=1 else fact:=fact(m-1)*m; end; begin
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var i , sm : integer; a : array [1..3] of integer; function fact (n : integer) : integer; begin if (n=0) or (n=1) then fact:=1 else fact:=fact(n-1)*n; end;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var i , sm : integer; a : array [1..3] of integer; function fact (n : integer) : integer; begin if (n=0) or (n=1) then fact:=1 else fact:=fact(n-1)*n; end;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var i , sm : integer; a : array [1..3] of integer; function fact (n : integer) : integer; begin if (n=0) or (n=1) then fact:=1 else fact:=fact(n-1)*n; end;
...
-
1 2 3 4 5 6 7 8 9
program maxfact (input,output); var i , sm : integer; a : array [1..3] of integer; function fact (n : integer) : integer; var begin if (n=0) or (n=1) then fact:=1 else fact:=fact(n-1)*n; end;
...
-
1 2 3 4 5 6 7 8 9
program smthree (input,output); var i , sm : integer; a : array [1..3] of integer; begin for i:=1 to 3 do read(a[i]); sm:=a[1]; for i:=2 to 3 do begin if a[i]<sm then sm:=a[i]
...
-
1 2 3 4 5 6 7 8 9
program smthree (input,output); var i , sm : integer; a : array [1..3] of integer; begin for i:=1 to 3 do read(a[i]); sm:=a[1]; for i:=2 to 3 do begin if a[i]<sm then sm:=a[i]
...
-
1 2 3 4 5 6 7 8 9
program smthree (input,output); var i , sm : integer; a : array [1..3] of integer; begin for i:=1 to 3 do read(a[i]); sm:=a[1]; for i:=2 to 3 do begin if a[i]<sm then sm:=a[i]
...
-
1 2 3 4 5 6 7 8 9
program modeq (input,output); var M, N, Q ,i ,j, k: integer; begin readln(M, N, Q); i:= M mod 42; j:= N mod 42; k:= Q mod 42; if (i=j) and (j=k) then writeln(i) else writeln('no');


