All Tracks Problem

Ashish's Job-A
/
No tags
Problem
Editorial
Analytics

Ashish is a hard working boy. He gets paid daily according to the function

F(n) = (n^k) * (p^n);

where "n" is the day starting from the first day. "k" and "p" are constant values provided.

He is saving money to buy a Gaming mouse . Find the maximum price of mouse he can afford after "n" days.

NOTE : Input will be a space separated sequence of k, n, p.

Input : 10 10 100

and answer is to be given in form of : totalcost % 1000000007

NOTE : You do not need to create a program for this problem you have to write your answers of given input in given code snippet

  • To see how to submit solution please check this link
SAMPLE INPUT
2 5 2
SAMPLE OUTPUT
1146
Explanation

enter image description here

Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB

Best Submission

Similar Problems

Contributors

This Problem was Asked in

Initializing Code Editor...
Notifications
View All Notifications

?