OJ Board

I think your code is very big one. And you are generated all primes.
Check the way that i generate the prime factor of 24

24 / 2 = 12
12 / 2 = 6
6 / 2 = 3
3 / 3 = 1
so the prime factors are 24 = 2 * 2 * 2 * 3.

Ha Ha easy way isn't it.

As further i know 0^0 is undefined. But i think you should try to use the modulus as 0. try it . the explanation is:

0^0 is undefined cause we could not decide(0/0 means 0^1-1) on the ? area.

0 | 0 | ?
0
------------
0

I think same thing happens to others cases of undefined and infinite. So, i ...

Sorry brother me also getting tl.
but my algorithm is not so big as yours.

check this out man:

(m*m*m)mod p=(m mod p * m mod p)mod p

ha ha ha

hi there i am a new poster . i think you can see it in left side

i have change the sieve a little.
it generates 1 - 200000000 primes in just 7 seconds.

wanna know ?

sent mail to me /

i will sent the algroithm .

sorry not the code

Jalal bhai apna to er ekta stupid

Bhagsash upopado bhola gaachan

Moni, use this method

3 | 111 | 37
9
-----------------
21
21
--------------------
0


lala la la la