wikioi天梯之1011 数的计算之递推

简单的递推

题目

#include <iostream>

using namespace std;

int getNum(int n)
{
    if(n == 1)return 1;
    int count = 1;
    for(int i = 1;i <= n/2;i++)count += getNum(i);
    return count;
}

int main()
{
    int n,count;
    cin>>n;
    count = getNum(n);
    cout<<count;
    return 0;
}

还可以写的在简洁些。。

#include <iostream>

using namespace std;

int count = 0;
 void getNum(int n)
{
    count++;
    for(int i = 1;i <= n/2;i++)getNum(i);
}


int main()
{
    int n;
    cin>>n;
    getNum(n);
    cout<<count;
    return 0;
}