DCEPC12G - G Force
Prime(n) is defined as number of primes less than equal to n.
Totient(n) is defined as the number of positive integers less than or equal to n that are relatively prime to n.
F(n) = Prime(n) – Totient(n)
and we don’t like negative values, so if F(n) < 0, consider it as 0.
G(n) = Totient(n) ^ (Factorial (F(n)))
You are given a number n. You have to output G(n) % 10^9+7.
First line consists of T, the number of test cases.
Each of the next T lines contains one integer n.
Output T lines each line containing the value of function G(n) % 10^9+7
2 Output: 1
N vs n ; fixed.
This is a good number theory implementation easy problem :) !Last edit: 2016-06-28 10:06:24
@sarvesh_19: can you please delete your comment. Please admin delete the below comment. Thanks
I know nothing:
thanks Lakshman for ur comment i got my silly mistake
@I know nothing your output for 1,2,30 is correct after that all are incorrect(IDEONE output).
Is n the same as N?
very good question dce coders....