Hi guys! ✋

This is a greedy, math problem from CSAcademy Round #43.

You are given two integers $N,K$ and you are required to print an array of $N$ distinct integers $<10^6$ such that there are exactly $K$ pairs $(a[i], a[j])$ with their gcd as $1$.

You are given two integers $N,K$ and you are required to print an array of $N$ distinct integers $<10^6$ such that there are exactly $K$ pairs $(a[i], a[j])$ with their gcd as $1$.

Check out the following video where I've described the solution:

CSAcademy Round 43 - Coprime Pairs Tutorial (Number Theory)

Refer the Video Description to find the links to source code and problem link.

CSAcademy Round 43 - Coprime Pairs Tutorial (Number Theory)

Refer the Video Description to find the links to source code and problem link.

The family 💓 has grown to 600+ subscribers and I thank you guys for the love and support :)

If you liked my efforts, please hit the like button 👍, subscribe and share the videos among your college :D

Have a good day! 😆

If you liked my efforts, please hit the like button 👍, subscribe and share the videos among your college :D

Have a good day! 😆

This comment has been removed by the author.

ReplyDelete