Make a longer lenguage program












8












$begingroup$


Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck







share|improve this question









$endgroup$








  • 1




    $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    4 hours ago






  • 1




    $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    4 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    3 hours ago
















8












$begingroup$


Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck







share|improve this question









$endgroup$








  • 1




    $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    4 hours ago






  • 1




    $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    4 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    3 hours ago














8












8








8


1



$begingroup$


Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck







share|improve this question









$endgroup$




Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges. That is because Lenguage cares only about the length of it's source and not the contents.



First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:



000 -> +

001 -> -

010 -> >

011 -> <

100 -> .

101 -> ,

110 -> [

111 -> ]


Finally the program is run as brainfuck1.



From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated $n$ times, where $n$ is strictly greater than the length of your program.



Answers will be scored in bytes with fewer bytes being better.



Here's a hacky program to calculate lenguage from brainfuck




1: For this challenge we will use wrapping cells and a non-wrapping tape.






code-golf quine brainfuck




code-golf quine brainfuck






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 6 hours ago









TRITICIMAGVSTRITICIMAGVS

34.2k10156366




34.2k10156366








  • 1




    $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    4 hours ago






  • 1




    $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    4 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    3 hours ago














  • 1




    $begingroup$
    +[.] Do I win? :P
    $endgroup$
    – Quintec
    4 hours ago






  • 1




    $begingroup$
    Perhaps it might be more interesting to score on the length of the output?
    $endgroup$
    – Jo King
    4 hours ago










  • $begingroup$
    @JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    @JoKing Actually since you are the only answerer do you mind if I change it?
    $endgroup$
    – TRITICIMAGVS
    3 hours ago










  • $begingroup$
    sure, i'll change my answer up
    $endgroup$
    – Jo King
    3 hours ago








1




1




$begingroup$
+[.] Do I win? :P
$endgroup$
– Quintec
4 hours ago




$begingroup$
+[.] Do I win? :P
$endgroup$
– Quintec
4 hours ago




1




1




$begingroup$
Perhaps it might be more interesting to score on the length of the output?
$endgroup$
– Jo King
4 hours ago




$begingroup$
Perhaps it might be more interesting to score on the length of the output?
$endgroup$
– Jo King
4 hours ago












$begingroup$
@JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
$endgroup$
– TRITICIMAGVS
3 hours ago




$begingroup$
@JoKing That's a good idea. Unfortunately it appears to be a bit late for that.
$endgroup$
– TRITICIMAGVS
3 hours ago












$begingroup$
@JoKing Actually since you are the only answerer do you mind if I change it?
$endgroup$
– TRITICIMAGVS
3 hours ago




$begingroup$
@JoKing Actually since you are the only answerer do you mind if I change it?
$endgroup$
– TRITICIMAGVS
3 hours ago












$begingroup$
sure, i'll change my answer up
$endgroup$
– Jo King
3 hours ago




$begingroup$
sure, i'll change my answer up
$endgroup$
– Jo King
3 hours ago










1 Answer
1






active

oldest

votes


















5












$begingroup$

8437495638205698686671 bytes



This translates to the brainfuck program:



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


Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



This is calculated by the function



f(n)=2*f(n-1)+n

f(0)=0


(submission pending change from code-golf to the shortest output)



664613997892457936451903530140172168 bytes



The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



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


This is calculated by the function



f(n)=2*f(n-1)+n

f(0)=0


With an input of 118.






share|improve this answer











$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "200"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f179325%2fmake-a-longer-lenguage-program%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    5












    $begingroup$

    8437495638205698686671 bytes



    This translates to the brainfuck program:



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


    Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



    This is calculated by the function



    f(n)=2*f(n-1)+n
    
f(0)=0


    (submission pending change from code-golf to the shortest output)



    664613997892457936451903530140172168 bytes



    The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



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


    This is calculated by the function



    f(n)=2*f(n-1)+n
    
f(0)=0


    With an input of 118.






    share|improve this answer











    $endgroup$


















      5












      $begingroup$

      8437495638205698686671 bytes



      This translates to the brainfuck program:



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


      Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



      This is calculated by the function



      f(n)=2*f(n-1)+n
      
f(0)=0


      (submission pending change from code-golf to the shortest output)



      664613997892457936451903530140172168 bytes



      The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



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


      This is calculated by the function



      f(n)=2*f(n-1)+n
      
f(0)=0


      With an input of 118.






      share|improve this answer











      $endgroup$
















        5












        5








        5





        $begingroup$

        8437495638205698686671 bytes



        This translates to the brainfuck program:



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


        Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        (submission pending change from code-golf to the shortest output)



        664613997892457936451903530140172168 bytes



        The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



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


        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        With an input of 118.






        share|improve this answer











        $endgroup$



        8437495638205698686671 bytes



        This translates to the brainfuck program:



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


        Which prints exactly $231584178474632390847141970017375815706539969331281128078915168015826259279614$ SOH bytes.



        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        (submission pending change from code-golf to the shortest output)



        664613997892457936451903530140172168 bytes



        The program is $190096884071251415869242504183037647$ bytes long, which translates to the brainfuck program:



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


        This is calculated by the function



        f(n)=2*f(n-1)+n
        
f(0)=0


        With an input of 118.







        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited 2 hours ago

























        answered 3 hours ago









        Jo KingJo King

        21.9k249113




        21.9k249113






























            draft saved

            draft discarded




















































            If this is an answer to a challenge…




            • …Be sure to follow the challenge specification. However, please refrain from exploiting obvious loopholes. Answers abusing any of the standard loopholes are considered invalid. If you think a specification is unclear or underspecified, comment on the question instead.


            • …Try to optimize your score. For instance, answers to code-golf challenges should attempt to be as short as possible. You can always include a readable version of the code in addition to the competitive one.
              Explanations of your answer make it more interesting to read and are very much encouraged.


            • …Include a short header which indicates the language(s) of your code and its score, as defined by the challenge.



            More generally…




            • …Please make sure to answer the question and provide sufficient detail.


            • …Avoid asking for help, clarification or responding to other answers (use comments instead).





            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodegolf.stackexchange.com%2fquestions%2f179325%2fmake-a-longer-lenguage-program%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            -

            Popular posts from this blog

            Reichsarbeitsdienst

            Image
            Hausflagge des RAD mit Symbol Staatssekretär Konstantin Hierl schreitet auf dem Tempelhofer Feld die Front des RAD ab. Maifeier Berlin, 1. Mai 1934 RAD beim Straßenbau, 1936 RAD-Parade: „Der große Aufmarsch der 38.000 Arbeits­dienst­männer vor dem Führer auf dem Zeppelin­feld“, „Reichs­partei­tag der Arbeit“. Männer des RAD mit ge­schulter­tem Spaten vor Hitler im Auto, 6.–13. Sep. 1937 Reichsparteitag Nürnberg, Arbeits­dienst-Zeltlager mit Arbeitsmaiden, August 1939 Paramilitärischer Aufmarsch des Ar­beits­dienstes, ca. 1940 Vormaliges RAD-Lager (4/224), Ober­mill­statt, um 1940 erbaut als Quartier für junge, zum Arbeits­dienst eingezogene Frau­en, auch Bund Deutscher Mädel (BDM), die bei den Ober­mill­stätter Bauern ein­gesetzt waren, 1950 Der Reichsarbeitsdienst ( RAD ) war eine Organisation im nationalsozialistischen Deutschen Reich. Das Gesetz für den Reichsarbeitsdienst wurde am 26. Juni 1935 erlassen. § 1 (2) lautete: „Alle jungen Deutschen beider
            Read more

            Statuo de Libereco

            Image
            Koordinatoj: 40°41′21″N 74°02′40″W   /   40.68917°N , 74.04444°U  / 40.68917; -74.04444  ( Statuo de Libereco ) Statuo de Libereco angle: Statue of Liberty statuo Statuo de Libereco de antaŭe Oficiala nomo: Liberty Enlightening the World Lando  Usono Ŝtato Novjorkio Regiono Novjorko Insulo Insulo de Libereco Situo Statuo de Libereco  - koordinatoj 40°41′21″N 74°02′40″W   /   40.68917°N , 74.04444°U  / 40.68917; -74.04444  ( Statuo de Libereco ) Alteco de statuo 46 m  - alteco kun soklo 93 m Pezo 205 000 kg (451 948 lb) Materialoj bronzo, ŝtalo Proponinto Gustave Eiffel  - skulptisto Frédéric Auguste Bartholdi  - proponinto de soklo Richard Morris Hunt  - kapo laŭ modelo de Isabella Eugenie Boyer Transdonita 4-an de julio 1886 Por publiko alirebla por publiko Horzono OT (UTC-5)  - somera tempo OT (UTC-4) Loko
            Read more

            Tanganjiko

            Image
            Lago Tanganjiko Situo centra Afriko Ĉefaj fontoj Kalambo, Lufuko, Malagarasi kaj Ruzizi Ĉefaj elfluoj Lukugo Setlejoj Bujumbura, Kalemie Datenoj Koordinatoj 6°  S , 30°  O -6.3827777777778 29.615 782 Koordinatoj: 6°  S , 30°  O DEC Supermara alteco 782 m Surfaca areo 32 893 km² f5 Maksimuma longo 673 km f6 Maksimuma larĝo 72 km f7 Akva volumeno 18.900 km³ dep1 f8 Maksimuma profundo 1470 m f10 Averaĝa profundo 570 m f11 v   •   d   •   r Mapo de la lago Tanganjiko estas lago en orienta Afriko, inter Burundo, Kongo Kinŝasa, Tanzanio kaj Zambio. Ĝi apartenas al la Granda Rifto kaj estas unu el la Afrikaj Grandaj Lagoj. Tanzanio (46%) kaj DRK (40%) havas la majoritaton de la lago. Ĝi havas longon de 673 km, areon de ĉ. 32.900 km² kaj maksimuman profundon taksatan je 1470 metroj; pro tiu ĉi granda profundo ankaŭ ĝia volumeno estas sufiĉe granda, 18.900 km³. Oni konsi
            Read more