We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.

# Project Euler #134: Prime pair connection

# Project Euler #134: Prime pair connection

Contest ends in

#### Sort by

recency

#### |

#### 10 Discussions

#### |

Please Login in order to post a comment

isnt this a faulty question? i mean if we see for l=19 and R=23 there exist 69 which is divisible by 23 and last digit is form by 19. then why we are taking 1219 as our answer?

for L,R in higher range i.e. 10^6 - 10^9 the final answer overflows long int range in cpp hence can only be represented as strings.

I still got TLE :,v

Can someone tell me what is wrong with this code...? thanks in advance

Can some one tell me what kind of test case 10 onwards is?. Till 9th test I am getting correct answer but from 10 to 18 all are showing wrong answer.

Thanks