半数集.cpp

王晓东算法设计与分析源码。vc下编译通过能够运行。且运行效率较高

#include <stdio.h>
int a[1000],aj;
void get(int n)
{
    int i,j,k;
    for(i=aj+1; i <= n; i++)
    {
        k = i/2;
        for(a[i]=j=1; j <= k; j++)
        a[i] = a[i] + a[j];
    }
    aj = n;
}
int main()
{
    int n;
    aj = a[0] = a[1] = 1;
    while(scanf("%d",&n)!=EOF){
    if(n > aj)
    get(n);
    printf("%d\n",a[n]);
    }
    return 0;
}