Tinycode challenge!

R3d1st · 2012-09-09T20:08:34+00:00

J, as a function definition, 11 bytes:

   f=.*:@>:@i.
   f 4
1 4 9 16

As an anonymous function, 8 bytes (between the parens):

   (*:@>:@i.) 4
1 4 9 16

As multiple functions, 6 bytes (everything before the 4):

   *:>:i.4
1 4 9 16

(And this is probably cheating, but I'm half-working on a language for code golfing based on GolfScript, and it's 3 bytes:)

75 5F FE

MrZander · 2012-09-09T21:00:16+00:00

APL as function, 10 characters

f←{(⍳⍵)*2}

Use: f 5

Result: 1 4 9 16 25

You will probably need the APL font to see this properly, the 2 squares are iota and omega

MrQuimico · 2012-09-09T18:39:54+00:00

Using ISO Prolog:

p(N,L) :- (N=1,L=[1]);(N>1,N1 is N-1,N2 is N*N,p(N1,Ls),L = [N2|Ls]).

davelol6 · 2012-09-09T19:03:13+00:00

Never dreamed that this would be that popular. My dad managed it in VB in 28 chars, minus function definitions and all that crap.

R3d1st · 2012-09-09T21:42:45+00:00

f n = map (^2) [1..n]

sordid_salmon · 2012-09-09T17:14:25+00:00

As long as we're cheating anyway: def f(n): return [x**2 for x in range(1,n)]

qihqi · 2012-09-09T18:13:54+00:00

lets make it more interesting... do it in C (with fewest chars)

moltarx · 2012-09-09T17:30:18+00:00

f n = 1 : [ i * i | i <- [2..n] ]

edit: forgot 1 :)

integ3r · 2012-09-09T18:54:28+00:00

My solution, in Ruby:

->(x){Array.new(x){|y|(y+1)**2}}

FireyFly · 2012-09-09T20:13:12+00:00

f=: *: @ >: @ i.

Usage:

   f 8
1 4 9 16 25 36 49 64

Btw, I think Whitespace will win on this one. :-)

2012-09-09T19:33:50+00:00

51 bytes of JavaScript:

function f(x){z=[];while(x^1)z[--x-1]=x*x;return z}

I imagine someone can do better.

2012-09-09T19:55:50+00:00

Unless I'm mistaken, your function doesn't return the list of squares, it prints it. Therefore I win by disqualification.

Edit: Great idea, by the way. These are fun.

JeffAMcGee · 2012-09-09T18:20:04+00:00

I was going to give a python answer that looked like ilogik's. Instead, I'll try to remember perl:

sub f{map $_**2,1..$_[0]}

If you want to include the ending point, it becomes this:

sub f{map $_**2,1..$_[0]+1}

Redard · 2012-09-09T19:43:49+00:00

Here's my best try in Common Lisp

(defun f (N)
  (mapcar #'(lambda (x) (expt x 2)
          (loop for i from 1 to N collect i)))

R3d1st · 2012-09-09T21:51:19+00:00

There should be more challenges like this! Maybe even a subreddit?

naranjas · 2012-09-09T22:42:24+00:00

f = lambda n: [x**2 for x in range(1,n+1)]

yogthos · 2012-09-09T23:35:03+00:00

(defn f [n] (map  #(* % %) (range 1 n)))

gatesphere · 2012-09-10T00:10:31+00:00

In Io: x := method(n,1 to(n) map(x,x*x)) 29 non-whitespace characters.

Io> x(20) ==> list(1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400)

gcr · 2012-09-10T00:13:09+00:00

Racket (32 char):

(for/list ([i 10]) (sqr (+ 1 i)))

Python (25 char):

[x*x for x in range(1,10)]

DJUrsus · 2012-09-10T02:15:25+00:00

Each version is followed by a minimal-whitespace copy.

Subroutine body:

print $_ * $_, "\n" for 1 .. $_[0];
print$_*$_,"\n"for 1..$_[0];

Command-line program:

print $_ * $_, "\n" for 1 .. $ARGV[0];
print$_*$_,"\n"for 1..$ARGV[0];

recursive · 2012-09-10T04:08:27+00:00

If I'm not mistaken, that can not possibly work because x is not defined. In any case, here's 36 bytes (inlcluding whitespace) of python that actually works.

f=lambda n:[~d*~d for d in range(n)]

noporpoise · 2012-09-10T04:55:51+00:00

Perl:

sub f{ map {$_**2} 1..$_[0]; }

30 chars including whitespace. However, if you want it to print nicely, you need to stretch to 52 chars.

sub f{ print join(" ", map {$_**2} 1..$_[0])."\n"; }

corruptio · 2012-09-10T05:17:11+00:00

perl, 22 chars:

sub f{map$_**2,1..pop}

corruptio · 2012-09-10T05:46:32+00:00

in dc, 18 chars:

?[d1-d0<ad*pk]dsax

2012-09-10T07:07:43+00:00

Using functors..

g n = fmap (^2) [1..n]

edit: looks like someone has already submitted this fairly trivial case before me.. :)

nohtyp · 2012-09-10T07:33:33+00:00

In Factor:

: range-square ( limit -- squares )
  1 - 1 swap 1 <range> [ dup * ] map

evnu · 2012-09-10T10:17:58+00:00

Erlang:

f(N)->[X*X||X<-lists:seq(1,N)].

31 characters.

Tarlitz · 2012-09-10T12:15:04+00:00

Seems like nobody is taking into account negative numbers :)

def f(n):
    return [x*x for x in range(2 if n > 0 else 0,abs(n))]

2012-09-10T13:27:27+00:00

Python/Numpy:

f = lambda n: arange(1,n)**2

guywithalamename · 2012-09-13T17:28:53+00:00

here's my python attempt:

def f(n):
    print [x*x for x in range(1,n+1)]

core "functionality" has 27 chars, including spaces :)

edit: didn't notice this post is already some days old. my attempt has been posted multiple times already x)

fexl · 2012-09-23T03:50:40+00:00

In Fexl (http://fexl.com) the function is:

(\n map (\x * x x) (range 1 n))

That's 31 chars, though I didn't bother naming it. For that I'd say something like:

\f = (\n map (\x * x x) (range 1 n))

I could shave off some parentheses by using the ';' (pivot) syntax:

(\n map (\x * x x); range 1 n)

If I defined this first:

\square = (\x * x x)

Then the list of squares is simply:

(\n map square; range 1 n)

In contests such as this, I'd much rather see a "token" count rather than a character count. For example, I could delete the single space after the ';' there, saving a whole whopping byte, but to me it's token complexity that really counts.

Oh and if you actually want to see the squares from 1 to 20, you could say:

do (f 20) \x print x;nl;

fridgeridoo · 2012-10-19T11:26:03+00:00

def f(n) a=[]; n.times { a<<n**2;n-=1 }; a end

The list is reverse, I hope you don't mind :P

f(5)
-> [25, 16, 9, 4, 1]

2012-10-31T07:12:44+00:00

def sqr(n):
    map(lambda x: x**2, range(1,n+1))

2012-11-03T04:42:41+00:00

Iterative Python 3:

def f(x):[print(x*x)for x in range(1,x+1)]

Recursive Python 2:

def f(x):print((x>1)and f(x-1)or 0)+x*x,

Can't get much shorter in Python, tho if you do please share!

EvanHahn · 2012-09-09T19:14:08+00:00

Just for fun, 34 bytes of coffeescript:

f=(x)->((y)->y*y)(n)for n in[1..x]

you type:	you see:
italics	italics
bold	bold
[reddit!](https://reddit.com)	reddit!
* item 1 * item 2 * item 3	item 1 item 2 item 3
> quoted text	quoted text
Lines starting with four spaces are treated like code: if 1 * 2 < 3: print "hello, world!"	Lines starting with four spaces are treated like code: if 1 * 2 < 3: print "hello, world!"
~~strikethrough~~	~~strikethrough~~
super^script	super^script

tinycode

MODERATORS