给出求 x^n mod m;其中n,x,m都为正整数的递归算法。解:
Procedure modfactorial(n,m:正整数)
if n=1 then modfactorial(n,m)∶=1
else modfactorial(n,m)∶=(n *modfactorial (n-1,m))mod m
给出求 x^n mod m;其中n,x,m都为正整数的递归算法。解:
Procedure modfactorial(n,m:正整数)
if n=1 then modfactorial(n,m)∶=1
else modfactorial(n,m)∶=(n *modfactorial (n-1,m))mod m
Copyright © 2020 www.daanwo.com All Rights Reserved |