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
#ifndef GUI_H #define GUI_H #include "globals.h" VOID PIRLOGAPI CreateGUI(HINSTANCE hInstance); VOID PIRLOGAPI DestroyGUI(); VOID PIRLOGAPI DispatchCall(LPVOID lpvReturnAddress); VOID PIRLOGAPI MessageLoop();
...
-
1 2 3 4 5 6 7 8 9
//------------------------------------------------------------------------ // PtInRect Logger // // * User-friendly GUI that logs addresses that call PtInRect and allows // the user to filter out specific calls. // * Hopefully thread-safe // Coded by Franc[e]sco //------------------------------------------------------------------------ // 04/02/2012 - rev1
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdio.h> #include<string.h> using namespace std; int cont, n, m, casos, ancho; bool vis[30][30]; char matriz[30][30]; char linea[30];
...
-
1 2 3 4 5 6 7 8
#include <iostream> using namespace std struct tNode { int value; tNode *left,*right; };
...
-
1 2 3 4 5 6 7 8 9
# include <iostream> using namespace std; # include <stdio.h> int main() { char a[100000],b[100000],c[100000]; int i =0,j=0,k=0,flag=0; for(i=0;i<100000;i++) {
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<math.h> using namespace std; int main() { int i,t; cin>>t; float a[t],b[t]; for(i=0;i<t;i++)
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std static void addNode (tNode *parent, char leftRight, int value) { tNode *node = new tNode(); node->value = value; node->left = 0; node->right = 0; if (parent == 0)
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<math.h> using namespace std; int main() { int i,t; cin>>t; float a[t],b[t]; for(i=0;i<t;i++)
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; void swap(int &x,int &y) { int z; z=y; y=x; x=z; }
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int d[6000000]={0}; int main() { long long a,b,c,count=0,e; cin>>a>>b>>c; for (int i=0;i<c;i++){ cin>>e; d[e]=10;
...
-
1 2 3 4 5 6 7 8 9
#include<iostream> #include<stdio.h> #include<string.h> using namespace std; int cont, n, m, casos, ancho; bool vis[30][30]; char matriz[30][30]; char linea[30];
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int x ; int y ; int z ; scanf("%d %d %d",&x,&y,&z); if(x<y&&x<z&&y<z) {
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B { void bar() {puts("Здарово, я B.");}
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<stdlib.h> long long int n,m,t,d,total=0,dra=0,tmp=0,i,j,bad[999999]={0},bl[999999]={0},x=1; int main () { scanf("%lld%lld%lld",&n,&t,&m); for(i=1;i<=m;i++){ scanf("%lld",&tmp); bad[tmp]=1; }
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B {
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <cmath> float power (float, float); using namespace std; int main() { float a, x, y, z;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <stdio.h> using namespace std; int main() { int k=0,temp;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B {
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <map> using namespace std; int main() { map<int,int> DB; map<int,int>::iterator iter; int n,t,num;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <stdio.h> using namespace std; int main() { int k=0,temp;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <map> using namespace std; int main() { map<int,int> DB; map<int,int>::iterator iter; int n,t,num;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B {
...
-
1 2 3 4 5 6 7 8 9
#include <cstdio> #include <iostream> #include <algorithm> using namespace std; int main(){ int n,t,m,i,j,s[12345],pro[12345],temp=1,cnt,stop; scanf("%d%d%d",&n,&t,&m); cnt=m; for(i=0;i<m;i++){
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B {
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <cmath> float power (float, float); using namespace std; int main() { float a, x, y, z;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int x, y, d, n, kierunek, wartosc; main() { cin >> d; while(d--) {
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B {
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int x, y, d, n, kierunek, wartosc; main() { cin >> d; while(d--) {
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> struct A { void foo() {puts("Привет, я A.");} }; struct B {
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <cmath> float power (float, float); using namespace std; int main() { float a, x, y, z;
...


