Description

This is a partial judge problem.

In this problem, you have to implement some power function in class special_power:

• special_power(int n)  default constructor
• int fpow(int x)  return xⁿ % 880301
• int fpow(int x, int m)  return xⁿ % m
• int fpow()  return 2ⁿ % 880301
• string fpow(string s)  return sⁿ
• string fpow(string s, int m)  return sⁿ % m

Note that n is a member in class special_power.

The definition of  sⁿ: 

Repeat the elements of s n times, and connect them

For example:

• abcd⁴ = aaaabbbbccccdddd
• csst³ = cccssssssttt

The definition of sⁿ % m:

Repeat the elements of s n times, and connect them.

If the lenth of sⁿ is longer than m, ignore the remaining elements.

For example:

• abcd⁴ % 10 = aaaabbbbcc
• csst³ % 4 = cccs

Input

The input has only one line, contains three integer x, n, m and one string s.

For all testcase:

• 1 <= x, m <= 10⁹
• 1 <= n <= 10⁶
• 1 <= |s| <= 1000
• (1/6) 1 <= xⁿ, 2ⁿ < m <= 880301, 1 <= |s| * n <= m
• (1/6) 1 <= xⁿ, 2ⁿ < m <= 880301
• (1/6) 1 <= |s| * n <= m

Output

The output has five lines.

The 1st line, output the result of xⁿ % 880301

The 2nd line, output the result of xⁿ % m

The 3rd line, output the result of 2ⁿ % 880301

The 4th line, output the result of sⁿ

The 5th line, output the result of sⁿ % m

Sample Input  Download

Sample Output  Download

Partial Judge Code

13172.cpp

Partial Judge Header

13172.h

Tags

Add Tag

Discuss