<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
   <channel>
    <atom:link href="http://sahaya.webnode.com/rss/c-puzzles-answer.xml" rel="self" type="application/rss+xml" />
      <title>C Puzzles Answer - sahaya.webnode.com</title>
      <link>http://sahaya.webnode.com</link>
      <description></description>
      <language>en</language>
      <pubDate>Mon, 28 Jul 2008 14:19:00 +0200</pubDate>
      <lastBuildDate>Mon, 28 Jul 2008 14:19:00 +0200</lastBuildDate>
      <category>C Puzzles Answer</category> 
      <docs>http://blogs.law.harvard.edu/tech/rss</docs>
      <generator>Rubicus v2.0</generator>
      <managingEditor><![CDATA[npoke2@gmail.com (npoke2@gmail.com)]]></managingEditor>
      <webMaster><![CDATA[npoke2@gmail.com (npoke2@gmail.com)]]></webMaster>
      <item>
         <title>Puzzle 4 Answer</title>
         <link>http://sahaya.webnode.com/news/puzzle-4-answer/</link>
         <description><![CDATA[&#160;
Logic :
                  1. Read Three Numbers,
                  2. Find Out The Difference Between The First Two Numbers
                  3. Add Two Numbers Along With The Difference.
                  4. Divide The Sum By Two, This Will Gives The Bigger Number.
                  5. Now Find The Difference Between The Bigger Number &amp; The Third Number.
                  6. Repeat The Step 3,4.
                  7. Print The Biggest Number.
&#160;
&#160;
#include&lt;stdio.h&gt;...]]></description>
         <pubDate>Mon, 28 Jul 2008 14:19:00 +0200</pubDate>
         <guid isPermaLink="true">http://sahaya.webnode.com/news/puzzle-4-answer/</guid>
         <category>C Puzzles Answer</category>
      </item>
      <item>
         <title> Puzzle 3 Answer</title>
         <link>http://sahaya.webnode.com/news/c-puzzle-3/</link>
         <description><![CDATA[&#160;
Declared two structure pointers, both should point to Linked List. 
 Travel the Linked List till the lost node using first pointer
 Increment the first pointer by 2 and increment the second pointer by 1.
 When the first pointer reaches the end node, the second pointer pointing the middle element of the list.
  Now   print the data, which is pointed by the second pointer.
 
void find_mid_element(struct Link_List *p)
                {
                  struct Link_List *first,*second;
    ...]]></description>
         <pubDate>Mon, 28 Jul 2008 14:12:00 +0200</pubDate>
         <guid isPermaLink="true">http://sahaya.webnode.com/news/c-puzzle-3/</guid>
         <category>C Puzzles Answer</category>
      </item>
      <item>
         <title>Puzzle 2 Answer</title>
         <link>http://sahaya.webnode.com/news/puzzle-2-answer/</link>
         <description><![CDATA[&#160;
Here I gave the solution to print up to 50.
if u want to make this program to print  N integers you have to initialize  the array Numbers with 1 to 32767.

&#160;
#include &lt;stdio.h&gt;
#include&lt;string.h&gt;
void main()
             {
                         int Input;
                        char Numbers[ ] =  {"1\n2\n3\n4\n5\n6\n7\n\8\n\9\n10\n11\n12\n13\n
                                                        14\n15\n16\n17\n18\n19\n20\n21\n22\n23\n24\n
                        ...]]></description>
         <pubDate>Fri, 06 Jun 2008 15:48:00 +0200</pubDate>
         <guid isPermaLink="true">http://sahaya.webnode.com/news/puzzle-2-answer/</guid>
         <category>C Puzzles Answer</category>
      </item>
      <item>
         <title>Puzzle 1 Answer</title>
         <link>http://sahaya.webnode.com/news/puzzle-1/</link>
         <description><![CDATA[if (!printf(“Hello”)) 
          ]]></description>
         <pubDate>Fri, 06 Jun 2008 15:45:00 +0200</pubDate>
         <guid isPermaLink="true">http://sahaya.webnode.com/news/puzzle-1/</guid>
         <category>C Puzzles Answer</category>
      </item>
   </channel>
</rss>