TDPRIMES - Printing some primes
The problem statement is really simple. You are to write all primes less than 10^8
There is not input
To make the problem less output related write out only the 1st, 101st, 201st, ... 1st mod 100.
Input: Output: 2 547 1229 ... 99995257 99996931 99998953
where can i find solution to this problem
@kalai7m we had to print 1st prime then 101 th primes then 201th primes
i m getting tle even i used sieve help
use printf instead of cout and \n istead of endl , tle will get removed
my solution got tle ,even though it executed perfectly on local compiler
Use bool array in c/c++, other languages forget about it, use c++ instead, like what i did.
i am getting TLE in python,can anyone help
AC on first submit using only normal sieve!!!
can anyone help me....my code is giving output for 10^7 but it is giving segmentation fault for 10^8
|Added by:||Alfonso² Peterssen|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM32 ASM64 BF CLPS LISP sbcl LISP clisp ERL HASK ICON ICK JS-RHINO LUA NEM NICE OBJC OCAML PHP PIKE PRLG-swi SCALA SCM qobi SCM guile ST SQLITE TCL WHITESPACE|
|Resource:||Thanks to TDuke|