Exchanging coins

#1


doesn’t gives correct output

#2

hello @ajayrajsingh_817
wait i m checking

#3

u havent intialised ur dp with -1.
pls initialise it.

#4


still not getting correct output

#5

check this->https://ide.codingblocks.com/s/277685

first intialsie ur dp array and then after call ur function.

#6

but the constraints of n is very large how to handle such large constraints with dp array

#7

run time error occurs

#8

it not possible.
use map .in place of dp array.

#9

run time error in this code

#10

,… … … …

#11

how sir ???/
plz make changes in the code n comment down ur logic

#12

logic will remain same,
just change long long dp[n];
with
map<long long,long long> dp;

and replace if(dp[n]!=-1) with if(dp.count(n)!=0)

rest evrthing is same

#13

plzz explain the logic behind it in large n

#14

did nt get ur question.
i havent changed the logic.
have just replaced array with map.
thats it.

#15

that the my question why it not working with dp array in case of dp array it shows run time error and in map it works

#16

value of n can be upto 10^9.

and we cannot declare array of size 10^9 becuase it will take too much memory.

map will not take much memory because it creates key at run time .
so it will consume only required amount of space (numbe of distinct dp state).