Re: [algogeeks] Another SPOJ Problem -SIGSEGV -- Need Help

2011-05-23 Thread kumar anurag
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 characters in the code.
 Less the no. of characters, Better the score(rank).

 I wrote a code something like this :

 main(int*a){*a=3;}

 its 18chars.
 But the best solution in C is 5 characters. Does this mean it is
 possible to answer this quesion without using a main() function
 because main() itself is 6 chars?
 Is it possible to compile and run a .c file which doesn't have a
 main() function and cause runtime seg fault?
 Any help would be greatly appreciated.

 --
 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.




-- 
Kumar Anurag

-- 
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.



Re: [algogeeks] Another SPOJ Problem -SIGSEGV -- Need Help

2011-05-23 Thread saurabh singh
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 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.



Re: [algogeeks] Another SPOJ Problem -SIGSEGV -- Need Help

2011-05-23 Thread saurabh singh
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
 will cause a segmentation fault. Now the trick is to write the code as
 short as possible. Your score is the no. of characters in the code.
 Less the no. of characters, Better the score(rank).

 I wrote a code something like this :

 main(int*a){*a=3;}

 its 18chars.
 But the best solution in C is 5 characters. Does this mean it is
 possible to answer this quesion without using a main() function
 because main() itself is 6 chars?
 Is it possible to compile and run a .c file which doesn't have a
 main() function and cause runtime seg fault?
 Any help would be greatly appreciated.

 --
 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.




 --
 Kumar Anurag

  --
 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.




-- 
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.



Re: [algogeeks] Another SPOJ Problem -SIGSEGV -- Need Help

2011-05-23 Thread kumar anurag
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
 used by SPOJ)...
 If you need the solution mail me.

 --
 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.




-- 
Kumar Anurag

-- 
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.