problem:::
https://www.spoj.pl/problems/FIBSUM/
can anyone suggest idea to reduce my code to 111 byte..its currebt size is
about 174
int a[50]={0},t,m;
f(int n) { return a[n]=a[n]?a[n]:n<=2?1:f(n-1)+f(n-2); }
main() {
scanf("%d",&t);
while(t--)
{ scanf("%d",&m) ;
printf("%d\n",(f(m+11)-f(m+1)+f(6+m)%10));
}
return 0;}
-----------------------------------------
PRAMENDRA RATHI
NIT ALLAHABAD
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
