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
#include <stdio.h> #include <string.h> #define N 5 char *min(char *p[] , int n); int main(void) { char *p[N] = {"Hello" , "Hi" , "Happy" , "HaHaHa" , "Heaven"}; printf("%s\n" , min(p, N));
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> void main() { int a, b,c; a=5.5; b=6.8; c=a+b; printf("%d,%d,%d",a,b,c); }
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <string.h> #define N 5 char *min(char *p[] , int n); int main(void) { char *p[N] = {"Hello" , "Hi" , "Happy" , "HaHaHa" , "Heaven"}; printf("辞書式配列で先頭となる文字列は%s\n" , min(p, N));
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <string.h> #define N 5 char *min(char *p[] , int n); int main(void) { char *p[N] = {"Hello" , "Hi" , "Happy" , "HaHaHa" , "Heaven"}; printf("辞書式配列で先頭となる文字列は%s\n" , min(p, N));
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> int main() { int i,j,k,count=0,sum; for(i=2;i<=200;i++) { count=0; sum=0; for(j=1;j<=i;j++)
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> void main() { int a, b,c; a='a'; b='f'; c=a+b; printf("%d,%d,%d",a,b,c); }
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <string.h> #define N 5 char *min(char *p[] , int n); int main(void) { char *p[N] = {"Hello" , "Hi" , "Happy" , "HaHaHa" , "Heaven"}; printf("辞書式配列で先頭となる文字列は%s\n" , min(p, N));
...
-
1 2 3 4 5 6 7 8
#include<stdio.h> void main() { int a, b,c; a='a'; b='f'; c=a+b; printf("%d,%d,%d",a,b,c);
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <string.h> #define N 5 char *min(char *p[] , int n); int main(void) { char *p[N] = {"Hello" , "Hi" , "Happy" , "HaHaHa" , "Heaven"}; printf("辞書式配列で先頭となる文字列は%s\n" , min(p, N);
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> void main() { int a, b,c; a='a'; b='b'; c=a+b; printf("%d,%d,%d",a,b,c); }
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> void main() { int a, b,c; a='a'; b='b'; c=a+b; printf("%d",c); }
-
1
main(){int a = -1; a = +-+a+++-a^a-~+++a^-a++; printf("%x\n",a);}
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> void func1(int mc[]) { mc[1]=25; *(mc+3)=45; } void func2(int nd[])
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> void func1(int mc[]) { mc[1]=25; *(mc+3)=45; } void func2(int nd)
...
-
1 2 3 4 5 6 7 8 9
int arr[51][51],mark[51][51],h,w; int fun(char c, int a, int b) { int k,l,q=0,Max=0; for (k=-1;k<=1;k++) for (l=-1;l<=1;l++) { if (a+k>=0 && a+k<h && b+l>=0 && b+l<w && !(k==0 && l==0)) { if (arr[a+k][b+l]==c+1 && (mark[a+k][b+l]==0))
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> void func1(int mc[]) { mc[1]=25; *(mc+3)=45; } void func2(int nd)
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> void func1(int mc[]) { mc[1]=25; *(mc+3)=45; } void func2(int *nd)
...
-
1 2 3 4 5 6 7 8
#include <stdio.h> //x y n pueden ser sustituidos por algun valor #define x x #define n n int a[n]; int xp; int p;
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> void func1(int mc[]) { mc[1]=25; *(mc+3)=45; } void func2(int *nd)
...
-
1 2 3 4 5 6 7 8
#include <stdio.h> //x y n pueden ser sustituidos por algun valor #define x x #define n n int a[n]; int xp; int p;
...
-
1 2 3 4 5 6 7 8
#include <stdio.h> //x y n pueden ser sustituidos por algun valor #define x x #define n n int a[n]; int xp; int p
...
-
1 2 3 4 5 6 7 8
#include<stdio.h> int main() { int i,j; for(i=8,j=0;i>0;i/=2,j+=i); printf("%d",j); return 0; }
-
1 2 3 4 5 6 7 8
#include<stdio.h> int main() { int i,j; for(i=5,j=0;i>0;i/=2,j+=i); printf("%d",j); return 0; }
-
1 2 3 4 5 6 7 8
#include<stdio.h> int main() { int i,j; for(i=5,j=0;i>0;i/=2,j+=i); prinf("%d",j); return 0; }
-
1 2 3 4 5 6
int main() { int i,j; for(i=5,j=0;i>0;i/=2,j+=i); prinf("%d",j); }
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> //#include<conio.h> int main() { int t, n, i, j, count; scanf("%d", &t); int temp=t; int ans[t];
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<conio.h> int main() { int t, n, i, j, count; scanf("%d", &t); int temp=t; int ans[t];
...
-
1 2 3 4 5 6 7 8 9
get inputoutput get characterarray get standardinputoutput get charactertype get mathalgorithms get console start() { alpha c[20]
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> //#include<conio.h> int main() { int t, n, i, j, count; scanf("%d", &t); int temp=t; int ans[t];
...
-
1 2 3 4 5 6 7 8 9
#include<stdio.h> #include<conio.h> int main() { int t, n, i, j, count; scanf("%d", &t); int temp=t; int ans[t];
...


