TDPRIMES - Printing some primes


The problem statement is really simple. You are to write all primes less than 10^8

Input

There is not 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
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

Mostafa 36a2: 2013-12-26 16:27:03

This was in my TODO since 2012-07-05 ..
finally AC :D

P_Quantum: 2013-09-17 07:39:34

Finally AC..!!

shinchan: 2013-08-26 15:49:42

3.8 sec in my compiler but tle:(

Last edit: 2013-09-07 01:41:49
Akhilesh Anandh: 2013-08-25 16:20:11

Passed in 9.32.. whew :)


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 qobi SCM guile ST SQLITE TCL WHITESPACE
Resource:Thanks to TDuke