see in this problem if a=1 then the no. of tiles will be b*c so now if u increase a in steps then no. of tiles will increase by c+b-1
so ans is b*c + (a-1)*(c+b-1) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
