Negatif olmayan bir tam sayı verildiğinde n, çözümünüz çıktısı seçilen dilde bir program çıkarmalıdır.n süresi kadar bayt .

kurallar

• Çözümünüzün çıkardığı programların dilini ve kodlamasını belirtmelisiniz ve çözümünüze farklı girdiler için farklı diller veya kodlamalar seçemezsiniz. Çıktı programınızın dili, çözümünüzün dili ile aynı olabilir veya olmayabilir.
• Gönderiminizin yalnızca dilinizdeki tamsayıları işlemesi gerekir, ancak lütfen bu kuralı kötüye kullanmayın.

Bu kod golf yani bayt kısa teslim kazanır.

Misal

Farzedelim ki n4. Benim çözümüm çıktı f_8(benim hayali) dilimde çıktı veren bir program j3 1s+/2]!mz. Program çıkışı 3 uzunluğuna ve çıkışı 3 * 4 = 12 uzunluğuna sahiptir, bu nedenle çözüm giriş 4 için doğrudur.

Bunun yerine n1 olduğunu ve program çıktılarım olduğunu ffffpfpffp(10 bayt) varsayalım . ffffpfpffpSeçtiğim dilde programın 10 * 1 = 10 baytlık bir çıktı üretmesi gerekiyordu.

JavaScript (ES6), 38 bayt

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

gösteri

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>

Jöle , 10 bayt

;“DL+8×x@⁶

Çevrimiçi deneyin!

Girdi için 12, 12DL+8×x@⁶120 boşluk çıktısı verir. Çevrimiçi deneyin!

brainfuck , 348 bayt

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

Çevrimiçi deneyin! Veya Ungolfed versiyonuna bakın (yani çalışmak zorunda olduğum şey)

feragat

Bunu insanca mümkün olduğunu düşündüğümden daha fazla zaman harcadım. Kız arkadaşımın onun üzerinde çalışmasına izin vermeme izin verdiği için teşekkür etmek istiyorum; sıra sıra benim kurtarıcı .

Nasıl çalışır?

İpucu yok.

Nasıl çalışır?

Tüm çıkışlar, hepsi aynı olan bir kod snippet'ine sahiptir:

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

Hadi üç bölüme ayıralım a,b,c

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

Giriş ibasitçe öne doğru tutturulur:

iabc

(örneğin; giriş 10 ise, o zaman i = '++++++++++')

Teksir - Girişi, girişe m, neşdeğer iki aynı numaraya böler

Ayarlayıcı - nProgramın uzunluğuna eşit olacak şekilde ayarlar

Yazıcı - m*nASCII karakterlerini yazdırır

Örnekteki girişin newlineASCII değeri 10 olan a olduğundan , girişin olduğuna dikkat edin 10. Eğer diğer küçük sayılar test etmek isterseniz, yerini ,ancak birçok +s' arzu.

Çedar , 10 9 bayt

(*)&" "*9

Garip bir Proton çok dilli> _ <

Haskell , 55 bayt

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

Çevrimiçi deneyin! Örnek kullanım: f 1aşağıdaki 54 bayt programını verir:

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

Çevrimiçi deneyin! Aşağıdaki 54 bayt çıktıyı üretir:

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

Python 3 -> HQ9 +, 11 bayt

'Q'.__mul__

Yapılması gerekiyordu

Çevrimiçi deneyin!

Java 8, 175 174 bayt

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

Örnekler:

n=1çıktılar :

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

(uzunluk = 89) 89 sıfır çıktı :

00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=10çıktılar :

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

(uzunluk = 90) 900 sıfır üretir :

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

n=100çıktılar :

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

(uzunluk = 91) 9100 sıfır çıktı :

0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Açıklama:

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 bayt

«•.* 

Sonunda boşluk var

Açıklaması

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

Çevrimiçi deneyin!

CJam, 8 13 bayt

q_,S\" 8+*S*"

Çevrimiçi Deneyin

Oluşturulan program boşluklar verir, bu yüzden söylemesi zor.

Ly , 29 bayt

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

Çevrimiçi deneyin! (şu anda bir ön işleme hatası nedeniyle çalışmıyor) Hepsi iyi!

Python → TECO, 20 bayt

Üretilen kod TECO'dayken cevap Python'da. Python, n kez VV12345\VVtekrarlanan bir işlevdir . TECO'nun açıklaması için buraya bakınız .

'VV12345\VV'.__mul__

PHP, 47 + 1 bayt

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

bir alt çizgi ve ardından boşluklar yazdırır.
Boru olarak çalıştırın -F; Çıktı programını -fveya ile çalıştırın -F.

Bu, (şu anda)
çok daha yüksek olan 64'ten fazla basamağa sahip girdi için başarısız olur PHP_INT_MAX.

Ancak, PHP_INT_MAX-18'den daha büyük girdiler için başarısız oluyor ... yine de uygun mu?

PHP → Python 2, 40 + 1 bayt

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

tekrar eden bir Python programı yazdırır A. İle boru olarak çalıştırın -F.

Seri → Kömür, 22 bayt

Hangi kodlamayı kullanmam gerektiğinden emin değilim, çünkü bunlar bayt. Windows-1252 olarak yorumlanan baytlar:

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

PC-850 ile aynı bayt:

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

Kömürün kod sayfasındaki aynı baytlar:

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

Ortaya çıkan Kömür programı Plus(Length(Cast(n)), 9)bayt uzunluğundadır:

Ａ       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

Özyinelemeli , 16 15 bayt

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

Çevrimiçi deneyin!

n=2Baskı girişi için :

*30"*"  

çıktı 30 *. Çevrimiçi deneyin!

JavaScript (ES8), 43 41 39 bayt

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

Dene

Oluşturulan işlevin çıktısı, *bu Snippet'te s ile değiştirilen bir boşluk dizesidir .

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 bayt

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

Çevrimiçi deneyin!

Dizeyi döndüren anonim işlev

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

Hangi baskılar a( abunu bir boşluk izler) 23 nkez. İhtiyacım vardı, ''çünkü aksi takdirde catson boşluk karakterini basmazdı.

C, 94 bayt

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

bu 94 bayt olur, standart C'nin yazılması gerektiğini söyleyen son \ n içerir. Program argümanı yoksa veya <= 0 ise veya> 0xFFFFF hiçbir şey yazdırmazsa, 'program' uzunluğu (programın uzunluğu) * (programın argümanı) olarak 'r' karakterleri olarak döner

C:\>nameProg.exe 1
rrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr

MATLAB (63 bayt)

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

Örneğin:

>> a(5)

ans =

repmat('a',1,80)

ve:

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

ans =

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa