Dado um número inteiro não negativo n, sua solução deve gerar um programa no idioma escolhido cuja saída tenha o nnúmero de bytes que o programa gerado.

Regras

• Você deve especificar o idioma e a codificação dos programas que sua solução gera e não pode escolher idiomas ou codificações diferentes para entradas diferentes da sua solução. O idioma do seu programa de saída pode ou não ser o mesmo da sua solução.
• Seu envio precisa lidar com números inteiros no intervalo do seu idioma, mas não abuse dessa regra.

Este é o código-golfe, pelo que vence o envio mais curto em bytes.

Exemplo

Suponha que nseja 4. Minha solução então gera f_8um programa que, na minha linguagem (imaginária), gera j3 1s+/2]!mz. A saída do programa possui comprimento 3 e sua saída possui comprimento 3 * 4 = 12, portanto, a solução está correta para a entrada 4.

Suponha que nseja 1 e meu programa saia ffffpfpffp(10 bytes). O programa ffffpfpffpno meu idioma escolhido teria que produzir uma saída de 10 * 1 = 10 bytes.

JavaScript (ES6), 38 bytes

n=>`(x="${n}")=>(x+1/7+1e9).repeat(x)`

Demo

let f =

n=>`(x="${n}")=>(x+1/7+1e9).repeat(x)`

function update() {
  let n = I.value,
      func = f(n),
      res = eval(func)();
  O.innerText =
    'n = ' + n + '\n\n' +
    'Function (' + func.length + ' bytes):\n' + func + '\n\n' +
    'Function output (' + res.length + ' bytes):\n' + res;
}
update()

<input type=range id=I min=0 max=100 oninput="update()">
<pre id=O>

Gelatina , 10 bytes

;“DL+8×x@⁶

Experimente online!

Para entrada 12, ele gera 12DL+8×x@⁶, que gera 120 espaços. Experimente online!

brainfuck , 348 bytes

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

Experimente online! Ou veja a versão Ungolfed (ou seja, com o que eu tinha que trabalhar)

aviso Legal

Passei mais tempo fazendo isso do que pensava ser humanamente possível. Gostaria de agradecer à minha namorada por me permitir dispensá-la para trabalhar nisso; assim como meu salvador .

Como isso funciona?

Nenhuma pista.

Como isso funciona?

Todas as saídas têm um trecho de código à direita que é o mesmo:

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

Vamos dividi-lo em três partes chamadas a,b,c

a : [->+>+>+<<<]>>>>               THE DUPLICATOR
b : -[<<+>>-------]<<+-----        THE ADJUSTER
c : [<[.-]>->[->+<<<+>>]>[-<+>]<<] THE PRINTER

A entrada ié simplesmente pregada na frente em unário:

iabc

(por exemplo, se a entrada foi 10, então i = '++++++++++')

O duplicador - divide a entrada em dois números idênticos m, n, equivalentes à entrada

O Ajustador - Ajusta de nforma que seja igual à duração do programa

A impressora - imprime m*ncaracteres ASCII

Observe que a entrada no exemplo é a newline, que como um valor ASCII de 10, portanto a entrada é 10. Se você quiser testar outros números pequenos, substitua o ,número +que desejar.

Queijo Cheddar , 10 9 bytes

(*)&" "*9

Uma poliglota protônica estranha> _ <

Haskell , 55 bytes

f n=(++)<*>show$"main=putStr$[1.."++show n++"*2]>>'#':"

Experimente online!Exemplo de uso: f 1gera o seguinte programa de 54 bytes:

main=putStr$[1..1*2]>>'#':"main=putStr$[1..1*2]>>'#':"

Experimente online! que produz a seguinte saída de 54 bytes:

#main=putStr$[1..1*2]>>'#':#main=putStr$[1..1*2]>>'#':

Python 3 -> HQ9 +, 11 bytes

'Q'.__mul__

Tinha que ser feito

Experimente online!

Java 8, 175 174 bytes

interface M{static void main(String[]a){System.out.printf("interface M{static void main(String[]a){int i=(88+%s)*%s;for(;i-->0;System.out.print(0));}}",a[0].length(),a[0]);}}

Exemplos:

n=1saídas :

interface M{static void main(String[]a){int i=(88+1)*1;for(;i-->0;System.out.print(0));}}

(comprimento = 89) que gera 89 zeros :

00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=10saídas :

interface M{static void main(String[]a){int i=(88+2)*10;for(;i-->0;System.out.print(0));}}

(comprimento = 90) que gera 900 zeros :

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=100saídas :

interface M{static void main(String[]a){int i=(88+3)*100;for(;i-->0;System.out.print(0));}}

(comprimento = 91) que gera 9100 zeros :

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Explicação:

interface M{                                // Class:
  static void main(String[]a){              //  Mandatory main method
    System.out.printf("interface M{static void main(String[]a){
                                            //   Print a new program with:
      int i=(88+%s)*%s;                     //    Integer containing (88*A)+B
      for(;i-->0;System.out.print(0));}}",  //    And print that many zeroes
        a[0].length(),                      //     Where A is the length of the number
                                            //     (0-9 = 1; 10-99 = 2; 100-999 = 3; etc.)
        a[0]);}}                            //     and B is the number itself

RProgN 2 , 7 5 bytes

«•.* 

Com um espaço à direita

Explicado

«•.* 
«    # Yield a function from the remaining string.
 •.  # Append a space and stringify, which builds the original program (Because stringifying a function removes noops, which spaces are)
   * # Repeat the implicit input times.

Experimente online!

CJam, 8 13 bytes

q_,S\" 8+*S*"

Experimente Online

O programa gerado gera espaços, então é meio difícil dizer.

Ly , 29 bytes

"\"9>("&onu")[<&s&ol>1-]<;"&o

Experimente online! (não funciona atualmente devido a um erro de pré-processamento) Tudo bem!

Python → TECO, 20 bytes

A resposta está em Python enquanto o código gerado está em TECO. O Python é uma função que retorna VV12345\VVrepetidas n vezes. Veja aqui uma explicação do TECO.

'VV12345\VV'.__mul__

PHP, 47 + 1 bytes

<?="<?=str_pad(_,",strlen($argn)+18,"*$argn);";

imprime um sublinhado seguido por espaços.
Corra como tubo com -F; execute o programa gerado com -fou -F.

Isso falharia na entrada com mais de 64 dígitos, o
que é muito maior que PHP_INT_MAX(no momento).

No entanto, falha na entrada maior que PHP_INT_MAX-18 ... ainda se qualifica?

PHP → Python 2, 40 + 1 bytes

print "A"*<?=13+strlen($argn),"*",$argn;

imprime um programa Python que imprime As repetidos . Corra como cano com -F.

Lote → Carvão, 22 bytes

Não tenho certeza de qual codificação devo usar, pois esses são bytes. Aqui estão os bytes interpretados como Windows-1252:

@set/p=Á%1ñªÉñ«Ìñ¹<nul

Os mesmos bytes do PC-850:

@set/p=┴%1±¬╔±½╠±╣<nul

Os mesmos bytes na página de código do Charcoal:

@set/p=Ａ%1θ×Ｉθ⁺Ｌθ⁹<nul

O programa Charcoal resultante tem Plus(Length(Cast(n)), 9)bytes:

Ａ       Assign
 %1      (String representation of n)
   θ      To variable q
        Implicitly print a number of `-`s equal to:
×        Product of:
 Ｉθ       Cast of q to integer
 ⁺        Sum of:
  Ｌθ       Length of q
  ⁹        Integer constant 9

Recursiva , 16 15 bytes

++"*"V*15a'"*"'

Experimente online!

Isto para entrada de n=2impressões:

*30"*"  

que gera 30 *. Experimente online!

JavaScript (ES8), 43 41 39 bytes

n=>`f=_=>"".padEnd(${n}*(88+f).length)`

Teste-o

A saída da função gerada é uma sequência de espaços que são substituídos por *s neste Snippet.

g=
n=>`f=_=>"".padEnd(${n}*(88+f).length)`

o.innerText=(h=n=>`Function: ${x=g(n)}\nLength:   ${x.length}\nOutput:   "${x=eval(x)().replace(/./g,"*")}"\nLength:   `+x.length)(i.value=10);oninput=_=>o.innerText=h(+i.value)

<input id=i type=number><pre id=o>

R , 46 bytes

function(n)sprintf("cat(rep('a',%d*23),'')",n)

Experimente online!

Função anônima que retorna a string

cat(rep('a',n*23),'')

Que imprime a( aseguido de um espaço) 23 nvezes. Eu precisava do ''porque, caso contrário cat, não imprimiria o último caractere de espaço.

C, 94 bytes

main(int c,char**a){if(c>1){c=atoi(a[1]);if(c>0&&c<0xFFFFFF){c*=94;while(c--)printf("r");}}}

isso seria 94 bytes, incluindo o último \ n que o padrão C diz que deve ser gravado. retornar como caracteres 'r' como o (comprimento do programa) * (argumento do programa) se o argumento do programa não existir ou for <= 0 ou for> 0xFFFFF

C:\>nameProg.exe 1
rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr

MATLAB (63 bytes)

a=@(n)['repmat(''a'',1,',num2str(n*(15+numel(num2str(n)))),')']

Por exemplo:

>> a(5)

ans =

repmat('a',1,80)

e:

>> repmat('a',1,80)

ans =

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa