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.
i think there are same difficult point in this problem
1) how to exclude the duplicate value
2) how to get the corrent arrangement of full n capacitors
3) how to speed up(cut some useless branch)
i have fixed the 1 and 2, but 3 is still a difficult Challenge
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #155: Counting Capacitor Circuits.
You are viewing a single comment's thread. Return to all comments →
i think there are same difficult point in this problem 1) how to exclude the duplicate value 2) how to get the corrent arrangement of full n capacitors 3) how to speed up(cut some useless branch)
i have fixed the 1 and 2, but 3 is still a difficult Challenge