Factorial Factorization (1)

Factorial Factorization (1)

Description

Given two numbers m, n, where M is a prime number.

Returns the factorial of N (0 <= n <= 10000) to calculate the number of M.

Input

The first row is an integer S (0 <S <= 100), indicating the next s row of the test data group. Each row has two integers n, m.

Output

Number of output M.

Sample Input

2100 516 2

Sample output

2415

# Include <iostream> using namespace STD; int main () {int N; int M1, M2; int sum, I = 0; CIN> N; while (n --) {CIN> m1> m2; sum = 0; do {I = m1/m2; sum + = I; M1 = I;} while (M1> = m2 ); cout <sum <Endl;} return 0 ;}

 

Factorial Factorization (1)