PKU 1150 The Last Non-zero Digit

The Last Non-zero Digit

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2087		Accepted: 480

Description

In this problem you will be given two decimal integer number N, M. You will have to find the last non-zero digit of the ^NP _M.This means no of permutations of N things taking M at a time.

Input

The input contains several lines of input. Each line of the input file contains two integers N (0 <= N<= 20000000), M (0 <= M <= N).

Output

For each line of the input you should output a single digit, which is the last non-zero digit of ^NP _M. For example, if ^NP _M is 720 then the last non-zero digit is 2. So in this case your output should be 2.

Sample Input

10 10
10 5
25 6

Sample Output

8
4
2

Source

uva 10212
考虑2，5的个数，然后递归求解

1. void odd(int l,int r)
2. {
3.     int head=l,rear=r;
4.     while((head%5||!(head&0x1))&&head<=r)head++;//找到第一个5的倍数且为奇数
5.     if(head<=r)
6.     {
7.         while((rear%5||!(rear&0x1)))rear--;
8.         cnt5+=(rear-head)/10+1;//统计所有5,如奇数列中有5,7,9,11,13,15...那么(15-5)/10+1=2,2个5，之后继续递归计算5的个数
9.         odd(head/5,rear/5);
10.     }
11.     head=l+(!(l&0x1));
12.     rear=r;
13.     while((rear%10)!=(head%10))rear--;
14.     if(((rear-head)/10)&0x1)ans=(ans*9)%10;//循环群为奇数(1*3*7*9) mod 10=9;
15.     while(rear<=r)
16.     {
17.         if(rear%5)
18.             ans=(ans*(rear%10))%10;
19.         rear+=2;
20.     }
21. }
22. void split(int l,int r)
23. {
24.     if(l==r)
25.     {
26.         while(l%2==0)l/=2,cnt2++;
27.         while(l%5==0)l/=5,cnt5++;
28.         ans=(ans*(l%10))%10;
29.         return;
30.     }
31.     int head=(l+(l&0x1))>>1,rear=r>>1;
32.     cnt2+=(rear-head)+1;
33.     split(head,rear);
34.     odd(l,r);
35. }