All challenges
Easy 0 solved 0% acceptance

Self Powers Tail

Find the last k digits of 1^1 + 2^2 + ... + n^n.

What you'll learn

  • Reduce sums and products modulo 10^k
  • Compute powers with repeated squaring
  • Format a number with leading zeros

Problem

The sum 1^1 + 2^2 + 3^3 + ... + n^n has thousands of digits even for modest n, but only its tail is needed. Find its last k digits. Work modulo 10^k from the start: reduce after every multiplication and every addition, and the numbers stay small.

Implement self_powers_tail(n, k).

Input

n: The last term of the sum.

k: How many trailing digits to return.

Output

Return the last k digits as a string of exactly k characters, padded with leading zeros if needed.

Constraints

1 ≤ n ≤ 5000; 1 ≤ k ≤ 9

Examples

Example 1
Input:
n = 4
k = 3

Expected output:
expected = "288"
Input:
long long n = 4;
long long k = 3;

Expected output:
std::string expected = "288";
Input:
long n = 4;
long k = 3;

Expected output:
string expected = "288";

Explanation

1 + 4 + 27 + 256 = 288, so the last three digits are "288".

Example 2
Input:
n = 3
k = 4

Expected output:
expected = "0032"
Input:
long long n = 3;
long long k = 4;

Expected output:
std::string expected = "0032";
Input:
long n = 3;
long k = 4;

Expected output:
string expected = "0032";

Explanation

1 + 4 + 27 = 32, padded to four digits: "0032".

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Only the last k digits matter, so reduce modulo 10^k after every step.

Hint 2

i^i can be found by repeated squaring, or by multiplying i times with reduction.

Hint 3

Pad the final value on the left with zeros to get exactly k characters.

Expected complexity

O(n log n) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.