递归 1005

#include<iostream>#include<cstdio>int a,b;int f[100000001];using namespace std;int tg(int64_t i){   f[1]=1;f[2]=1;    f[i]=2*tg(i-1);    cout<<f[i]<<endl;     错误是因为数组自动默认为0所以达不到递归的效果   f[i-1]=tg(i-1);    return 0;}int main(){    int64_t n;    scanf("%I64d",&n);    tg(n);    return 0;}

int recursive(int i){int sum = 0;if (0 == i)return (1);      return可以达到递归效果elsesum = i * recursive(i-1);   return sum;}

int function(int a, int b, int n){if (n==1)return 1;else if(n==2)return 1;elsereturn (a*function(a, b, n-1)+b*function(a, b, n-2))%7;用函数值代替数组值f[n];}