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
hide comments
Aditya Kumar:
2015-07-02 05:22:17
Runtime on Ideone.... but, AC in spoj |
|
[Mayank Pratap]:
2015-06-20 10:32:44
Optimised sieve AC in one go.... : |
|
krish:
2015-04-18 15:49:21
optimised seive:) |
|
himanshujaju:
2015-02-17 14:18:16
sieve of eratosthenes gives AC in 0.93s (with printf) Last edit: 2015-02-17 14:18:38 |
|
Madhav:
2015-02-11 13:44:59
good question!!
|
|
Dhawal Harkawat:
2014-12-17 06:51:56
sieve -> AC in 9.36,, Phew! |
|
Pawankumar P:
2014-12-09 18:36:08
@ALL people who solved it in under 4 seconds. How?! A hint at least!
|
|
Infinity:
2014-11-02 12:20:16
We can easily bring this under 1 sec, just lil coding needed.i wish the timelimit was under 2 seconds. Would have been much more fun.lazy i m . |
|
arun vinud:
2014-09-01 21:09:37
optimized sieve+putchar_unlocked()->AC :) |
|
[Lakshman]:
2014-06-28 09:41:06
@surayans tiwari IDEONE is using **CUBE** cluster and here SPOJ is using Pyramid cluster...CUBE id 20X faster than Pyramid.
|
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 |