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.
As per Algo description, n=1260 than we will have 113 distinct solution, what are those value of solution and what are x and y value which cover 113 possiblity. need small example if possible
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #110: Diophantine reciprocals II
You are viewing a single comment's thread. Return to all comments →
As per Algo description, n=1260 than we will have 113 distinct solution, what are those value of solution and what are x and y value which cover 113 possiblity. need small example if possible