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.
finally , i finish ;) ,, this problem is very good
8 4 7
80047003
81147113
83347333
84447443
86647663
87747773
89947993
.. i like this problem,
the first , i build prime <=100000000 ,, then
i use dfs to creat all permutation
,, then , use them to test all prime in condition n ,,
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #51: Prime digit replacements
You are viewing a single comment's thread. Return to all comments →
finally , i finish ;) ,, this problem is very good 8 4 7 80047003 81147113 83347333 84447443 86647663 87747773 89947993 .. i like this problem, the first , i build prime <=100000000 ,, then i use dfs to creat all permutation ,, then , use them to test all prime in condition n ,,