Factorial factorization (i)

Describe

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

The factorial of N (0<=n<=10000) is decomposed factorization to find out how many m.

 

Input

The

first line is an integer s (0<s<=100) that represents the number of groups of test data
the following S-line, each line has two integer n,m.

Output

the number of output m.

Sample input

2100 516 2

Sample output

2415

1 ImportJava.util.Scanner;2 3  Public classMain {4      Public Static voidMain (string[] args) {5Scanner scanner=NewScanner (system.in);6         intT;7         inti;8         intJ;9         intN;Ten         intm; One         inttemp; A         intcount; -          -t=scanner.nextint (); the          for(i=0;i<t;i++){ -n=scanner.nextint (); -m=scanner.nextint (); -Count=0; +              -              for(j=1;j<=n;j++){ +temp=J; A                  while(true){ at                     if(temp%m==0){ -count++; -Temp/=m; -                     } -                     Else -                          Break; in                 } -             } to System.out.println (count); +         } -     }     the}

Factorial factorization (i)