Help us understand the problem. What is going on with this article?

Project Euler 48「自身のべき乗(self powers)」

More than 1 year has passed since last update.

難易度の起伏が激しすぎやしませんか?

Problem 48 「自身のべき乗(self powers)」

次の式は, 1^1 + 2^2 + 3^3 + ... + 10^10 = 10405071317 である.
では, 1^1 + 2^2 + 3^3 + ... + 1000^1000 の最後の10桁を求めよ.

def hoge(num):
    return str(sum( n ** n for n in range(1, num+1) ))[-10:]

print(hoge(1000))
Why do not you register as a user and use Qiita more conveniently?
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away
Comments
Sign up for free and join this conversation.
If you already have a Qiita account
Why do not you register as a user and use Qiita more conveniently?
You need to log in to use this function. Qiita can be used more conveniently after logging in.
You seem to be reading articles frequently this month. Qiita can be used more conveniently after logging in.
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away