very sorry...... https://www.spoj.pl/problems/socialne/ <https://www.spoj.pl/problems/socialne/>apologies once again
On Thu, Jun 30, 2011 at 7:23 PM, sunny agrawal <[email protected]>wrote: > Problem Link ? > > On Thu, Jun 30, 2011 at 6:48 PM, saurabh singh <[email protected]>wrote: > >> Any idea how to solve this problem? >> I am currently using graph and counting adjacent edges for the index. >> 1 ----> 2 >> \ >> \ >> 3 >> eg for this graph structure 2 will have maximum possible friends.I am >> still sorting out the bugs in my code. >> Anybody has better solution? >> >> >> >> -- >> 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 [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. >> > > > > -- > Sunny Aggrawal > B-Tech IV year,CSI > Indian Institute Of Technology,Roorkee > > -- > 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. > -- 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 [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.
