快速幂和模除

最新推荐文章于 2024-10-06 20:11:18 发布

炸娃（java）

最新推荐文章于 2024-10-06 20:11:18 发布

阅读量83

点赞数

分类专栏：数据结构 java 文章标签：数据结构

本文链接：https://blog.csdn.net/zyf7764029/article/details/123655266

版权

数据结构同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

java

9 篇文章 0 订阅

订阅专栏

递归快速幂
思想很简单， $a^9=a*a^8,a^8=a^4*a^4$

public static int fastPower1(int a, int b){
        if(b == 0)
            return 1;
        if(b%2 == 1)
            return a*fastPower1(a,b - 1);
        else{
            int temp = fastPower1(a,b/2);
            return temp*temp;
        }
    }

非递归快速幂
$a^{15_{(10)}}=a^{1111_{(2)}}=a^{1000_{(2)}}*a^{100_{(2)}}*a^{10_{(2)}}*a^{1_{(2)}}$ 并且 $a^{1000_{(2)}}=a^{100_{(2)}}*a^{100_{(2)}}$

 public static int fastPower2(int a, int b){
        int ans = a; int result = 1;
        while(b > 0){
            if((b&1) == 1){
                result = result*ans;
            }
            ans = ans*ans;
            b = b>>1;
        }
        return result;
    }

递归快速幂模除
$(a*b)\%c=((a\%c)*(b\%c))\%c$

 public static int fastPowerMod1(int a, int b, int mod){
        if(b == 0)
            return 1;
        if(b%2 == 1)
        	//加或者乘的时候需要防溢出
            return (int)(((long)(a*fastPower1(a,b - 1)))%mod);
        else{
            int temp = fastPower1(a,b/2)%mod;
            return (int) (((long)temp*temp)%mod);
        }
    }

非递归快速幂模除

public static int fastPowerMod2(int a, int b, int mod){
        int ans = a; int result = 1;
        while(b > 0){
            if((b&1) == 1){
                result = (int)(((long)(result*ans))%mod);
            }
            ans = (int)((long)(ans*ans))%mod;
            b = b>>1;
        }
        return result;
    }

矩阵快速幂

public static int[][] fastMatrixPowerMod(int[][] a, int b, int mod){
        int[][] result = {{1,0},{0,1}}; int[][] ans = a;
        while(b > 0){
            if((b&1) > 0)
                result = matrixPowerMod(result,ans,mod);
            ans = matrixPowerMod(ans, ans, mod);
            b = b>>1;
        }
        return result;
    }

    public static int[][] matrixPowerMod(int[][] a, int[][] b, int mod){
        int rows, columns;
        rows = a.length; columns=a[0].length;
        int[][] c = new int[rows][columns];
        for(int i = 0; i < rows; i++)
            for(int j = 0; j < columns; j++)
                for(int k = 0; k < columns; k++)
                    c[i][j] = (int)(((long)c[i][j] + (long)a[i][k]*b[k][j])%mod);
        return c;