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
int main() { string te = ""; te=Stdio.stdin->gets(); string as = ""; as=Stdio.stdin->gets(); int ct=0; string s="";
...
-
1 2 3 4 5 6 7 8 9
int main() { int n; string s=Stdio.stdin->gets(); sscanf(s,"%d",n); s=Stdio.stdin->gets(); string t; array a = allocate(100010); for(int i = 1;i<n;i = i+1) {
...
-
1 2 3 4 5 6 7 8 9
int n; array(int) a,b; int solve(int pos, int mn, int st) { if (pos == n) { b[st] += mn; return 1; }
...
-
1 2 3 4 5 6 7 8 9
int main() { string s=Stdio.stdin->gets(); int n; sscanf(s, "%d",n); s=Stdio.stdin->gets(); int m=1; s=s+','; int startidx=0;
...
-
1 2 3 4 5 6 7 8 9
array(string) peta; array(int) ru; array(int) cu; array(int) jml; int cnt; void solve(int r, int c) { if (r < 0 || r >= 10 || c < 0 || c >= 10) return; if (peta[r][c] != '*') return;
...
-
1 2 3 4 5 6 7 8 9
int main(){ mapping used = ([]) ; int n = (int)Stdio.stdin->gets(); for (int i=0; i<n; i++){ array cur = Stdio.stdin->gets() / " "; if (!mappingp(cur[0])){ used += ([cur[0]:cur[1]]); } else if (used[cur[0]] < cur[1]){ used[cur[0]] = cur[1];
...
-
1 2 3 4 5 6 7 8 9
int main() { int n = (int)Stdio.stdin->gets(); string s = Stdio.stdin->gets(); array(int) state = ({}); int pos = 0; for (int i = 0; i < n; ++i) { if (s[pos + 1] == 'n') { pos += 3;
...
-
1 2 3 4 5 6 7 8 9
int main() { string s; int i,n,x,y,z; // array(int) a = ({0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}); s = Stdio.stdin->gets(); n = sizeof(s); x = (s[1] - 48) * 10 + s[2] - 48; if(s[5]>47) { y = (s[4] - 48) * 10 + s[5] - 48;
...
-
1 2 3 4 5 6 7 8 9
int n; array(int) a,b; int solve(int pos, int mn, int st) { if (pos == n) { b[st] += mn; return 1; }
...
-
1 2 3 4 5 6 7 8 9
int main() { sscanf(Stdio.stdin->gets(),"%d",int n); array(int) a=allocate(n,0),b=allocate(n,0); for(int i=0;i<n;++i) { sscanf(Stdio.stdin->gets(),"%s",string s); // write(s+" "+sizeof(s)+" "+s[1..sizeof(s)-2]+"\n"); int openstart; if(s[0]=='(') openstart=1; else openstart=0; int openend; if(s[sizeof(s)-1]==')') openend=1; else openend=0; sscanf(s[1..sizeof(s)-2],"%d,%d",int aa,int bb);
...
-
1 2 3 4 5 6 7 8 9
int main() { string s=Stdio.stdin->gets(); int n; sscanf(s, "%d",n); s=Stdio.stdin->gets(); int m=1; s=s+','; int startidx=0;
...
-
1 2 3 4 5 6 7 8 9
array(string) peta; array(int) ru; array(int) cu; array(int) jml; int cnt; void solve(int r, int c) { if (r < 0 || r >= 10 || c < 0 || c >= 10) return; if (peta[r][c] != '*') return;
...
-
1 2 3 4 5 6 7 8 9
int main() { int n=(int)Stdio.stdin->gets(); array(string) s=allocate(n); array(int) v=allocate(n); for(int i=0;i<n;i++) { array(string) b = Stdio.stdin->gets()/" "; s[i]=b[0]; v[i]=(int)b[1]; }
...
-
1 2 3 4 5 6 7 8 9
int main() { string s; int i,n,x,y,z; // array(int) a = ({0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}); s = Stdio.stdin->gets(); n = sizeof(s); x = (s[1] - 48) * 10 + s[2] - 48; if(s[5]>47) { y = (s[4] - 48) * 10 + s[5] - 48;
...
-
1 2 3 4 5 6 7 8 9
int intersects(int a, int b, int c, int d) { return a <= d && c <= b; } int getColors(array(int) left, array(int) right, array(int) group) { int l = 0; int r = 0;
...
-
1 2 3 4 5 6 7 8 9
int main() { int n=(int)Stdio.stdin->gets(); array(string) s=allocate(n); array(int) v=allocate(n); for(int i=0;i<n;i++) { array(string) b = Stdio.stdin->gets()/" "; s[i]=b[0]; v[i]=(int)b[1]; }
...
-
1 2 3 4 5 6 7 8 9
int n; array(int) a,b; int solve(int pos, int mn, int st) { if (pos == n) { b[st] += mn; return 1; }
...
-
1 2 3 4 5 6 7 8 9
int main() { sscanf(Stdio.stdin->gets(),"%d",int n); array(int) a=allocate(n,0),b=allocate(n,0); for(int i=0;i<n;++i) { sscanf(Stdio.stdin->gets(),"%s",string s); write(s+" "+sizeof(s)+" "+s[1..sizeof(s)-2]+"\n"); int openstart; if(s[0]=='(') openstart=1; else openstart=0; int openend; if(s[sizeof(s)-1]==')') openend=1; else openend=0; sscanf(s[1..sizeof(s)-2],"%d,%d",int aa,int bb);
...
-
1 2 3 4 5 6 7 8 9
int solve(array(array(int)) map) { array(int) len = ({0,0,0,0,0}); for (int i = 0; i < 10; ++i) { for (int j = 0; j < 9; ++j) { if(map[i][j] == 1 && map[i][j+1] == 1) { int end = j+1; while(end < 10 && map[i][end] == 1) ++end; int l = end - j + 1;
...
-
1 2 3 4 5 6 7 8 9
int main(){ mapping used = ([]) ; int n = (int)Stdio.stdin->gets(); for (int i=0; i<n; i++){ array cur = Stdio.stdin->gets() / " "; if (!mappingp(cur[0])){ used += ([cur[0]:cur[1]]); } else if (used[cur[0]] < cur[1]){ used[cur[0]] = cur[1];
...
-
1 2 3 4 5 6 7 8 9
int main() { string s=Stdio.stdin->gets(); int n; sscanf(s, "%d",n); s=Stdio.stdin->gets(); int m=1; s=s+','; int startidx=0;
...
-
1 2 3 4 5 6 7 8 9
int main() { string te = ""; te=Stdio.stdin->gets(); string as = ""; as=Stdio.stdin->gets(); int ct=0; string s="";
...
-
1 2 3 4 5 6 7 8 9
int main() { int i,n; mixed num[1033]; string input1=Stdio.stdin->gets(); string input2=Stdio.stdin->gets(); for(i=1;i<1033;i++)num[i]=1; write(num[500]); return 0;
...
-
1 2 3 4 5 6 7 8 9
int main() { sscanf(Stdio.stdin->gets(),"%d",int n); array(int) a=allocate(n,0),b=allocate(n,0); for(int i=0;i<n;++i) { sscanf(Stdio.stdin->gets(),"%s",string s); write(s+" "+sizeof(s)+" "+s[1..sizeof(s)-2]+"\n"); int openstart; if(s[0]=='(') openstart=1; else openstart=0; int openend; if(s[sizeof(s)-1]==')') openend=1; else openend=0; sscanf(s[1..sizeof(s)-2],"%d,%d",int aa,int bb);
...
-
1 2 3 4 5 6 7 8 9
int intersects(int a, int b, int c, int d) { return a <= d && c <= b; } int getColors(array(int) left, array(int) right, array(int) group) { int l = 0; int r = 0;
...
-
1 2 3 4 5 6 7 8 9
int main(){ mapping used = ([]) ; int n = (int)Stdio.stdin->gets(); for (int i=0; i<n; i++){ array cur = Stdio.stdin->gets() / " "; if (!mappingp(cur[0])){ used += ([cur[0]:cur[1]]); } else if (used[cur[0]] < cur[1]){ used[cur[0]] = cur[1];
...
-
1 2 3 4 5 6 7 8 9
int main() { string s=Stdio.stdin->gets(); int n; sscanf(s, "%d",n); s=Stdio.stdin->gets(); int m=1; s=s+','; int startidx=0;
...
-
1 2 3 4 5 6 7 8 9
int main() { string te = ""; te=Stdio.stdin->gets(); string as = ""; as=Stdio.stdin->gets(); int ct=0; string s="";
...
-
1 2 3 4 5 6 7 8 9
int intersects(int a, int b, int c, int d) { return a <= d && c <= b; } int getColors(array(int) left, array(int) right, array(int) group) { int l = 0; int r = 0;
...
-
1 2 3 4 5 6 7 8 9
int main() { string s=Stdio.stdin->gets(); int n; sscanf(s, "%d",n); s=Stdio.stdin->gets(); int m=1; s=s+','; int startidx=0;
...


