int main()
{
for(int i=0;i<10;i++){
std::cout << fib3(i) << fib2(i) << fib(i) << std::endl;
}
return 0;
}
/** address: 0x10000440 */
__size32 fib1()
{
int g3; // r3
__size32 g9; // r9
g3 = fib2(g3); /* Warning: also results in g9 */
return g3; /* WARNING: Also returning: g9 := g9 */
}
int main(){
long long t1 = clock();
printf("%d\n", fib1(42));
long long t2 = clock();
printf("%d\n", t2 - t1);
t1 = clock();
printf("%d\n", fib2(42));
t2 = clock();
printf("%d\n", t2 - t1);
return 0;
}
void main()
{
printf("%d\n",fib(2));//1,1,2,3,5,8,13,21,34
int n=9;
matM(n-1);
printf("%d th fibonacci no.. %d\n",n,M[0][0]);
printf("%d th fibonacci no.. %d\n",n,fib2(n));
printf("\nif %d is..perfect square...%d\n",120,perfectSqr(120.0));
printf("\nif %d is fbonacci no..%d\n",34,chkFib(34));
}
// address: 0x10000440
__size32 fib1() {
int g3; // r3
g3 = fib2(g3);
return g3;
}
static int _fib(int x0, int x1, int n){
if(n == 0)
return x0;
else
return fib2(x1, x0 + x1, n - 1);
}
