how abt using FSA ? consider state as a remainder when the given no. is divided by 3.
Then we get a FSA for any length no. as [image: fsa.JPG] On Sun, Jun 6, 2010 at 12:15 AM, divya <[email protected]> wrote: > Find if a number is divisible my 3, without using %,/ or *. You can > use atoi(). > > -- > 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]<algogeeks%[email protected]> > . > 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 [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.
<<fsa.JPG>>
