python 笔记

来源:互联网 发布:有道云笔记 ubuntu版 编辑:程序博客网 时间:2024/06/15 18:49

杭电acm 1005 python 实现:

A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

递归是最简单的解决方法;

def numberswquene(a,b,n):    if(n==2 or n==1):        return 1;    else:        return (a*numberswquene(a,b,n-1)+b*numberswquene(a,b,n-2))%7; var = numberswquene(1,2,10);print var;



0 0
原创粉丝点击