| Submit | All submissions | Best solutions | Back to list |
TDPRIMES - Printing some primes |
The problem statement is really simple. You are to write all primes less than 10^8
Input
There is no input.
Output
To make the problem less output related write out only the 1st, 101st, 201st, ... 1st mod 100.
Example
Input: Output: 2 547 1229 ... 99995257 99996931 99998953
| Added by: | Alfonso² Peterssen |
| Date: | 2010-04-06 |
| Time limit: | 1.325s |
| Source limit: | 10000B |
| Memory limit: | 1536MB |
| 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 guile SCM qobi ST SQLITE TCL WHITESPACE |
| Resource: | Thanks to TDuke |
hide comments
|
||||||||||||||
|
2021-08-02 20:46:29
Simple Sieve will do the job , no optimization required . Last edit: 2021-08-02 21:40:33 |
||||||||||||||
|
2021-07-28 03:14:27
1.13 seconds in JAVA using BitSet & sieve of eratosthenes |
||||||||||||||
|
2021-07-17 17:18:35
Simple sieve worked for me |
||||||||||||||
|
2021-06-09 12:05:10
Just use simple sieve , declare a global array of size 10^8 and it goes AC !! |
||||||||||||||
|
2021-05-24 18:58:28
used vector instead of array, replace cout with printf and endl with \n, TLE will be removed. |
||||||||||||||
|
2021-04-30 18:18:27
Solved using a bitwise sieve. |
||||||||||||||
|
2021-04-14 18:04:40
@ramsaicrony i am also getting the same issue can you help me out |
||||||||||||||
|
2021-04-07 13:18:42
well well |
||||||||||||||
|
2021-03-29 13:36:09
It might give tle in your compliler but will work here |
||||||||||||||
|
2021-02-24 11:42:11
where can i find solution to this problem |
||||||||||||||
RSS