My AC solution is O(1). On Thu, Jun 16, 2011 at 2:29 PM, PRAMENDRA RATHi rathi <prathi...@gmail.com>wrote:
> without DP it will be TLE.. > ----------------------------------------- > PRAMENDRA RATHI > NIT ALLAHABAD > > > > > On Thu, Jun 16, 2011 at 9:04 AM, saurabh singh <saurab...@gmail.com>wrote: > >> >> t,m;f(n){return 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));} >> My best attempt with the c code......132 bytes still.... >> Now gonna try perl....It definitely requires exceptional skills to bring >> it down to 111 bytes but have this gut feeling this is not impossible.... >> >> >> -- >> Saurabh Singh >> B.Tech (Computer Science) >> MNNIT 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. >> > > -- > 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. > -- Regards, Vipul -- 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.