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
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) { for(j=1;j<=i;j++) printf("*");
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> typedef struct nod { int value; struct nod *left; struct nod *mid; struct nod *right; } node;
...
-
1 2 3 4 5 6 7 8 9
#include <math.h> #define ARY_SIZE 100000000 /* * This routine returns -1 if input decimal number is negative * In successful case, it returns the integer complement of the input number * Algorithm: * 1. convert input to binary * 2. Flip each bit of the decimal number * 3. Convert back binary number to decimal
...
-
1 2 3 4 5 6 7
#include <stdio.h> int main(void) { int i; for (i = 0; i <= 15; i++) printf("%d\n", 12 % i); }
-
1 2 3 4 5 6 7 8 9
#include <math.h> #define ARY_SIZE 100000000 /* * This routine returns -1 if input decimal number is negative * In successful case, it returns the integer complement of the input number * Algorithm: * 1. convert input to binary * 2. Flip each bit of the decimal number * 3. Convert back binary number to decimal
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int is_prime(int num); int main() { int number; scanf("%d",&number); number = is_prime(number);
...
-
1 2 3 4 5 6 7
#include <stdio.h> int main(void) { int i; for (i = 0; i < 15; i++) printf("%d\n", i % 12); }
-
1 2 3 4 5 6
#include <stdio.h> int main(void) { for (int i = 0; i < 15; i++) printf("%d\n", i % 12); }
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) { for(j=1;j<=(2*i-1);j++) printf("*");
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) { for(j=1;j<=(2*i-1);j++) printf("*");
...
-
1 2 3 4 5 6 7 8 9
#include <math.h> #define ARY_SIZE 100000000 /* * This routine returns -1 if input decimal number is negative * In successful case, it returns the integer complement of the input number * Algorithm: * 1. convert input to binary * 2. Flip each bit of the decimal number * 3. Convert back binary number to decimal
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) { for(j=1;j=<i;j++) printf("%d",j);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main() { printf("SOU FODAO");
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { int i, a, n, b = 1; puts("整数aとbを入力してください"); scanf("%d %d", &a, &n);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> int main(void) { int i, a, n, b = 1; puts("整数aとbを入力してください"); scanf("%d %d", &a, &n);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) { for(j=1;j=<i;j++) {
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) for(j=1;j=<i;j++) { printf("%d",j);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int i,j,n; scanf("%d",&n); for(i=1;1<n;i++) for(j=1;j=<i;j++) { printf("%d",j);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main() { int a = 100, b=25; int result=a-b; printf("a-b = %i\n", result);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main() { int a = 100, b=25; result=a-b; printf("a-b = %i\n", result);
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> int main() { int a = 100, b=25; int result=a-b; printf("a-b = %i\n");
...
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <stdio.h> int main() { char *src = "This is the source string\0"; char dest[50]; char *ptr; printf("Sup bro?"); ptr = (char *)memccpy(dest, src, (int)'c', strlen(src));
...
-
1 2 3 4 5 6 7 8
#include <stdio.h> #include <stdlib.h> int main() { int a = 100, b=25; result=a-b; printf("a-b = %i\n");
...
-
1 2 3 4 5 6 7
#include <stdio.h> int main(void) { int x; for(; scanf("%d",&x) > 0 && x != 42; printf("%d\n", x)); return 0; }
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <stdio.h> int main() { char *src = "This is the source string\0"; char dest[50]; char *ptr; ptr = (char *)memccpy(dest, src, (int)'c', strlen(src)); printf("src = %#p, dest = %#p\n", src, dest);
...
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <stdio.h> int main() { char *src = "This is the source string\0"; char dest[50]; char *ptr; ptr = (char *)memccpy(dest, src, 'c', strlen(src)); if (ptr) {
...
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <stdio.h> int main() { char *src = "This is the source string\0"; char dest[50]; char *ptr; ptr = (char *)memccpy(dest, src, (int)'c', strlen(src)); if (ptr) {
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int n,rev=0; scanf("%d",&n); while(n!=0) { rev=rev*10; rev=rev+n%10;
...
-
1 2 3 4 5 6 7 8 9
#include <string.h> #include <stdio.h> int main() { char *src = "This is the source string\0"; char dest[50]; char *ptr; ptr = (char *)memccpy(dest, src, (int)'c', strlen(src)); if (ptr) {
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> main() { int n,rev=0; scanf("%d",&n); while(n!=0) { rev=rev*10; rev=rev+n%10;
...


