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
/*Oscar Lupiañez*/ #include <stdio.h> #include <stdlib.h> #include <math.h> //variable global float pi= 3.141592;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,i,j ,su ; scanf("%d",&i); if(i>=1&&i<=1000){ for(j = 0;j<i;j++){ scanf("%d",n);
...
-
1 2 3 4 5 6 7 8 9
pid_t forkexec(int *infd, int *outfd, const char *command) { int pid = fork(); switch (pid) { case -1 : return pid; case 0 : if (infd != NULL) {
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int n,i,j ,su ; scanf("%d",&i); if(i>=1&&i<=1000){ for(j = 0;j<i;j++){ scanf("%d",n);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int addOne(int x) { return (-(~x)); } /* Driver program to test above functions*/ int main() {
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main() { int j, n,k; scanf("%d", &k); printf("\n"); if (k >= 1 && k <= 1000) for (j = 0; j < k; j++) { scanf("%d", &n);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> typedef void v; typedef int i; int main() { v fun(i, i); fun(2, 3); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> typedef void v; typedef int i; int main() { v fun(i, i); fun(2, 3); return 0;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main() { int j, n,k; scanf("%d", &k); if (k >= 1 && k <= 1000) for (j = 0; j < k; j++) { scanf("%d", &n); printf("%d\n", (n * (3 * n + 1))/2);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main() { int j, n,k; scanf("%d", &k); if (k >= 1 && k <= 1000) for (j = 0; j < k; j++) { scanf("%d", &n); printf("%d\n", (n * (3 * n + 1))/2);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main() { int i, j, n, m,k, sum = 0; scanf("%d", &k); if (k >= 1 && k <= 1000) for (j = 0; j < k; j++) { sum = 0; scanf("%d", &m);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main() { int i, j, n, m,k, sum = 0; scanf("%d", &k); if (k >= 1 && k <= 1000) for (j = 0; j < k; j++) { sum = 0; scanf("%d", &m);
...
-
1 2 3 4 5 6 7 8 9
/* K&R Exercise 4-8 */ /* Steven Huang */ #include <stdio.h> int buf = EOF; /* buffer for ungetch */ int getch(void) /* get a (possibly pushed back) character */ {
...
-
1 2 3 4 5 6 7
typedef struct {} type; int main() { type* pType = malloc (sizeof(type)); return 0; }
-
1 2 3 4 5 6
#include<stdio.h> int main() { printf("Hello World"); return 0; }
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int triple(int nombre) { return 3 * nombre; } int main(int argc, char *argv[])
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main() { int nombre = 0; printf("tapez un nombre"); scanf("%d",&nombre); }
-
1 2 3 4 5 6 7
#include <stdio.h> #include <stdlib.h> void main() { printf("main"); }
-
1 2 3 4 5 6 7
#include <stdio.h> #include <stdlib.h> void bonjour() { printf("main"); }
-
1 2 3 4
void bonjour() { printf("main"); }
-
1 2 3 4 5 6 7
#include <stdio.h> #include <stdlib.h> void main() { printf("main"); }
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { int n=4294967291u, i, d; n=2147483629; //printf("%u\n", n);return 0; for( d=5; d*d<=n; d+=6 ) ; d-=6;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { int n=4294967291u, i, d; n=2147483629; printf("%u\n", n);return 0; for( d=5; d*d<=n; d+=6 ) ; d-=6;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { unsigned int n=4294967291u, i, d; printf("%u\n", n);return 0; for( d=5; d*d<=n; d+=6 ) ; d-=6; printf("%u %u\n",d,d*d);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { unsigned int n=4294967291u, i, d; for( d=5; d*d<=n; d+=6 ) ; d-=6; printf("%u %u\n",d,d*d); return 0;
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { unsigned int n=4294967291, i, d; for( d=5; d*d<=n; d+=6 ) ; d-=6; printf("%u %u\n",d,d*d); return 0;
-
1 2 3 4 5 6 7 8
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; };
...
-
1 2 3 4 5 6 7 8
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; };
...
-
1 2 3 4 5 6 7 8
#include <stdio.h> #include <stdlib.h> struct node { int data; struct node *next; };
...
-
1 2 3 4 5 6 7 8
/*Oscar Lupiañez*/ #include <stdio.h> #include <stdlib.h> #include <math.h> //variable global float pi= 3.141592;
...


