UVa 10696 f91

题目链接http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1637

给方程求值，咋一看觉得挺简单的。递归不太懂，中间那个循环做了很多次才做出来，具体看代码

#include<stdio.h>
int main()
{
long int banana,apple,pea,mango;
while(scanf("%d",&banana)!=EOF)
{
mango=banana;
if(banana==0)break;
if(banana<=100)
{
while(banana<101||apple+pea!=2)
{
apple=0;
pea=0;
if(banana<=100)
{
banana=banana+11;
apple++;
}
if(banana>=101)
{
banana=banana-10;
pea++;
}
}
}
if(banana>=101)
{
banana=banana-10;
}
printf("f91(%d) = %d\n",mango,banana);
}
return 0;
}