KPOWERSUM - Kth Power Summation
Leeana Learned Few New Things Few Days Ago , Like:
1) Find The Summation Of Divisors.
2) Modular Arithmetic
So Now Her Uncle Gave Her A Task.
Task Is: You Will Be Given A Number(N) And Another Number(K). Now You Have To Find Kth Power Summation Of Divisors Of N.
Summation Of All Divisors Of N Will Be Huge, So You Have To Print The Summation Module (M=1000000007).
Like: Divisors Of 6 is: ( 1 2 3 6 ) And K = 2.
so, summation is: 1^K+2^K+3^K+6^K = 1^2 + 2^2 + 3^2 + 6^2= 1+4+9+36 = 50%1000000007=50
Leeana Thinks That You Are A Great Programmer, So She Needs Your Help. Can You Help Her??? :D :D :D
Input Starts With An Integer T (≤ 500), Denoting The Number Of Test Cases. Each Case Contains An Integer N (1 ≤ N ≤ 1015) And An Integer K (1 ≤ K ≤ 105) Denoting The Power Of Divisors.
For Each Test Cases, Print The Case Number And The Kth Power Summation Of Divisors Of N Module 1000000007. After Each Case Print A New Line. See Sample Input And Output For Better Explanation.
Input: 4 6 2 6 1 6 4 6 3
Output: Case 1: 50 Case 2: 12 Case 3: 1394 Case 4: 252
#Extra_Challenge: N<=10^18, T<=1000 TL: 1s
Fix the sample output and the description. You need to print two new lines after printing the sample output. Something like printf("Case %d: %d\n\n", case_no, ans);
TEST CASE UPDATED. :(
Week dataset :|
@problem setter, Even if you set a new problem with new constraints which you have mentioned (Extra_Challenge: N<=10^18, T<=1000 TL: 1s) will not be enough, If you are still interested in setting a challenge make T <=5000 or 10000
@rayhan50001 Where is Extra_Challenge problem with new constraints?
Giving TLE , can you tell expected time complexity?
Could you check my last submission? :/ TLE with formula.
Not sure why I am getting wrong answer now. @RaYHan may I have a test case where my new code is failing.
Did you fixed the test cases for judge, not just the sample? I do not think my code was wrong.