SPOJ.com - Problem TDPRIMES

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

Submit solution!

hide comments

< Previous 2 3 4 5 6 7 8 9 10 11 12 Next >

	Pawankumar P: 2014-12-09 18:36:08 @ALL people who solved it in under 4 seconds. How?! A hint at least! My implementation of sieve (using only 1 or 5 mod 6 numbers) as a bool array takes 9.xx seconds and bitwise sieve of integers takes 7.xx seconds. How to optimize further? Update: 6.62 s after using Atkin. :/ Last edit: 2014-12-09 20:08:13
	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. http://www.spoj.com/clusters
	surayans tiwari(http://bit.ly/1EPzcpv): 2014-06-28 08:19:59 running in 1.7 seconds on ideone and tle here please check my code
	Prakhar Gupta: 2014-06-19 20:08:53 what is SIGKILL??
	Gaurav Kumar Verma: 2014-06-09 13:03:14 c++ AC, java TLE. :( can anyone help?
	Gaurav Kumar Verma: 2014-06-06 21:36:02 201st, ... 1st mod 100. what does mod 100 means? --ans(Francky)--> Modulo operations. When the remainder, when dividing by 100, is equal to 1. As of 101, 201, 301, ... 5401, ... but not 511, ... Last edit: 2014-06-06 21:48:52
	.:: Jarv1s ::.: 2014-02-15 22:25:06 Cracked It After many attempts. Java giving TLE for same code, accepted in C++ 8.36 seconds. P III computers used by SPOJ are really great at determining run time differences, Hurraaayyyy. Really needs extreme optimization to crack this one (0-0)
	Nitish bhagat: 2014-01-02 15:16:14 Finally Ac after months

Submit solution!

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 clisp LISP sbcl 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