This is not for my age ^^ 2 hard for me xDD
[Challenge] Programming Contest #2
Your answer was incorrect
Go fix et. Also, I said "Optional kicker, no string manip", it IS optional, but cooler
.
@freedompeace, thanks for the solution, you never actually output the number of primes though haha
OH YEAH CLARIFICATION, THE COUNT IS THE NUMBER OF CIRCULAR PRIMES, INCLUDING EVERY NUMBER IN THE CIRCLE.
Go fix et. Also, I said "Optional kicker, no string manip", it IS optional, but cooler
.@freedompeace, thanks for the solution, you never actually output the number of primes though haha
OH YEAH CLARIFICATION, THE COUNT IS THE NUMBER OF CIRCULAR PRIMES, INCLUDING EVERY NUMBER IN THE CIRCLE.
Master's was incorrect, not yours
, that's why I quoted him and then said it, then directed a specific line at you.
To anyone that has any confusion, please refer to Euler
Problem 35 - Project Euler
I probably should have made it to 1000000 like theirs, didn't really thing about the combinations that ended over 500k (as freedom gave in his example). This was my bad guys.
, that's why I quoted him and then said it, then directed a specific line at you.To anyone that has any confusion, please refer to Euler
Problem 35 - Project Euler
I probably should have made it to 1000000 like theirs, didn't really thing about the combinations that ended over 500k (as freedom gave in his example). This was my bad guys.
So we need to include every number in the circle.
For instance:
If we had 1193 we would need to include 1931, 9311, and 3119 in our list?
Also should we provide our own timers in the code. or will timing be done by a separate program?
For instance:
If we had 1193 we would need to include 1931, 9311, and 3119 in our list?
Also should we provide our own timers in the code. or will timing be done by a separate program?
Im in algebra 2 and never heard of this /fp Again
Time for another fail ettemp on learn on wikipedia again
Time for another fail ettemp on learn on wikipedia again

mine is running at 578 ms, trying to work on a diff solution, but if nothing, oh well.
got it down to 432, App Counts how many primes there are, Then How many are circular primes, the lists the primes.
got it down to 432, App Counts how many primes there are, Then How many are circular primes, the lists the primes.
Y'all noobs don't stand a chance against my godlike code ;P I WIN AGAIN =D
25 ms =D /brag & /ridicule
That and VB is sloooooow ;D
edit: forgot to say I also wrote a solution on my calculator during maths class, it completes it in 18 seconds xD
25 ms =D /brag & /ridicule
That and VB is sloooooow ;D
edit: forgot to say I also wrote a solution on my calculator during maths class, it completes it in 18 seconds xD
I agree, My logic is perfect, the issue is currently VB + Single core , Processor both play a huge part , I'm trying a few scripts (python and ruby) to see if I can get this a little faster.

Oh and nice solution HD, seems very complicated since it doesn't use any string functions. 
