Search:

Interesting... Let's give this some thought!
Any opinions on the event? Who of you will participate?

I might participate in an AI contest, but probably not if it's about card games (don't know much of them, don't like them). Sorry!

What did I do wrong :S?

You set the rules, participants should obey them imo. If breaking the rules goes unpunished, it's not very fair to the other contestants... Furthermore, as a contest host...

Hmm, I see the point. Whoops!

[troll-mode]



howMany2(0) == 1?
[/troll-mode]

:)
I could have guessed you would participate here.

The hard problems weren't so hard imho - harder to understand than to write down in code. I had most fun with the medium problem since it required solving some subproblems along the way.

I hope...

Close... 5! = 120.

I think the challenges were a little too easy. But I enjoyed them nonetheless! Mathematical problems / shortcuts are fun, keep 'em coming.

A totally different kind of contest is "code brevity". I...

Are you sure about that? I know about two-step recurrence, but the method I used is nothing like that. But maybe you got something entirely different...

Just submitted all 4.

Better create a general numeric-to-string conversion template, then catenate the strings with standard operator+.

I don't think so. You mean Darryl's examples, right?

# + # + #
# # # # #
gives a 1 bottom left, after which we have 1/3 and 1/6 guessing options.

+ + # # #
# # # # #
gives me
? ? 1 0 0

If argc == 1, the test on the second loop will generate a segfault. a && b works as follows: first a is tested, if it is true b will be evaluated. Remedy: put argc check in front.
Third loop ... :S?...

It might be easier for our contest host Shakti to leave in the probabilistic element, which just belongs to the game. But at least try to minimalize its effect by letting the players solvers run on...

The way I see it, GetPosition() tells the player where the mines are - that's no fun! Please define "selected" and "iteration".

Obviously, you will generate a field and have us solve it. To get a...

Yeah, but I find myself revising them over and over again. So to save you some copy-paste-work, you'll recieve all four of them just before the deadline.

I think chess will be too complex, at least I won't have enough time to participate.
Something like the "Connect 4" contest from a while ago would be really fun... If only I had noticed that...

By sending a PM to PYJelton. See http://cboard.cprogramming.com/showthread.php?t=62539 for details.

This may sound obvious or dumb, but I believe we should be clear about it.

How about precomputing values? Like


int howMany2(int k)
{
static int precomputed[26] = {<insert correct values...

Me too, now working on "medium".
I think the "easy" problem will be the hardest for me. It requires reading and understanding 'n' stuff ;).

[edit]
Question on "medium": may I assume that no...

Try recursion. Something like this:


#include <stdio.h>

char alfabet[] = "abcdefghijklmnopqrstuvwxyz";
static char buf[27];

void func(int n)
{

Are you sure it's an infinite loop? Then check if your submatrix is really decreasing in size. Take a 3-3 test matrix and print lot's of stuff to see if it works ok.

For larger matrices, your...

I can't make much of your code... it seems to be incomplete and is poorly indented.
Only problem I can think of is 'tempi': perhaps you meant 'tempi1' and 'tempi2'?

:)
Asagohan, now you help us out here!

Asagohan might want to find the largest element between two variable bounds (that's how I interpret his question). So linear search would mean doing the same thing over and over again, if the search...