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 <iostream> using namespace std; int main (){ int n, scanf("%d",&n); printf("%d\n",n);
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main (){ int n, scanf("%d",&n); printf("%d\",n);
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main (){ int n, scanf("%d",&n); printf("%d\",n);
...
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char chArr[10]; memcpy(chArr, "0123456789", 10); printf("%d", sizeof(chArr)); printf("%d", strlen(chArr));
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10]; memcpy (&ch, "0123456789", 10); printf("%d", sizeof(ch)); printf("%d", strlen(ch));
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10]; memcpy (ch, "0123456789", 10); printf("%d", sizeof(ch)); printf("%d", strlen(ch));
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10] = {i,n,s,h,a,i,n,s,h,a}; printf("%d", sizeof(ch)); printf("%d", strlen(ch)); }
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10] = {i,n,s,h,a,i,n,s,h}; printf("%d", sizeof(ch)); printf("%d", strlen(ch)); }
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10] = {i,n,s,h,a,i,n,s,h}; /*printf("%d", sizeof(ch)); printf("%d", strlen(ch));*/ }
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10] = {i,n,s,h,a,i,n,s,h,a}; printf("%d", sizeof(ch)); printf("%d", strlen(ch)); }
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10] = "inshainsh"; //printf("%d", sizeof(ch)); printf("%d", strlen(ch)); }
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10] = "inshainsh"; printf("%d", sizeof(ch)); printf("%d", strlen(ch)); }
-
1 2 3 4 5 6 7 8 9
#include "stdio.h" #include "string.h" main() { char ch[10]; ch = "inshainsha"; printf("%d", sizeof(ch)); printf("%d", strlen(ch));
-
1 2 3 4 5 6 7 8 9
SIGPACK_EWIDOD ø–óÅ IóÞ39®î×ì7Ùuù‡ØW ôÖEñû£ §ƒ@k|À¾î»ö±ÍúNÙžÑä)lnmˆ$2MCôi'ëúrÇSvM!©Yô…GÀj1µâ¬¬5É ¸„ħ}ßnïÚæ“‘½–ä´CB»GH¥÷tf…VlÕÄe¢±Îü¨ CÚƒß~çZ´ôRðì4ÞX!ÏþëfÐ,W3F<Â} <u‰Ñ‚ªã!í/F¬S™–x&bóéC·3ÊØq;ÖNvUm†É}_™[Ñ$˜(kHþ26Bæ!êCqž‡ ã1”~êd]YQ5òðÎo,Ri¨Ky™¦öP'e¯âO¦v—ßÑ4e±zkØ}ïÊ“JGv‘](%ïŸ[ŒOx>£#8–¦ý‚Õ¤YÓl˜ˆÀ¶¨}>¡+€•‹ŽÙšhÄvÿ˜jåúQŒÇÉü6»‰ÍÛ÷Ö»šfÍ›¡<PXà:óÒ2ôU¨‹}É-j»yä©•h1„|³ YÓ`H]¥f! OûÓ—©Ãˆ¯D2¡xªâ±ç¼ñÁºz‰K%P š–¡5G—Ûet@Âó¹ÁÞ‡àq‰þAñ¼EÉ¢'@‚dÙ # ÔñÙŠ w‹M$Æã;˜Ÿê4fi.%Bºû~·0ó1k„©¥Å4TåËŒR’ëÆ·’Ñê!uˆ‚Ê?~ž¸¡›–ìëÀï~(솦x×EDÑ4H r7¥ˆ!ÝR‰pÑÁRé€ý»¢”†ƒ ¥çj¢íGXòŠž#¨Æïï_LAšsjœÛÈ߯ÈÔ²,ŸÜ¹Û«ƒóE²ò‹´”\â Š$´r°ãܧ#‰¬Á$³YZ*"ÖµDüç³Æ3t¾µ”]ò<UôЉHØ,§3J!ÿû\ébqul‘YQ'ÝmÒ{–†(gò°hPC$Mrˆóv¾à_êÕÀÎ飱ZÒŒñ±ü?Eùwè õdZ5x1 · Š‚^6=–ù ^Ý&ËøÎÙ9[¯‰ªGÔ¦$÷›T°"ñá{ñCoÁ{QS•ÂóM”£Nqu{Àä;Éà ÿj3¨©œé˜¶¦ Y'Yµƒ]`ˆ‰0EÕûÃ÷½‘Çn©þó±Ð)ÚÙßP®R. Nm‰NdO—àŽÝ7 j™'cN)ŒÉˆ¼¦9á[2Þ„ií3ß{(î]ůË/M*Wû۳愨Ÿ6p²ÑªNbœãê÷QÕ½Fƈµˆ€Ne+ö,/ÄÔ+ÔVgÃ\xh_’Œ7s0y‚ ÍWu\m£ ü.‘äP[¸àÈÆØ¯˜pÌWÞU×%É©1Øåä» ˆ9óI–ê_º1Ãéþ«‡•K‚تIK改öš"òyžÒ5PËU“¿«]·áÔ¹iáÔ‹Q”WÙnœ=“3Ynà<Ó¹ý޳В×ÊÅD}í‚F)6w`V˱LÌ´¨Ã
-
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
#include <stdio.h> int main(){ print ("KONTOLLLLLLLLLL FUCKKKKKKKKK"); }
-
1 2 3 4 5 6 7 8 9
using System; public class Test { public static void Main() { int n; int count = 0;
...
-
1 2 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1
BEGIN { print "hi"}
-
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 3 4 5 6 7
{ num = $1; if(num == 42) exit; else printf("%d\n", num); }
-
1
-
1
-
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 8 9
#вырезаем 1-ое и 3-ие поля в temp001 и только 1-ое в temp01 , удаляем total ls -li >$HOME/temp00 cut -f1 -d' ' $HOME/temp00 |grep -v total >$HOME/temp01 cut -f1,13 -d' ' $HOME/temp00 |grep -v total >$HOME/temp001 #сортируем для того чтобы применить join sort +0 -1 $HOME/temp01 >$HOME/temp02 sort +0 -1 $HOME/temp001 >$HOME/temp002
...
-
1 2 3 4 5 6 7 8 9
<project default="test"> <target name="test"> <webtest name="check that WebTest is Google's top 'WebTest' result"> <invoke url="http://www.google.com/ncr" description="Go to Google (in English)"/> <verifyTitle text="Google" /> <setInputField name="q" value="WebTest" />
...
-
1 2 3 4 5 6 7 8 9
<project default="test"> <target name="test"> <webtest name="check that WebTest is Google's top 'WebTest' result"> <invoke url="http://www.google.com/ncr" description="Go to Google (in English)"/> <verifyTitle text="Google" /> <setInputField name="q" value="WebTest" />
...
-
1 2 3 4 5 6 7 8 9
<project default="test"> <target name="test"> <webtest name="check that WebTest is Google's top 'WebTest' result"> <invoke url="http://www.google.com/ncr" description="Go to Google (in English)"/> <verifyTitle text="Google" /> <setInputField name="q" value="WebTest" />
...
-
1 2 3 4 5 6 7 8 9
abc() { local -a R local n case $# in 1) n=1 ;; 2) n=$2 ;; *) echo "NIE TAK" >&2 exit 2;;
...


