27 lines
466 B
Text
27 lines
466 B
Text
|
int fibR(int n) {
|
||
|
|
if(n == 0) {return 0;}
|
||
|
|
if(n == 1) {return 1;}
|
||
|
|
return fibR(n - 1) + fibR(n-2);
|
||
|
|
}
|
||
|
|
|
||
|
|
int fibI(int n) {
|
||
|
|
var a = 0;
|
||
|
|
var b = 1;
|
||
|
|
if(n == 0) {return a;}
|
||
|
|
if(n == 1) {return b;}
|
||
|
|
while(n-2 > 0) {
|
||
|
|
var old = b;
|
||
|
|
b = b + a;
|
||
|
|
a = old;
|
||
|
|
n = n - 1;
|
||
|
|
}
|
||
|
|
return a + b;
|
||
|
|
}
|
||
|
|
|
||
|
|
int program (int argc, string[] argv)
|
||
|
|
{
|
||
|
|
var val = 1;
|
||
|
|
if(fibR(12) == 144 & fibI(12) == 144) {val = 0;}
|
||
|
|
return val;
|
||
|
|
}
|