ACM 11069 - A Graph Problem

#include <stdio.h>
#define MAXLEN 77
int subSet[MAXLEN];
int main()
{
    int i, n;
    subSet[0] = 1, subSet[1] = 2, subSet[2] = 2;
    for (i = 3; i < MAXLEN; i ++)
        subSet[i] = subSet[i - 2] + subSet[i - 3];
    while (1) 
    {
        if (scanf("%d", &n) < 1) break;
        printf("%d\n", subSet[n - 1]);  
    }    
    return 0;
}

回目錄
回首頁