Problem Link: http://www.spoj.com/problems/PRIME1/
![[m,n]](https://lh3.googleusercontent.com/blogger_img_proxy/AEn0k_tPDxryoIiRGuv09P7s_fQMER9V2PuhyblXfmJhjWZ1S-rbJaBW_QQoG0_c7o82rZAt01sSsKcuHr5OIvKGLrHdGOBGvC5bR1gXhZJQ36HMgI0Ry7gJOmDls1KxPdzqZz58cIvoM_AjMCUwFS6N6tc1CllUM9s=s0-d)
where 
and 
, find all prime numbers in that interval.
Logic:
No composite number less than or equal to
will have a factor greater than 
, so we only need to know all primes up to this limit, which is no greater than 31622 (square root of 109).
To view my solution:
https://github.com/shivam04/spoj/blob/master/PRIME1.cpp
SUMMARY
Given an interval where and , find all prime numbers in that interval.Logic:
No composite number less than or equal to
will have a factor greater than , so we only need to know all primes up to this limit, which is no greater than 31622 (square root of 109).To view my solution:
https://github.com/shivam04/spoj/blob/master/PRIME1.cpp
No comments:
Post a Comment