Any interest in a brevity contest.

[Darryl]

I have a nice simple one, will probably easily be under 100 tokens. If at least 4 people say they will definitely do it, i will post.

Please note, I am counting literal strings differently than in the past.
Strings will be counted at the rate of 1 token per 256 chars per string or to put it in formula, (string_length / 257)+1

[schloob]

i don't think i have any chance at coming close to any of the other people here but i wouldn't mind trying. i love these things.

[Emery]

I'll compete. And ditto what schloob said about being utterly inferior and so forth...

[Zen]

Ok, count me in.

[Darryl]

That's 3, just need 1 more. As far as coming close ... the people that did the best haven't been around in a while, Togra, Beerhunter, Corsix, and Gamma. The only other regulars in the brevity was me and Alvaro which Alvaro is pretty good and as for me, I am just persistent. I typically start with some huge program and then just keep at it until I get it low.

[exomo]

I'm in.

I should spend my time on learning, but there's allways some time for programming

[Alvaro]

Thanks for the kind words, Darryl, but I am afraid I am out of shape. I'll give it a try anyway. I remember these things were a lot of fun.

[Zen]

So... bring it on

[Darryl]

I had one, but then I got to thinking about it and while I can only solve it by brute force...the problem is very mathematical in nature (and easy) and I suspect someone like Alvaro could solve it with a one-liner so I've been trying to think of another. While I am thinking I'll let you know what I was gonna do though....

Given a grid, like a chessboard, you have 64 - 1x1 square, 1 - 8x8 square and a number of squares of various dimensions in between. Placing a pawn on an arbitrary position on the board, calculate the number squares that contain it.

Now if Alvaro tells me this can only be done by brute force, then we can continue with it as the contest, otherwise I am thinking of another.

If we continue on with this problem, I will pass the position of the pawn on the command line, a number from 0 (lower left) to 63 (upper right), going from left to right then up

[Alvaro]

I don't know what you mean by "brute force". I got a 96-token solution without too much effort. I think this will be fun.

[Emery]

I guess we're all competing for second place, knowing that Alvaro will be in first. =)

[GiovaMaster]

--------------------------- Alvaro is my Idol -----------------------------

[Darryl]

I don't know what you mean by "brute force". I got a 96-token solution without too much effort. I think this will be fun.

Some solution that requires a certain amount of iteration and counting of boxes, versus just an equation that solves it outright...

I was also trying to avoid a recursive solutions like Fibonacci numbers or Factorials, which although iterative, still has a kind of simple equation feel to them.

[Alvaro]

I don't know what you mean by "brute force". I got a 96-token solution without too much effort. I think this will be fun.

Some solution that requires a certain amount of iteration and counting of boxes, versus just an equation that solves it outright...

I was also trying to avoid a recursive solutions like Fibonacci numbers or Factorials, which although iterative, still has a kind of simple equation feel to them.

I don't think this will have a closed formula. At least not one simple enough to turn it into a short program.

[Darryl]

Ok just to make sure everyone knows the rules and contest description:

Given a grid, like a chessboard, you have 64 - 1x1 square, 1 - 8x8 square and a number of squares of various dimensions in between. Placing a pawn on an arbitrary position on the board, calculate the number squares that contain it.

The 1x1 square containing the pawn will be passed in on the command line, a number from 0 (lower left) to 63 (upper right), going from left to right then up. ie. the bottom row = 0 to 7 going left to right

I will use Visual Studio 2005 to compile, if I get questionable errors, I will try it on Dev C++ (mingw) and if it still doesn't compile will be disqualified. If you know that your program is compiler dependent, let me know ahead of time.

If it produces the wrong answer it will be disqualified.

I will be using the ever popular tokenx to count tokens. (However I will have to manually adjust for strings)

I personally don't like the <header> vs "header" trick so go ahead and use it, everyone

strings > 256 char will count as size/256 tokens

comments don't cost anything. Hint, hint

you may only submit 1 file

you can send it to my gmail.com address with the user name of darryl.123