Étant donné un entier non négatif n, votre solution doit générer un programme dans la langue de votre choix, dont la sortie a des nfois autant d'octets que le programme généré.

Règles

• Vous devez spécifier la langue et l'encodage des programmes générés par votre solution, et vous ne pouvez pas choisir des langues ou des encodages différents pour les différentes entrées de votre solution. La langue de votre programme de sortie peut être identique ou non à la langue de votre solution.
• Votre soumission doit uniquement gérer des entiers dans la plage de votre langue, mais veuillez ne pas abuser de cette règle.

Il s'agit de code-golf, donc la soumission la plus courte en octets l'emporte.

Exemple

Supposons que n4. Ma solution génère alors f_8un programme qui, dans mon langage (imaginaire), produit j3 1s+/2]!mz. La sortie du programme a une longueur 3 et sa sortie a une longueur 3 * 4 = 12, donc la solution est correcte pour l'entrée 4.

Supposons plutôt que ce nsoit 1 et mes sorties de programme ffffpfpffp(10 octets). Le programme ffffpfpffpdans ma langue choisie devrait produire une sortie de 10 * 1 = 10 octets.

JavaScript (ES6), 38 octets

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

Démo

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>

Gelée , 10 octets

;“DL+8×x@⁶

Essayez-le en ligne!

Pour l'entrée 12, il sort 12DL+8×x@⁶, qui sort 120 espaces. Essayez-le en ligne!

brainfuck , 348 octets

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

Essayez-le en ligne! Ou voir la version Ungolfed (c'est-à-dire avec quoi je devais travailler)

Avertissement

J'ai passé plus de temps à faire cela que je ne le pensais humainement possible. Je voudrais remercier ma copine de m'avoir permis de l'abandonner pour travailler là-dessus; ainsi que mon sauveur .

Comment ça marche même?

Aucune idée.

Comment ça marche?

Toutes les sorties ont un extrait de code de fin qui sont tous les mêmes:

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

Divisons-le en trois parties appelées a,b,c

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

L'entrée iest simplement collée sur le devant en unaire:

iabc

(par exemple; si l'entrée était 10, alors i = '++++++++++')

Duplicateur - Divise l'entrée en deux nombres identiques m, n, équivalents à l'entrée

L'ajusteur - Ajuste de ntelle sorte qu'il soit égal à la durée du programme

L'imprimante - Imprime m*nles caractères ASCII

Notez que l'entrée dans l'exemple est un newline, qui en tant que valeur ASCII de 10, l'entrée est donc 10. Si vous souhaitez tester d 'autres petits nombres, remplacez le ,par autant de numéros que +vous désirez.

Cheddar , 10 9 octets

(*)&" "*9

Un polyglotte Proton maladroit> _ <

Haskell , 55 octets

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

Essayez-le en ligne! Exemple d'utilisation: f 1donne le programme de 54 octets suivant:

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

Essayez-le en ligne! qui produit la sortie de 54 octets suivante:

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

Python 3 -> HQ9 +, 11 octets

'Q'.__mul__

Il devait être fait

Essayez-le en ligne!

Java 8, 175 174 octets

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

Exemples:

n=1sorties :

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

(longueur = 89) qui génère 89 zéros :

00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=10sorties :

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

(longueur = 90) qui génère 900 zéros :

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=100sorties :

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

(longueur = 91) qui génère 9100 zéros :

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Explication:

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 octets

«•.* 

Avec un espace de fuite

Expliqué

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

Essayez-le en ligne!

CJam, 8 13 octets

q_,S\" 8+*S*"

Essayez-le en ligne

Le programme généré génère des espaces, donc c'est un peu difficile à dire.

Ly , 29 octets

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

Essayez-le en ligne! (ne fonctionne pas actuellement en raison d'un bogue de prétraitement) Tout va bien!

Python → TECO, 20 octets

La réponse est en Python tandis que le code généré est en TECO. Le Python est une fonction renvoyant n fois VV12345\VVrépétées . Voir ici pour une explication du TECO.

'VV12345\VV'.__mul__

PHP, 47 + 1 octets

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

imprime un trait de soulignement suivi d'espaces.
Exécuter en tant que tuyau avec -F; exécuter le programme en sortie avec -fou -F.

Cela échouerait pour une entrée de plus de 64 chiffres,
ce qui est beaucoup plus élevé que PHP_INT_MAX(pour le moment).

Cependant, il échoue pour une entrée supérieure à PHP_INT_MAX-18 ... est-il toujours admissible?

PHP → Python 2, 40 + 1 octets

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

imprime un programme Python qui imprime des As répétés . Exécuter en tant que tuyau avec -F.

Lot → Charbon de bois, 22 octets

Je ne sais pas quel encodage je devrais utiliser, car ce sont des octets. Voici les octets interprétés comme Windows-1252:

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

Les mêmes octets que le PC-850:

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

Les mêmes octets dans la page de codes de Charcoal:

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

The resulting Charcoal program is Plus(Length(Cast(n)), 9) bytes long:

Ａ       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'"*"'

Try it online!

This for input of n=2 prints:

*30"*"  

which outputs 30 *. Try it online!

JavaScript (ES8), 43 41 39 bytes

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

Test it

The output of the generated function is a string of spaces which are replaced with *s in this 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)

Try it online!

Anonymous function that returns the string

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

Which prints a (that's a followed by a space) 23 times n times. I needed the '' because otherwise cat wouldn't print the last space character.

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

this would be 94 bytes include the last \n that stadard C says it should be written. return as 'r' characters as the (lenght of the program) * (argument of the program) if the program argument not exist or it is <=0 or it is >0xFFFFF print nothing example

C:\>nameProg.exe 1
rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr

MATLAB (63 bytes)

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

For example:

>> a(5)

ans =

repmat('a',1,80)

and:

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

ans =

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa