Posts by frogboy77

I won't deny i feel i really should be outraged, but i just can't really summon up the disgust.

:-/
yeah, still not really bothered.

Thoughts Of The Day

I'm still waiting for one(never mind plural).

i like you, i hope things work out for you.:)

and i think you're too young too consider this "the one".
just my opinion as i've started to get old.

Your name seems familiar, are you a Euler regular?

I'm good thanks. How are you?

No, just tired of life. Ready for infinite happiness.

perhaps not so good.

@ziggystarman

Having just reread your comments on my code snippet i have a question:

is this your own work?

thanks, i will have a play about with it:)

I was referring to your code and not the algorithm itself.

@The Bowie fan

I tried recently to write a miller-rabin function and failed:(

How reliable do you think this code is (i.e have you tested it?) given the simple omission already noted?

Ok think of it like this;

if you tried to divide by 2 and it didn't work then anything over n/2 can't be a factor.

if you tried to divide by 3 and it didn't work then anything over n/3 can't be a factor.

if you tried to divide by 5(no point in 4 as 2 didn't work) and it didn't work then anything over n/5 can't be a factor.

etc.. etc..

until you come to the square root.

in order to find out whether a numbr is prime r nt we only need to divide it till half of its value...and if it doesnt get divided by any of the numbers in the first half then it wont be divided by any number in the 2nd half fr sure....

No square root will suffice.

P.S please use code tags.

Where is rand seeded?

very cool

Dev-C++ is updated frequently and includes all of the library's you will probably ever use (using the new standards)

http://en.wikipedia.org/wiki/Dev-C%2B%2B

Result = SumY - SumX;

Would it not be
Result=SumY-SumX+x;?

It appears to be the case of
those who can, do, those who can't, teach.

No, just tired of life. Ready for infinite happiness.

I hope you find it.

can you elaborate?
sorry, would you elaborate?

are you Mayan?

still waiting for a clarification on this

You can also remove a<4 because you already have a<9.

Why?

well how else you going test it?

square root is far enough

why go as far as i_Val/2?

ok find all the primes from 10000000-20000000 with each one and time it.

maybe just me being a noob but that looks like shit!

so you're returning a char value from an int function with a bool value?

still pretty new at this but i don't get this

char bPrime;
    bPrime = true;

yes but 2 would be evaluated before that

i'm guessing if he can't use arrays then vectors are off the table.

no reply?

i realise there is no error checking for a<1 but as the title says "simple"

no then line 5 would return false if a=2

ok but i find following one statement after another easier than trying to evaluate 3 or 4 in one go. thanks for comments and i will keep them in mind.

really! you find that easier to read?

would that be better?

you need to mark it solved

bool is_prime(int a)
{
     if(a==1){return false;}
     if(a<4){return true;}
     if(a%2==0){return false;}
     if(a<9){return true;}
     if(a%3==0){return false;}
     int i;
     for(i=5;(i*i)<=a;i+=6)
     {
                           if(a%i==0){return false;}
                           if(a%(i+2)==0){return false;}
     }
     return true;
}

critique welcome.

I would suggest posting less code and a specific question about what you are looking for.

Does your compiler not have a problem with line 16(i.e declaring a variable twice)?

meant to add

a=b;

a=4596;
b=(((a/100)%10)+((a/1000)*10)+((a%10)*100)+(((a/10)%10)*1000));

may work but arrays or strings would be easier.

If you want any help (and you do from the above poster) then an amount of effort shown really is required.

i believe this line

while (pick != 'r' || pick != 'g' || pick != 'b');

should be

while (pick != 'r' && pick != 'g' && pick != 'b');

then i think what you have is good.

If room 5 doesn't exist the home may smell rather "funky".

Lighting would be the least of your problems.

would this do it?

if(iWhole/10000==iWhole%10&&(iWhole/1000)%10==(iWhole/10)%10){is_pal=true;}
else{is_pal=false;}

http://http://www.cprogramming.com/begin.html

So nobody knows ???

"Nobody knows" what you are asking.

Try to do it with pen and paper, then write some code for the process you used using arrays.