2
97
6
999983
TC 1:
l=10^(2-1)=10
r=10^2-1=99
After checking in the sieve[] in decreasing order,the first time comes out to be 97
,where limit is the size of the sieve[].This is the most optimal way to find out the required solution.NthDigitMaxPrime
Directory actions
More options
Directory actions
More options
NthDigitMaxPrime
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||