poj 1150 The Last Non-zero Digit_in this problem you will be given two decimal inte-CSDN博客

本文链接：https://blog.csdn.net/wwwzys/article/details/6716471

The Last Non-zero Digit

Time Limit: 1000MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

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

[Submit] [Go Back] [Status]

POJ 1150 ——The Last Non-zero Digit(数论)

题意很简单，要求你求出一个排列数P(n,m)中最后一个非0的数字.
由于n的数值巨大，想直接求出来恐怕是不可行的。
在网上有这样一个英文的解题报告，但是有个你人翻译了并且解释了

http://www.cppblog.com/abilitytao/archive/2009/10/31/99907.html

#include<iostream>

#include<cstring>

#include<cmath>

using namespace std;



int get2(int n){//计算n!中质因子2的出现次数

    if(n==0)return 0;

    return n/2+get2(n/2);}



int get5(int n){

    if(n==0)return 0;

    return n/5+get5(n/5);}//计算n!中质因子5的出现次数



int g(int n,int x){//计算f(1) to f(n) 中，奇数数列中末尾为x的数出现的次数

    if(n==0)return 0;

    return n/10+(n%10>=x)+g(n/5,x);}



int getx(int n,int x){//计算f(1) to f(n)中，末尾为x的数的出现次数

    if(n==0)return 0;

    return getx(n/2,x)+g(n,x);}

int table[4][4] =

{

        6,2,4,8,//2^n%10的循环节，注意如果2的个数为0时候，结果应该是1，要特殊处理。

        1,3,9,7,//3

        1,7,9,3,//7

        1,9,1,9,//9

};//3，7，9的循环节中第一位，刚好是1，故不需要考虑这些数字出现次数为0的情况。



int get_res(int n,int m){//用来计算nPm的最后一位非0数

int num2;int num3;int num5;int num7;int num9;

        num2=get2(n)-get2(n-m);

        num5=get5(n)-get5(n-m);

        num3=getx(n,3)-getx(n-m,3);

        num7=getx(n,7)-getx(n-m,7);

        num9=getx(n,9)-getx(n-m,9);

        int res=1;

        if(num5>num2)return 5;

        else

        {

            if(num2!=num5)

            {

                res*=table[0][(num2-num5)%4];

                res%=10;

            }//如果num2==num5,那么2^0次方mod 10应该为1 ，而不是table中的6,所以要特殊处理。



            res*=table[1][num3%4];

            res%=10;

            res*=table[2][num7%4];

            res%=10;

            res*=table[3][num9%4];

            res%=10;

        }

        return res;

}

int main()

{



    int n,m;

    while(scanf("%d%d",&n,&m)!=EOF)

    {

         printf("%d\n",get_res(n,m));

    }

    return 0;

}