Search found 1 match

by AbiusX
Sat Aug 18, 2007 8:39 pm
Forum: Volume 109 (10900-10999)
Topic: 10948 - The primary problem
Replies: 27
Views: 18203

:( WA

the same code i used for 543 (Goldbach) dunno watz wrong getting a WA ;) #include<iostream> using namespace std; #define RANGE 1000010 #define sqrtRANGE 1010 int isprime[RANGE]; int prime[RANGE/10]; int primecount; inline void primesieve() { unsigned int i,j; for (i=0;i<RANGE;++i) isprime[i]=i&1; is...

Go to advanced search