cube number (1) 썸네일형 리스트형 [C++] Project Euler #62 - Cubic Permutations This problem is rated at a difficulty level of 15%.Surprisingly, I solved it quite easily (using a brute-force method).The problem asks for the smallest number among five different cube numbers that are made up of the same digits.To be honest, if you were to solve this problem properly, you’d need to check that exactly five such numbers exist, but I didn’t go that far.I also excluded cases where.. 이전 1 다음
