Programming/Project Euler (68) 썸네일형 리스트형 [C/C++] Project Euler #63 - Powerful digit counts This is a problem involving powers, but unexpectedly, it’s quite easy. The difficulty level is only 5%. The problem is: How many n-digit numbers are also nth powers of some number?For example, \(16807 = 7^5\), and 16807 is a 5-digit number, which is exactly the 5th power of 7. Even a brute-force solution works just fine for this problem. First, only numbers less than 10 are worth considering as .. [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.. [C/C++] Project Euler #61 - Cyclical Figurate Numbers This problem follows directly from problem 60 and is labeled as having a 20% difficulty level, but in my case, I didn’t find it particularly hard to solve.To tackle problems involving n-gonal numbers, it’s generally effective to focus on correctly checking whether a number satisfies the condition of being an n-gonal number. That approach should be sufficient without much difficulty.In this probl.. [C/C++] Project Euler #60 - Prime Pair Sets This is the first time I’m tackling a problem with a difficulty level of 20%.Although it’s called a prime pair, there isn’t really any deep mathematical concept involved.For example, if we take the two prime numbers 3 and 7, and simply concatenate them to form 37 and 73, and if both of these numbers are also prime, then (3, 7) is considered a prime pair.Such prime pairs exist infinitely, but the.. [C/C++] Project Euler #59 - XOR Decryption This problem is rated at a 5% difficulty level, but if solved in a standard way, I believe it would be more difficult than that.The method of decrypting this kind of cipher often involves brute-force repeated substitution. While simple repeated substitution can crack the cipher, it often takes thousands or even tens of thousands of years, even with the help of tens of thousands of computers. Thi.. [C++] Project Euler #58 - Spiral Primes #58 is a problem with a difficulty level of 5%.Although the problem may appear complex at first glance, it’s actually not difficult to solve at all.The key idea is that when you arrange numbers in a spiral starting from 1, the numbers that appear on the diagonals are always odd. In that case, the important part for solving this problem is to find the ratio of primes among the odd numbers located.. [C++/Python] Project Euler #57 - Square Root Convergents This problem may appear to be a math problem, but it’s actually just a simple calculation problem.It’s rated as a 5% difficulty problem on the Project Euler site.The content of the problem is that when calculating the square root of 2, it can be expressed as a continued fraction. For more about continued fractions, refer to Pell’s equation.We can express the square root of 2 in such a way using .. [C++/Python] Project Euler #56 - Powerful Digit Sum This problem is categorized as a 5% difficulty level problem, but users of programming languages without a built-in BigInt module may face the challenge of having to implement or acquire such a module. If you use a language like Python, Java, or C#, which already includes a BigInt module, the problem can be solved quite easily. The problem itself is simple:Given values of a and b less than 100, .. [C++/Python] Project Euler #55 - Lychrel Numbers This problem is also a difficulty level 5% problem.A Lychrel number is a positive integer that, when expressed in base 10 and added to its reverse, does not form a palindrome. If the result is not a palindrome, the process is repeated by reversing the number and adding again.Theoretically, since the numbers increase gradually, it is assumed that eventually a palindrome (a number that reads the s.. [C/C++] Project Euler #54 - Poker Hands I didn’t find this problem particularly difficult, but it certainly is quite tedious.On the Project Euler site, it is rated as a 10% difficulty problem.I’ve never made a poker-style game before, but determining who wins according to poker rules is the most important part of a poker game. Everything else is just the interface.This problem is quite long.Ultimately, the main point is to determine h.. 이전 1 2 3 4 ··· 7 다음
