big interger (1) 썸네일형 리스트형 [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.. 이전 1 다음
