「学习笔记」4.7代码学习

继续python ACM

1021Fibonacci Again

#encoding:utf8
#1021 Fibonacci Again

def Fib(n):
    if n==:
        return 
    elif n==:
        return 
    else:
        return Fib(n-)+Fib(n-)

while True:
    n=int(raw_input())
    m=Fib(n)
    if m%==:
        print 'Yes'
    else:
        print 'No'
           

1005 Number Sequence

1005.py输出与昨天的2035.py出现一样的问题，后续一并解决

#encoding:utf8
#1005 Number Sequence

def f(A,B,n):
    def func(n):
        if n==:
            return 
        elif n==:
            return 
        else:
            return (A*func(n-)+B*func(n-))%
    return func(n)


l=raw_input().split(' ')
s=[]
while l!=['0','0','0']:
    s.append(l)
    l=raw_input().split(' ')
    for i in s:
        i=map(int,i)
        print f(i[],i[],i[])

# print f(1,1,3)
# print f(1,2,10)
           

1002A+B Problem II

#encoding:utf8
#1002 A+B Problem II
#最后一个结束不应该还有空格，还没想通该怎么写

n=int(raw_input())
l=[]
for i in range(n):
    l.append(raw_input().split(' '))
    l[i]=map(int,l[i])

for i in range(n):
    print 'Case',i
    print l[i][] ,'+',l[i][],'=',sum(l[i])
    print ''
           

1003Max Sum

1002.py和1003.py最后一个输出后不应该还有空格，还不知道怎么解决

#encoding:utf8
#1003 Max Sum

t=int(raw_input())
s=[]
lst=[]
for i in range(t):
    s.append(raw_input().split(' '))
    s[i]=map(int,s[i])
# print s
for l in s:
    maxnum=l[]
    for i in range(,len(l)):
        for j in range(,len(l)):
            # m=sum(l[i:j+1])
            #print m
            if maxnum<=sum(l[i:j+]) and i!=j:
                maxnum=sum(l[i:j+])
                x=i
                y=j
    print 'Case',i
    print maxnum,x,y
    print ''