이것이 경찰의 실입니다. 강도의 실 이 여기로갑니다 .

인쇄 가능한 ASCII 문자 (탭과 줄 바꿈 제외) 로만 구성된 프로그램이나 함수를 작성하여 인쇄 가능한 ASCII 문자를 5 개 이상 (오름차순에서 물결표 / 32 ~ 126까지) 오름차순으로 출력하십시오. 문자가 서로 인접한 한 문자를 여러 번 출력 할 수 있습니다. 단일 후행 줄 바꿈이 허용됩니다. 전체 출력을 제공해야하며 코드의 6 자마다 코드에 표시된 위치에서 한 문자를 제공해야합니다. 코드에 5 자 이하의 문자가 있으면 길이 만 표시해야합니다. 코드에서 6 당 1 문자 이상을 나타내서는 안됩니다.

따라서 코드 alphaprinter가 az에서 알파벳을 출력하면 코드의 두 문자를 표시해야합니다 (다른 문자에는 밑줄 사용).

al__________  // or
__p__p______  // or
__________er

규칙 / 사양 :

• 기능이없는 후행 공백은 추가 할 수 없습니다.
• 주석을 사용할 수는 없지만 강도는 코드를 크래킹 할 때 주석을 사용할 수 있습니다
• 내장 암호화 기본 요소 (rng, 암호화, 암호 해독 및 해시 포함)는 허용되지 않습니다.
• 언어에서 기본 출력은 MATLAB에서 같다 : ans =,의 허용 그만큼이 있어요으로 명확하게 언급 하고 같이 ans =출력된다. 이것이 "오름차순 출력"의 일부인지 여부도 명확하게 명시해야합니다.
• 출력은 결정 론적이어야합니다
• 자유 언어 이외의 언어 는 사용할 수 없습니다
• 출력은 연속 문자 일 필요는 없습니다. 모두 abcde와 abcdg유효 출력입니다.
• 출력에 5 자 이상이 포함되어 있으면 문자를 구분할 필요가 없습니다. aaaaa및 aaacc유효합니다.
• REPL 환경이 올바른 프로그램이나 기능으로 간주되지 않으므로 허용되지 않는다고 가정 한 답변입니다.
• STDERR은 유효한 출력으로 간주되지 않지만 STDERR에 데이터가 기록 될 수 있습니다.

공개 된 문자가 밑줄 인 경우 아래 표시된대로 식별해야합니다. 이 경우 두 번째와 여섯 번째 문자는 밑줄로 표시되고 다른 문자는 알 수 없습니다.

_____________
 |   |

참고 : 강도는 동일한 출력을 생성하는 코드 만 찾으면됩니다. 언어, 강도 솔루션의 길이 및 공개 문자의 위치도 일치해야합니다.

점수는 코드의 문자 수입니다. 우승자는 7 일 동안 금이 간 점수가 가장 낮은 제출물이됩니다. 2015 년 (UTC)에 게시 된 제출물 만 승리 할 수 ​​있습니다. 이보다 늦게 게시 된 제출물은 환영하지만 이길 수는 없습니다.

승리를 주장하려면 7 일 후 전체 코드를 공개해야합니다.

게시물의 형식은 다음과 같습니다 (nn은 문자 수임).

언어, nn 자

산출:

abcdefghijklmnopqrstuvwxyz

코드 (12 자) :

al__________

코드에 크랙이 발생한 경우 헤더에 [Cracked] (크래커 링크)를 삽입하십시오. 제출이 안전한 경우 헤더에 "안전"을 삽입하고 답변에 전체 코드를 표시하십시오. 전체 코드를 공개 한 답변 만 승리 할 수 ​​있습니다.

Hexagony , 8 자, 안전

_______.

인쇄물

123456

온라인으로 Hexagony 를 시험해 볼 수 있습니다

해결책

`&)!."@.

는 `인터프리터가 함께 실행하지 않는 한 그것의 측면 길이 3. 필요 같은 코드를 보이게 단지 오분입니다 -d레이아웃을 결정하기 전에 단순히 소스 코드에서 제거 된 백틱. 나중에 코드는 측면 길이 2에 맞습니다.

 & )
! . "
 @ .

이렇게하면 메모리 격자의 한 육각형 주위로 메모리 포인터 (MP)가 이동하고 값을 다음 가장자리로 복사하여 증가시키고 인쇄합니다.

MP가 표시된 위치를 시작하면서 메모리 격자 모양은 다음과 같습니다.

처음에는 모든 모서리가 0입니다. 첫 번째 &는 no-op이지만 )가장자리를 증가시키고를 !인쇄합니다 1. 그런 다음 "왼쪽으로 다시 이동합니다 ( 2 라고 표시된 가장자리 ). 거기에 &값을 복사합니다. 가장자리가 현재 0이므로 왼쪽 이웃 (MP 방향)이 복사되어 1인쇄됩니다. )증분하고를 !인쇄합니다 2. 새 가장자리를 방문하고 최대 자릿수까지 인쇄하는 한 계속됩니다 6. 우리가 시작한 가장자리를 칠 때 대신 오른쪽 가장자리 &를 복사합니다 (가장자리 값이 양수이기 때문에) 가장자리가 다시되고 제어 흐름이 마지막 행으로 이동합니다.0@ 프로그램을 종료합니다.

온라인으로 사용해보십시오.

Perl, 46 자 (안전)

산출:

((()))*++,---../00011123445556667779::;;<<==??@@AAACEFGHHHIKKMMNOOOPPQQQRRSSSVWXXYY[[[\]]]^^^```aaeeffggghjjjnpppqqrttuwxxyzz{{{

암호:

print _______________________________________;

어떻게 든 일주일 동안 원본을 삭제할 수는 있지만 이것이 옳다고 생각합니다.

print chr()x(($i=($i*41+7)%97)&3)for(40..123);

Mitch Schwartz에 의해 깨지는 Brainfuck, 48 자

나는 강도를 위해 이것을 만들었습니다. 확실히 우승작이 될 수는 없습니다 :)

____[_____[_______]__]___[___________]___[_____]

이 결과는 다음과 같습니다.

ABCDEFGHIJKLMNOPQRSTUVWXYZ

해결책:

++++[>++++[>++++<-]<-]+++[>++++++++<-]>++[>+.<-]

나는 그것을 여기에서 테스트했다 .

힌트 : 온라인 생성기 하하가 생성 한 프로그램을 찾지 마십시오. 이것은 손으로 작성되었으며 논리적 사고로만 해결할 수 있습니다. :)

CJam, 13 자

_____________
  ||

인쇄물

7LLMYahnsuv

CJam을 온라인으로 사용해 볼 수 있습니다.

해결책

{`__Jf^er$}_~

나는 경찰에게 일반화 된 퀴니에 기반을 둔 것이 꽤 영리하고 참신하다고 생각했습니다. 내가 이것을 게시하는 순간, 나는 그것이 쓸모 __없고 er완전히 쓸모가 없다는 것을 깨달았습니다. 그래서 나는 더 경쟁력있는 점수를 얻기 위해 8 바이트 CJam 경찰을 게시했습니다. 피 에투는 그 중 하나를 금방 깨뜨 렸습니다. 불필요하게 복잡한 문자 음역이 그것을 저장했다고 가정합니다.

어쨌든 코드는 자체 문자 (을 제외하고 _~)를 사용하고 XOR은 난독 화를 위해 각각 19를 사용하여 정렬합니다.

이 경찰은 내가 실제로 여기에서 사용하지는 않지만 xorting 의 "발견"으로 이끌었 습니다.

시끄러운 3SP , 89 자 (안전)

0 _____________________________ _ _ _ _ _ _ _ _ _ __2_2__________________________________

오리지널 프로그램 :

0 0 0 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 0 3 2 2 2 2 0 3 0 1

이 프로그램은

 !"#$$

(앞 공간을 참고하십시오), 그리고 다른 것은 없습니다!

설명 (* n은 메모리의 n 번째 셀을 나타냄) :

0 0 0                                Increment *0 to 3 (via the 0s in *0, *1, and *2)
2 (32 times)                         Increment *3 to 32 (via the 0 in *2 and the 3 in *0)
                                      (Note that *3 mod 256 is the character that prints)
0                                    Increment *32 (via the 3 in *0 and the 32 in *3)
3                                    Increment *1 (via the 32 in *3 and the 1 in *32)
                                      (Note that printing is on when *1 mod 2 is 1,
                                       which means " " prints right here)
2 (4 times)                          Increment *3 to 36 (printing '!"#$')
0                                    Increment *36 (via *3) (printing "$" again)
3                                    Increment *1 to 2 (via *36) (printing turns off)
0                                    Increment *36 to 2 (via *3)
1                                    Increment *0 to 4 (via *2)

마지막 두 명령은 프로그램을 통한 후속 패스에서 1이 다시 증가하지 않도록하기에 충분하다는 것으로 판명되었습니다. 즉, 모든 메모리 주소를 * 36에서 영원히 값 36으로 설정하더라도 계속 인쇄되지 않습니다. .

JavaScript (ES6), 60 자, 사용자 가 크래킹 함

이길 것이라고 약속하지는 않지만 크랙하기를 바랍니다.

e_e_______a__a____e___e________e__o___________o______o______

이것은 다음을 반환하는 함수입니다.

    :ERacddeeeeeeffiinnnoorrrrst
^^^^ -> 4 whitespaces

편집하다

user81655가 문자별로 해독했습니다 .

e=e=>{try{a}catch(e){return[...e.toString()].sort().join``}}

MATLAB Octave, 27 자, 안전

도전

새로운 언어 제한과 관련하여 : Octave에서도 작동합니다.

____________3_3___4_3______

출력 (옥타브 단위) : ( ans =출력의 일부가 아니며 출력의 첫 문자는 ")

ans = """""""""""""""""""""""""""""""""""""""""""########$$$$$$%%%%&&&&'''(()))**++,,-../001223456789:;<=>?@BCDFGHJKMNPRTUWY[]_acehjloq

출력 (Matlab에서) : ( ans = \n\n출력의 일부가 아니며 출력은 마지막 줄입니다)

ans =

"""""""""""""""""""""""""""""""""""""""""""########$$$$$$%%%%&&&&'''(()))**++,,-../001223456789:;<=>?@BCDFGHJKMNPRTUWY[]_acehjloq

해결책

[fix((0:.07/3:3).^4+34),'']

기본적으로이 함수를보고 ASCII 값으로 변환했습니다.

R, 60 바이트 크랙 plannapus에 의해

산출:

0123456789ABCDEFGHTUVWXYZdefghijklmnopqrstuvw

암호:

___(_(_:_____________]_____________6]_______s_4_____,___=___

나는 이것이 그렇게 어렵지 않을 것이라고 생각한다. 우리는 볼 것이다.

Jolf , 27 자, Adnan에 의해 금이

________W___________--_____
                         |

인쇄물

abcdefghijklmnopqrst

통역사 .

원본 코드 :

on*2toHEWn)oH+H `pl$--$n}_H
on                          set n
  *2t                        to twenty
     oHE                    set H to the empty string
        Wn)                 while(n){
           oH+H             append to H
                `pl$--$n     get the nth character of the alphabet, decrement n before
                        }   }
                         _H print H reversed

Adnan에게 축하드립니다! 넌 날 무서워

여기에서 제출을 테스트하여 제거해야하는 문자 수를 확인할 수 있습니다.

setInterval(function(){r=document.querySelector("textarea").value;document.getElementById("output").innerHTML=r.length/6-r.split("").filter(function(x){return x=="_"}).length|0},20)

*{font-family:Consolas,monospace}textarea{width:100%;resize:none;height:auto;min-height:1.2em;}b{color:red;}

<textarea>Example Program</textarea><div>You must reveal <b id="output">n</b> characters.</div>

포트란, 45 자, 안전

완전한 출력 :

 !"$)0<Ka|

고양이 는 여기에 그것을 부수 려고

코드 (45 자) :

pr_gr_m____________________/___3____________

프로그램 코드 :

program t;print*,(char(i**3/8+33),i=1,9);end

PHP, 46 자, 안전

출처:

for(_______________________=________________);

84 자 길이의 문자열을 출력합니다.

!!"#$%&'()*+,-./0123456789::;<=>?@AABCDEEFGHIIJKLLMNNOPPQRRSTTUUVWWXXYYZZ[[\\]]^^__`

힌트

뭐라고 했어? 내 사촌이 관련되어 있습니까?

공개 된 코드

이 방법은 에서 시작하여 최대 64 자 까지 인쇄하므로 비교적 간단합니다 chr(32). 애매한 부분은 반복자 i가 선형으로 증가하지 않는다는 것입니다. 자체 코사인 값으로 증가하여 문자가 반복되거나 누락됩니다.

for(;$i<64;)echo chr(32+$i+=cos(deg2rad($i)));
for(_______________________=________________);

CJam, 8 바이트, Pietu1998에 의해 금이 간

__:_____

인쇄물

%*;a|~

당신은 할 수 있습니다 온라인 CJam을보십시오 .

05AB1E , 13 자, 갈라짐 quintopia에 의해 이 가짐

나는 바보입니다. 전원 기능 (-_-｡)을 구현하는 것을 잊었습니다. 난독 화 된 코드는 다음과 같습니다.

__D____<_____

내 원래 코드는 다음과 같습니다

99DF2}r<F*}bR

설명:

99DF2}r<F*}bR

99            # Pushes 99
  D           # Duplicates the top item
   F }        # Creates a for loop: For N in range(0, 99)
    2         # Pushes 2 (this will be done 99 times)
      r       # Reverses the stack
       <      # Decrement on the last item
        F }   # Creates a for loop: For N in range(0, 98)
         *    # Multiplies the last two item of the stack, which now looks like
              # [2, 2, 2, 2, 2, 2, 2, 2, ...]. Basically we're calculating 2^99
           b  # Converts the last item to binary
            R # Reverses the last item of the stack

출력됩니다 :

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001

예, 99 개의 0과 1입니다.

참고로 , 현재 전원 기능이 구현되어 있습니다. 따라서 6 바이트로 수행 할 수 있습니다.

Y99mbR

파이썬 3.4, 127 자

이것은 나의 첫 번째 구리 포스트입니다. 나는 그렇게 어렵거나 너무 분명하지 않다고 생각합니다.

난독 화 된 코드 :

_______inspect__________________getsource_____________________________________________print__________c*s_______________________

이 출력을 작성합니다 (처음에는 5 개의 공백이 있으며 총 길이는 7740 자임).

     """"""""""""(((((((((((((((((((((((((((((((((((((((((((((((((((((((()))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))**********************...................................................................................................................;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;==============================[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnoooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooopppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppprrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrsssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx

피 투스, 17 자, 파이 투 1998

산출:

""''''''''''''''''''''0000000000111111111122222222223333333333XXXXXXXXXX[[[[[[]]]]]]

암호:

___________#____1

내 해결책 :

Sjkm^dT%"'%#X"291

Pietu1998의 솔루션 :

S`u]G6*T`t"#X0231

254 자 Malbolge, Adnan에 의해 금이

암호:

_____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ _____ __

산출:

`AB\cd`

I kinda cheated by putting a space for every 6th character. Oh well...

Adnan's cracked code:

('&%: ^"!65 4Xzyx w4-Qs rpo'K mlk"' ~Dfdc ba}v< ::8[Z XnVlq }0/mO ,*MbK JH^6# 4`C|0 ?U=Sw uPsaq L4on2 Mjjh, ged)c '<$$p ]!};Y WiVxS eRQ>= ).K]l Ij"Fh gfedc b,=;z L\q%H X3E2C /ng-k N*KJI 8%6#D ~2^Ai >g<<d tUr`6 oJ"!1 /|{CU f)d>b <A_^! \};Yj yUxTS dtsr` ML

The original code:

bCBA@ ?>=<; :9876 54321 0/.-, +*)(' &%$#" !~}|{ zyxwv utsrq ponml kjihg fedcb a`_^] \[ZYX WVUTS RQPON MLKJI HGFED CBA@? >=<;: 9y165 43210 /.-,+ *)('& }C#"! ~wv<z \xwvu tsrqp onmlk jihgf e^$ba `_^W\ UyYXW VUTSR QPONM FKJIH GFEDC BA@9] =<;:9 27654 3210) M:

I cheated again by using a text-to-Malbolge generator for this code.

Mathematica 10.1, 98 characters, safe

Output is here. The entire output has 838,316 characters and a trailing newline.

Code:

Print[""<>Chara__________________________________________________________________________________]

Yes, this must be run in 10.1. _(hint) The original program:

Print[""<>Characters@ToCamelCase@ExampleData@{"Text","DonQuixoteIEnglish"}~SortBy~ToCharacterCode]

MATL, 8 characters, safe

Stable version of the compiler working in Octave hopefully coming soon. Meanwhile, this GitHub commit works, and in particular runs the original code that produces the indicated output

This submission counts as posted on December 28, 2015, 15:30 UTC

Output:

$**0016688??@HHQ

Code (8 characters):

_:______

Solution

6:9tX*Sc

What it does:

6:9          % numeric vector [6 7 8 9]
t            % duplicate
X*           % Kronecker tensor product
S            % sort in ascending order 
c            % convert to char. Implicit display

Labyrinth, 5 bytes, Cracked by Adnan

_____

prints

000000

My original code was:

<!!@ 

Note the trailing space.

I suppose I should have gone for more characters and revealed one of the !, because Adnan's solution only grows linearly when adding more !, while mine grows quadratically.

PHP, 28 characters

<?=________________________;

Outputs the string

abcdefghijklmnopqrstuvwxyz

ES6, 17 characters, cracked by Cᴏɴᴏʀ O'Bʀɪᴇɴ

__=____=_________

This is a function that will return the string

11233

JavaScript, 83 chars, Cracked by Martin Büttner

Output

Hi~~~

Code

_=____r____=u____=__s__=_________=__________________u_______A__________e______"_~_"

Output is in the JS console of a browser like Chrome/Firefox.
Original code (which might be invalid):

q=w=e=r=t=y=u=i=o=p=s=d=f=g=h=j=k=l=z=x=c=v=b=n=m="Huh"[0]+"Alarms in here"[7]+"~~~"

Pyth, 6 characters, cracked by Pietu1998

Code:

S_____

Output:

.0113345678888999

You can try Pyth here

JavaScript ES6, 134 characters

Huh boy, that was fun. Good luck!

_=_=_____l____.______.________(___}__;___=______ru____"_____+_[________]______!____]__[_________e________.__U_________)__________\_____

Outputs:

((((((()))))))+...000000000000000000002233=>AAAAAAAAAAABBBBBCCCCCCCCCCCCCCCCCCDDDDDDDEEEEEEEEEEEEEEEEEEEFFFFFFFGHIIIIIIIIIIIIIIIIJJJJLLMMNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOPRRRRRRRSSSSTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUVVVVVVXXY[[[[[[[[]]]]]]]]````ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffffffffffffffffffffffffffffffffffffffffffffffiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiinnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu{{{{{{}}}}}}

CJam, 12 characters, Cracked by jimmy23013

Output

#$%&'()*+,-./:;<=>?@[\]^_`

Code

_:____#_____

Seriously, 7 bytes, Cracked by Martin Büttner

______S

Output:

   deeknnoow

Shouldn't be too difficult, even if the result is not exactly what you'd expect.

Python 3, 58 characters, cracked by Mitch Schwartz

Code:

______________print(_______(_______________________)_____)

import string;print(''.join(sorted(string.printable))[5:])

Output:

 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~

Befunge, 11 characters, cracked (in funge-98) by MegaTom

Output:

1223788

Obfuscated code:

________.__

All one line, since the rules prohibit newlines. Tested using http://www.quirkster.com/iano/js/befunge.html .

Edit: This is legally cracked since I didn't specify a version, but note that there's a Befunge-93 solution still out there.

Perl 5, 30 bytes, cracked by Adnan

Code:

print_________________________

Output:

9:;@AFGHLMNRSTYZ_`a

Cracked:

Adnan found a trivial crack: obviously, I didn't think this puzzle through well enough. I've composed another instead.

Python 2, 62 chars, Cracked by Adnan

______________________________________________________________
         | |   ||                  |  |  ||

It kinda looks like a table.

This outputs the string abcde.

Adnan's code:

print "ab_c_de___".replace("_","")#___________________________

My code:

f=lamda _,__,___:"abcde"+'f'*sum(_,__,___)*000;print f(1,2,3);