Dought regarding problem solving

#1

Can you explain why code is running on last testcase??

#2

hello @anand_54
didnt get ur doubt?
pls explain

#3
#4

this is the code 1 test case can’t passed . Can you explain how i resolved it?

#5

can you tell why one testcase getting failled with this code

#6

is ur doubt is in segmented sieve i.e deepak and primes ii ?

asking becuase the code that u shared is of deepak n primes ii

#7

image
image795×156 3.87 KB

here add st<primes.size()

#8

i also have dought in that problem

#9

check my last response

#10

in problem linear congruence also i don’t pass 1 test case/

#11
#12

https://ide.codingblocks.com/s/413599 please check this code also

#13

wait for sometime, i will check n let u know

#14

the method u are using to find inverse is not correct, it works only for prime cases, in question it is mentioned that given number are coprime n not prime.
use other method for finding inverse

#15

which method i should use to find the inverse of number . IF number is not prime? please help

#16

use extended euclid algorithm

#17

refer this->

#18

Thank you sir , i got it

#19

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.