2007-02-12

You can't take a step without SQL

Cool problem at Project Euler - Find the sum of the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal, hexagonal, heptagonal, and octagonal, is represented by a different number in the set.

I just felt that it is ideal for sql ... I used my brains and as a result I've got a small table and a small, absolutely dumb query.

I'd like to have a-la «implementation schedule» support in languages not relating to db.

No comments:

Post a Comment