#include <stdio.h>
//フィボナッチ数列
int rec(int n){
if(n == 1){
return 1;
}
else if(n == 2){
return 1;
}
else{
return rec(n-1)+rec(n-2);
}
}
int main(void) {
int n = 10;
for(int i = 1; i<= n; i++){
printf("フィボナッチ数列の第%d項は%d\n", i
, rec
(i
)); }
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+Ci8v44OV44Kj44Oc44OK44OD44OB5pWw5YiXCmludCByZWMoaW50IG4pewoJaWYobiA9PSAxKXsKCQlyZXR1cm4gMTsKCX0KIGVsc2UgaWYobiA9PSAyKXsKIAlyZXR1cm4gMTsKIH0KIGVsc2V7CiAJCXJldHVybiByZWMobi0xKStyZWMobi0yKTsgCiB9Cn0KCmludCBtYWluKHZvaWQpIHsKICAgIGludCBuID0gMTA7CiAgICBmb3IoaW50IGkgPSAxOyBpPD0gbjsgaSsrKXsKICAgICAgICBwcmludGYoIuODleOCo+ODnOODiuODg+ODgeaVsOWIl+OBruesrCVk6aCF44GvJWRcbiIsIGksIHJlYyhpKSk7CiAgICB9CglyZXR1cm4gMDsKfQoK