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.
Since you have precalculated all triplets, why not also precompute for all the test cases? Create a cummulative array c with c[i] having number of triplets less than or equal to i then just print c[a[tt]] for each case which would be a O(t) operation (just for counting triplets, excluding generation of all triplets) compared to O(t^2) for counting from begining for each test case.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #87: Prime power triples
You are viewing a single comment's thread. Return to all comments →
Since you have precalculated all triplets, why not also precompute for all the test cases? Create a cummulative array
cwithc[i]having number of triplets less than or equal toithen just printc[a[tt]]for each case which would be aO(t)operation (just for counting triplets, excluding generation of all triplets) compared toO(t^2)for counting from begining for each test case.