OJ Board

I am getting TLE in this problem.But I don't know why.Can anyone please help me?
#include<iostream>

using namespace std;

int f91(int n)
{
if(n<=100)
{
return f91(f91(n+11));
}
else if(n>=101)
return n-10;
}

int main(void)
{
int n;
while(cin>>n)
{
if(n==0)
return 0;
cout<<"f91("<<n ...

sohel, thank u very much, u enlightened me:)

I use bisearch to find the first one in a1-an
which larger than an/2, supposing it's ai
which larger than an/3, supposing it's aj
which larger than an/5, supposing it's ak

then an+1 is min{2*ai, 3*aj, 5*ak}

I give thanks to lotoren and recursively ...

"Bhagsash upopado" means nothing but "Remainder Theorem"