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
Problem Link ?
On Thu, Jun 30, 2011 at 6:48 PM, saurabh singh saurab...@gmail.com 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
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 sunny816.i...@gmail.comwrote:
Problem Link ?
On Thu, Jun 30, 2011 at 6:48 PM, saurabh singh saurab...@gmail.comwrote:
Any idea
http://www.spoj.pl/problems/SOCIALNE/
On Thu, Jun 30, 2011 at 7:25 PM, saurabh singh saurab...@gmail.com wrote:
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
can you tell me the problem? or link?
On Mon, May 23, 2011 at 6:09 PM, Dumanshu duman...@gmail.com wrote:
In this problem u have to write a code(interested in a C code) which
will cause a segmentation fault. Now the trick is to write the code as
short as possible. Your score is the no. of
Using the asm construct of c..
Though i did this problem in native asm and my solution is 3 char ;)...
The point is you have to know if not proficient with NASM(Net Assembler
used by SPOJ)...
If you need the solution mail me.
--
Saurabh Singh
B.Tech (Computer Science)
MNNIT
http://www.spoj.pl/problems/SIGSEGV/
On Mon, May 23, 2011 at 7:52 PM, kumar anurag anurag.it.jo...@gmail.comwrote:
can you tell me the problem? or link?
On Mon, May 23, 2011 at 6:09 PM, Dumanshu duman...@gmail.com wrote:
In this problem u have to write a code(interested in a C code) which
can you post the problem link?
On Mon, May 23, 2011 at 7:53 PM, saurabh singh saurab...@gmail.com wrote:
Using the asm construct of c..
Though i did this problem in native asm and my solution is 3 char ;)...
The point is you have to know if not proficient with NASM(Net Assembler
