Programming (96) 썸네일형 리스트형 [C/C++] Project Euler #50 - Consecutive Prime Sum This problem itself is not particularly difficult. On the Project Euler website, its difficulty rating is listed as 5%.Personally, I did not find the problem conceptually hard. However, trying to optimize the speed required a lot of careful thought.The goal of the problem is to find the prime number within a given range that can be expressed as the sum of the most consecutive primes, where the s.. [C/C++] BOJ #1037 - Divisors BOJ #1037 is a problem related to divisors and number properties. The problem provides a list of divisors of a certain positive integer N, except for 1 and N itself. The task is to determine the actual value of N using only the given divisors. The key observation is that the smallest and largest divisors in the given list, when multiplied together, yield N. This is because if all the divisors ar.. [C/C++] Project Euler #49 - Prime Permutations Project Euler #49 Prime Permutations problem may seem complex, but the actual solving process is straightforward. The difficulty level is 5%, classified as “very easy.”Three four-digit numbers are prime numbers that are permutations of each other.For example, the numbers 1487, 4817, and 8147 consist of the same four digits (1, 4, 7, 8) arranged in different orders, and each of them is a prime nu.. [C/C++] Project Euler #48 - Self Powers This problem is also an easy one.The content is quite short. The difficulty level is 5%.Project Euler problem #48, “Self Powers”, requires calculating the last 10 digits of the sum of each natural number from 1 to n raised to the power of itself. In other words, we need to compute the following sum:\[1^1 + 2^2 + 3^3 + \dots + n^n\]Since the result of this sum can be extremely large, the key as.. [C/C++] Project Euler #47 - Distinct Primes Factors The Project Euler #47 problem can be solved without much difficulty as long as prime factorization is performed correctly. The difficulty level of this problem is 5%.Project Euler #47 is a problem that involves finding consecutive natural numbers with distinct prime factors. The key aspect of this problem is that four consecutive natural numbers must each have exactly four distinct prime factor.. [C/C++] BOJ #1036 - Base 36 The problem “Baekjoon #1036 - Base 36” requires converting and maximizing a numerical value in base 36.In base 36, the digits range from 0-9 and A-Z, where ‘A’ represents 10, ‘B’ represents 11, …, and ‘Z’ represents 35. The input consists of several numbers written in base 36, and the task is to maximize the sum of these numbers by replacing at most one character (‘0’-‘Z’) with ‘Z’ (35) in all o.. [C/C++] Project Euler #46 - Goldbach's Other Conjecture This problem only shares a similar form with Goldbach’s famous conjecture but is fundamentally different.Goldbach’s conjecture defied the expectations of many mathematicians at the time and remains unproven to this day. (Much like the case of odd perfect numbers, which were also expected to be easily proven but still lack a proof.)The difficulty level of this problem is 5%, making it relatively .. [C/C++] Project Euler #45 - Triangular, Pentagonal, and Hexagonal Project Euler problem #45 explores the relationships among specific numerical sequences. This problem involves the concepts of triangular numbers, pentagonal numbers, and hexagonal numbers. A triangular number is defined as the sum of natural numbers and can be expressed using the formula \(T_n = \frac{n(n+1)}{2}\) . A pentagonal number follows a specific pattern of growth among polygonal number.. [C/C++] BOJ #1032 - Command Prompt When working with files on a computer, wildcards (?) are often used to identify common patterns or to handle multiple files efficiently. In this problem, you need to determine a common pattern among multiple file names.You will be given N file names as input, and all file names have the same length. For each position in the file names, if all characters at that position are identical, you should.. [C/C++] Project Euler #44 - Pentagon Numbers This problem requires us to generate a special type of number called pentagonal numbers.A pentagonal number represents the number of points arranged in the shape of a pentagon.For convenience, a diagram illustrating this can be included as follows. The formula for generating pentagonal numbers is given in the problem as follows:\[P_n = \frac{n(3n-1)}{2}\]Since pentagonal numbers increase monoto.. 이전 1 2 3 4 5 6 ··· 10 다음
