I think it's only the optimal strategy if a) you have no history and b) you can't see other entries' logic. Since you have both, it becomes more of an exercise in pattern matching IMO.
I'm not saying it's a terrible challenge or anything. I just think it's not one of the more interesting ones.
@Geobits What I'm saying is, as long as no one adds a silly strategy, you can't do any pattern matching. And any attempt to do so will give you non-equal probabilities for the 5 options, which immediately makes you more beatable than a completely random submission.
So pattern matching is only worthwhile in the first place if there are enough silly entries which can be beaten by it.
IMO, many silly bots make testing your own submission take longer. I like to test on actual competition before posting most of the time, and if each trial takes hours, that really sucks.
Sometimes. Except that this one has a minimum 100ms time for each throw, assuming each bot does no work at all. That and the matches scaling with n^2 makes 50 silly ones much worse unless those 3 are taking some serious time.
Anyone here know C++? I'm trying to teach myself via project euler, but I'm stuck on problem 1 (find sum of multiples of 3 or 5 < 1000). I have two functions that should get the same result, and not only are they different, neither is correct.
#include <iostream>
int add()
{
int sum = 0;
for(int i=1; i < 1000; i++)
{
if (i % 3 == 0 || i % 5 == 0)
{
sum += i;
}
}
return sum;
}
int multiply()
{
int total = 0;
for(int i=3; i < 1000; i+=3)
{
total += i;
}
for(int i=5; i < 1000; i+=5)
{
total += i;
}
for(int i=15; i < 1000; i+=15)
{
total -= 15;
}
return total;
}
int main()
{
std::cout << add() << std::endl;
std::cout << multiply() << std::endl;
return 0;
}
