Dato un numero intero non negativo n, la soluzione deve generare un programma nella lingua prescelta il cui output ha un nnumero di byte pari a quello del programma di output .

Regole

• È necessario specificare la lingua e la codifica dei programmi emessi dalla soluzione e non è possibile scegliere lingue o codifiche diverse per input diversi per la propria soluzione. La lingua del tuo programma di output può essere o meno la stessa della tua soluzione.
• La tua richiesta deve solo gestire numeri interi nella tua lingua, ma ti preghiamo di non abusare di questa regola.

Questo è code-golf quindi vince l'invio più breve in byte.

Esempio

Supponiamo che nsia 4. La mia soluzione quindi genera f_8, un programma che, nel mio linguaggio (immaginario), genera j3 1s+/2]!mz. L'output del programma ha lunghezza 3 e l'output ha lunghezza 3 * 4 = 12, quindi la soluzione è corretta per l'ingresso 4.

Supponiamo invece che nsia 1 e il mio programma produca ffffpfpffp(10 byte). Il programma ffffpfpffpnella mia lingua scelta dovrebbe produrre un output di 10 * 1 = 10 byte.

JavaScript (ES6), 38 byte

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

dimostrazione

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 byte

;“DL+8×x@⁶

Provalo online!

Per l'ingresso 12, viene emesso 12DL+8×x@⁶, che genera 120 spazi. Provalo online!

Brainfuck , 348 byte

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

Provalo online! Oppure guarda la versione Ungolfed (ovvero con cosa ho dovuto lavorare)

disconoscimento

Ho trascorso più tempo a realizzare ciò di quanto pensassi umanamente possibile. Vorrei ringraziare la mia ragazza per avermi permesso di abbandonarla per lavorare su questo; così come mio salvatore .

Come funziona?

Nessun indizio.

Come funziona

Tutti gli output hanno uno snippet di codice finale che sono tutti uguali:

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

Dividiamolo in tre parti chiamate a,b,c

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

L'input iè semplicemente impresso sul fronte in modo unario:

iabc

(es. se l'ingresso era 10, allora i = '++++++++++')

Il duplicatore : divide l'input in due numeri identicim, n , equivalenti all'input

L'Aggiustatore : regolan tale che sia uguale alla lunghezza del programma

La stampante : stampa m*ncaratteri ASCII

Si noti che l'ingresso nell'esempio è a newline, che come valore ASCII di 10, quindi l'ingresso è 10. Se vuoi testare altri piccoli numeri, sostituiscili ,con quelli +che desideri.

Cheddar , 10 9 byte

(*)&" "*9

Un imbarazzante poliglotta Proton> _ <

Haskell , 55 byte

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

Provalo online! Esempio di utilizzo: f 1produce il seguente programma da 54 byte:

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

Provalo online! che produce il seguente output a 54 byte:

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

Python 3 -> HQ9 +, 11 byte

'Q'.__mul__

Doveva essere fatto

Provalo online!

Java 8, 175 174 byte

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]);}}

Esempi:

n=1uscite :

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

(lunghezza = 89) che genera 89 zero :

00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=10uscite :

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

(lunghezza = 90) che genera 900 zero :

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=100uscite :

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

(lunghezza = 91) che genera 9100 zero :

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Spiegazione:

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 byte

«•.* 

Con uno spazio finale

spiegato

«•.* 
«    # 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.

Provalo online!

CJam, 8 13 byte

q_,S\" 8+*S*"

Provalo online

Il programma generato genera spazi quindi è difficile da dire.

Ly , 29 byte

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

Provalo online! (al momento non funziona a causa di un bug di pre-elaborazione) Tutto bene!

Python → TECO, 20 byte

La risposta è in Python mentre il codice generato è in TECO. Python è una funzione che restituisce VV12345\VVripetute n volte. Vedi qui per una spiegazione del TECO.

'VV12345\VV'.__mul__

PHP, 47 + 1 byte

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

stampa un carattere di sottolineatura seguito da spazi.
Esegui come pipe con -F; eseguire il programma in uscita con -fo-F .

Ciò non riuscirebbe per l'input con più di 64 cifre,
che è molto più alto diPHP_INT_MAX (in questo momento).

Tuttavia, non riesce per input superiori a PHP_INT_MAX-18 ... si qualifica ancora?

PHP → Python 2, 40 + 1 byte

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

stampa un programma Python che stampa ripetute As. Esegui come pipe con -F.

Lotto → Carbone, 22 byte

Non sono sicuro di quale codifica dovrei usare, dato che si tratta di byte. Ecco i byte interpretati come Windows-1252:

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

Gli stessi byte del PC-850:

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

Gli stessi byte nella tabella codici di Charcoal:

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

Il programma di carbone risultante è Plus(Length(Cast(n)), 9)lungo byte:

Ａ       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 byte

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

Provalo online!

Questo per l'immissione di n=2stampe:

*30"*"  

che genera 30 *. Provalo online!

JavaScript (ES8), 43 41 39 byte

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

Provalo

L'output della funzione generata è una stringa di spazi che vengono sostituiti con *s in questo frammento.

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 byte

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

Provalo online!

Funzione anonima che restituisce la stringa

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

Quale stampa a( aseguito da uno spazio) 23 volte nvolte. Avevo bisogno del ''perché altrimenti catnon avrei stampato l'ultimo carattere spaziale.

C, 94 byte

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

questo sarebbe 94 byte includendo l'ultimo \ n che stadard C dice che dovrebbe essere scritto. restituisce i caratteri 'r' come (lunghezza del programma) * (argomento del programma) se l'argomento del programma non esiste o è <= 0 o è> 0xFFFFF non stampa alcun esempio

C:\>nameProg.exe 1
rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr

MATLAB (63 byte)

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

Per esempio:

>> a(5)

ans =

repmat('a',1,80)

e:

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

ans =

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa