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 ggT (int a, int b) //Funktion definieren { int r; do { r=a%b; //r ist dann der Rest der Division if (r==0) // wenn r=0 dann Funktion beenden return b; else
...
-
1
35152431453322 23453314154244331545334533141442152443432422 22421114 23453314154244 3215441542
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1 2
awk ' { print $2} ' | ls
-
1 2
awk ' { print $1 } ' | ls
-
1 2
awk ' { print $1 } '
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1
2f558ef3cc05e4dc17f54e844f3b6af7a527c2fbc3801283ae2ef01a2960c6fa
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1
echo "Manish"
-
1
cat list
-
1
ls > list
-
1 2 3 4 5 6 7 8 9
{ num = 2 ; gum = 0 ; while(num > 0) gum = gum + 3; num = num - 1; exit; printf(num);
-
1 2 3 4 5 6 7 8 9
{ num = 2 ; gum = 0 ; while(num > 0) exit; gum = gum + 3; num = num - 1; printf(num); }
-
1 2 3 4 5 6 7 8 9
{ num = 2 ; gum = 0 ; whle(num > 0) exit; gum = gum + 3; num = num - 1; printf(num); }
-
1 2 3 4 5 6 7 8 9
{ num = 2 ; gum = 0 ; if(num < 0) exit; gum = gum + 3; num = num - 1; printf(num); }
-
1 2 3 4 5 6 7 8 9
1 f8 b08 08e7 9a4f4 e02032 30073f3 f473f4b1 52f05330b
...
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1 2 3 4 5 6 7 8
/* ACM Mid-Central Regional Programming Contest */ /* Solution to Problem F, "Instruens Fabulam" */ /* by Dr. Eric Shade, Computer Science Dept. */ /* Southwest Missouri State University */ #include <stdio.h> #include <stdlib.h> #include <string.h>
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> #include <string.h> #define LEFT '<' #define RIGHT '>' #define CENTER '=' Node_var_new {MAX_ROWS = 21 ; MAX_COLS = 19};
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> #include <string.h> #define LEFT '<' #define RIGHT '>' #define CENTER '=' Node_var_new {MAX_ROWS = 21 ; MAX_COLS = 19};
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> #include <string.h> #define LEFT '<' #define RIGHT '>' #define CENTER '=' Node_var_new {MAX_ROWS = 21 ; MAX_COLS = 19};
...
-
1 2 3 4 5 6 7 8 9
#include <stdio.h> #include <stdlib.h> #include <string.h> #define LEFT '<' #define RIGHT '>' #define CENTER '=' Node_var_new {MAX_ROWS = 21, MAX_COLS = 19};
...
-
1 2 3 4 5 6 7 8 9
BEGIN #include <stdio.h> #include <stdlib.h> #include <string.h> #define LEFT '<' #define RIGHT '>' #define CENTER '='
...
-
1 2 3 4
BEGIN {FS="["} Ff != gensub("^([^,]+).*","\\1","g",$0) { Ff = gensub("^([^,]+).*","\\1","g",$0) ; Lf = $NF ; if (length(Ml) > 0) { print Ml } } Ff == gensub("^([^,]+).*","\\1","g",$0) { if (length($NF) > length(Lf)) { Lf=$NF ; Ml=$0 } } END {if (length(Ml) > 0) { print Ml }}
-
1
mail -s "Subject" ranavats@bharatpetroleum.in


