斐波那契图形

interesting~~

#include <stdio.h>int F(int n){    int s;    if(n==0||n==1)        s=n;    else        s=F(n-2)+F(n-1);    return s;}int main(){    int n;    while(scanf("%d",&n)!=EOF){        int i,j;        for(i=0;i<n;i++)                for(j=0;j<2*i+1;j++){                    if(j==2*i)                        printf("%d\n",F(j));                    else                        printf("%d ",F(j));                }    }    return 0;}