// API callback
related_results_labels_thumbs({"version":"1.0","encoding":"UTF-8","feed":{"xmlns":"http://www.w3.org/2005/Atom","xmlns$openSearch":"http://a9.com/-/spec/opensearchrss/1.0/","xmlns$blogger":"http://schemas.google.com/blogger/2008","xmlns$georss":"http://www.georss.org/georss","xmlns$gd":"http://schemas.google.com/g/2005","xmlns$thr":"http://purl.org/syndication/thread/1.0","id":{"$t":"tag:blogger.com,1999:blog-5735018943946871385"},"updated":{"$t":"2023-12-09T13:35:10.032-08:00"},"category":[{"term":"cpp"},{"term":"c++"},{"term":"hackerrank"},{"term":"c++ program"},{"term":"Linked Lists in C++"},{"term":"c"},{"term":"c programming"},{"term":"programming"},{"term":"PATTERNS"},{"term":"coding"},{"term":"C++ Diamond Pattern"},{"term":"Hackerrank Delete duplicate-value nodes from a sorted linked list Solution"},{"term":"Hackerrank Insert a node into a sorted doubly linked list Solution"},{"term":"Hackerrank Print in Reverse solution"},{"term":"Hackerrank Print the elements of a linked list solution"},{"term":"Hackerrank Reverse a doubly linked list solution"},{"term":"TEXT ANALYZER"},{"term":"Utopian tree"},{"term":"education"},{"term":"hourglass pattern c++"},{"term":"java"},{"term":"java program"},{"term":"lexical analyser"},{"term":"mini project"},{"term":"networks"},{"term":"operator precedence"},{"term":"opps sandclock pattern"},{"term":"opps triangle pattern"},{"term":"pattern generation in c"},{"term":"triangle pattern c++"},{"term":"unipolar encoding simulation"}],"title":{"type":"text","$t":"GRK"},"subtitle":{"type":"html","$t":"A blog by Gokul Raj Kumar"},"link":[{"rel":"http://schemas.google.com/g/2005#feed","type":"application/atom+xml","href":"https:\/\/blog.grkweb.com\/feeds\/posts\/default"},{"rel":"self","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/-\/c+programming?alt=json-in-script\u0026max-results=6"},{"rel":"alternate","type":"text/html","href":"https:\/\/blog.grkweb.com\/search\/label\/c%20programming"},{"rel":"hub","href":"http://pubsubhubbub.appspot.com/"}],"author":[{"name":{"$t":"GRK"},"uri":{"$t":"http:\/\/www.blogger.com\/profile\/00099219911209322075"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"16","height":"16","src":"https:\/\/img1.blogblog.com\/img\/b16-rounded.gif"}}],"generator":{"version":"7.00","uri":"http://www.blogger.com","$t":"Blogger"},"openSearch$totalResults":{"$t":"3"},"openSearch$startIndex":{"$t":"1"},"openSearch$itemsPerPage":{"$t":"6"},"entry":[{"id":{"$t":"tag:blogger.com,1999:blog-5735018943946871385.post-2178678384943778319"},"published":{"$t":"2014-09-23T09:46:00.003-07:00"},"updated":{"$t":"2022-01-16T20:38:16.592-08:00"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"c"},{"scheme":"http://www.blogger.com/atom/ns#","term":"c programming"},{"scheme":"http://www.blogger.com/atom/ns#","term":"hackerrank"},{"scheme":"http://www.blogger.com/atom/ns#","term":"Utopian tree"}],"title":{"type":"text","$t":"Utopian Tree"},"content":{"type":"html","$t":"\u003Cdiv dir=\"ltr\" style=\"text-align: left;\" trbidi=\"on\"\u003E\n\u003Cbr \/\u003E\n\u003Cdiv class=\"msB\" style=\"background-color: white; border: 0px; color: #39424e; font-family: \u0026quot;Whitney SSm A\u0026quot;, \u0026quot;Whitney SSm B\u0026quot;, verdana, \u0026quot;Lucida Grande\u0026quot;, sans-serif; font-size: 16px; font-stretch: inherit; line-height: 22.4px; margin: 0px 0px 10px; outline: 0px; overflow-wrap: break-word; padding: 0px; vertical-align: baseline; word-break: break-word; word-wrap: break-word;\"\u003E\n\u003Cdiv style=\"border: 0px; font-size: 18px; font-stretch: inherit; font-style: inherit; font-variant: inherit; line-height: 1.5em; margin-bottom: 1em; outline: 0px; overflow-wrap: break-word; padding: 0px; vertical-align: baseline; word-break: break-word; word-wrap: break-word;\"\u003E\n\u003Cstrong style=\"border: 0px; font-family: inherit; font-stretch: inherit; font-style: inherit; font-variant: inherit; line-height: inherit; margin: 0px; outline: 0px; overflow-wrap: break-word; padding: 0px; vertical-align: baseline; word-break: break-word; word-wrap: break-word;\"\u003EProblem Statement\u003C\/strong\u003E\u003C\/div\u003E\n\u003C\/div\u003E\n\u003Cdiv class=\"msB\" style=\"background-color: white; border: 0px; color: #39424e; font-family: \u0026quot;Whitney SSm A\u0026quot;, \u0026quot;Whitney SSm B\u0026quot;, verdana, \u0026quot;Lucida Grande\u0026quot;, sans-serif; font-size: 16px; font-stretch: inherit; line-height: 22.4px; margin: 0px 0px 10px; outline: 0px; overflow-wrap: break-word; padding: 0px; vertical-align: baseline; word-break: break-word; word-wrap: break-word;\"\u003E\n\u003Cdiv style=\"border: 0px; font-size: 18px; font-stretch: inherit; font-style: inherit; font-variant: inherit; line-height: 1.5em; margin-bottom: 1em; outline: 0px; overflow-wrap: break-word; padding: 0px; vertical-align: baseline; word-break: break-word; word-wrap: break-word;\"\u003E\nThe Utopian Tree goes through 2 cycles of growth every year. The first growth cycle occurs during the spring, when it doubles in height. The second growth cycle occurs during the summer, when its height increases by 1 meter.\u0026nbsp;\u003Cbr style=\"overflow-wrap: break-word; word-break: break-word; word-wrap: break-word;\" \/\u003ENow, a new Utopian Tree sapling is planted at the onset of spring. Its height is 1 meter. Can you find the height of the tree after\u0026nbsp;\u003Cspan class=\"MathJax_Preview\" style=\"border: 0px; color: #888888; font-family: inherit; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; line-height: inherit; margin: 0px; outline: 0px; overflow-wrap: break-word; padding: 0px; vertical-align: baseline; word-break: break-word; word-wrap: break-word;\"\u003E\u003C\/span\u003E\u003Cspan aria-readonly=\"true\" class=\"MathJax\" id=\"MathJax-Element-1-Frame\" role=\"textbox\" style=\"border: 0px; direction: ltr; display: inline; float: none; font-family: inherit; font-stretch: inherit; font-variant: inherit; line-height: normal; margin: 0px; max-height: none; max-width: none; min-height: 0px; min-width: 0px; outline: 0px; overflow-wrap: normal; padding: 0px; vertical-align: baseline; white-space: nowrap; word-break: break-word; word-spacing: normal; word-wrap: normal;\"\u003E\u003Cnobr style=\"-webkit-transition: none; border: 0px; margin: 0px; max-height: none; max-width: none; min-height: 0px; min-width: 0px; padding: 0px; transition: none; vertical-align: 0px; word-break: break-word; word-wrap: break-word;\"\u003E\u003Cspan class=\"math\" id=\"MathJax-Span-1\" style=\"-webkit-transition: none; border: 0px; display: inline-block; font-family: inherit; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; margin: 0px; outline: 0px; padding: 0px; position: static; transition: none; vertical-align: 0px; width: 1.131em; word-break: break-word; word-wrap: break-word;\"\u003E\u003Cspan style=\"-webkit-transition: none; border: 0px; display: inline-block; font-family: inherit; font-size: 22.1399993896484px; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; height: 0px; margin: 0px; outline: 0px; padding: 0px; position: relative; transition: none; vertical-align: 0px; width: 0.906em; word-break: break-word; word-wrap: break-word;\"\u003E\u003Cspan style=\"-webkit-transition: none; border: 0px; clip: rect(1.673em 1000.002em 2.622em -0.359em); font-family: inherit; font-size: 22.1399993896484px; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; left: 0.002em; margin: 0px; outline: 0px; padding: 0px; position: absolute; top: -2.482em; transition: none; vertical-align: 0px; word-break: break-word; word-wrap: break-word;\"\u003E\u003Cspan class=\"mrow\" id=\"MathJax-Span-2\" style=\"-webkit-transition: none; border: 0px; display: inline; font-family: inherit; font-size: 22.1399993896484px; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; margin: 0px; outline: 0px; padding: 0px; position: static; transition: none; vertical-align: 0px; word-break: break-word; word-wrap: break-word;\"\u003E\u003Cspan class=\"mi\" id=\"MathJax-Span-3\" style=\"-webkit-transition: none; border: 0px; display: inline; font-family: MathJax_Math-italic; font-size: 22.1399993896484px; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; margin: 0px; outline: 0px; padding: 0px; position: static; transition: none; vertical-align: 0px; word-break: break-word; word-wrap: break-word;\"\u003EN\u003Cspan style=\"-webkit-transition: none; border: 0px; display: inline-block; font-family: inherit; font-size: 22.1399993896484px; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; height: 1px; margin: 0px; outline: 0px; overflow: hidden; padding: 0px; position: static; transition: none; vertical-align: 0px; width: 0.093em; word-break: break-word; word-wrap: break-word;\"\u003E\u003C\/span\u003E\u003C\/span\u003E\u003C\/span\u003E\u003Cspan style=\"-webkit-transition: none; border: 0px; display: inline-block; font-family: inherit; font-size: 22.1399993896484px; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; height: 2.486em; margin: 0px; outline: 0px; padding: 0px; position: static; transition: none; vertical-align: 0px; width: 0px; word-break: break-word; word-wrap: break-word;\"\u003E\u003C\/span\u003E\u003C\/span\u003E\u003C\/span\u003E\u003Cspan style=\"-webkit-transition: none; border-left-style: solid; border-width: 0px 0px 0px 0.003em; display: inline-block; font-family: inherit; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-weight: inherit; height: 0.947em; margin: 0px; outline: 0px; overflow: hidden; padding: 0px; position: static; transition: none; vertical-align: -0.053em; width: 0px; word-break: break-word; word-wrap: break-word;\"\u003E\u003C\/span\u003E\u003C\/span\u003E\u003C\/nobr\u003E\u003C\/span\u003E\u0026nbsp;growth cycles?\u003C\/div\u003E\n\u003C\/div\u003E\n\u003Ch3 style=\"text-align: left;\"\u003E\nSOURCE CODE:\u003C\/h3\u003E\n\u003Cpre style=\"background-image: URL(http:\/\/2.bp.blogspot.com\/_z5ltvMQPaa8\/SjJXr_U2YBI\/AAAAAAAAAAM\/46OqEP32CJ8\/s320\/codebg.gif); background: rgb(240, 240, 240); border: 1px dashed rgb(204, 204, 204); color: black; font-family: arial; font-size: 12px; height: auto; line-height: 20px; overflow: auto; padding: 0px; text-align: left; width: 99%;\"\u003E\u003Ccode style=\"color: black; overflow-wrap: normal; word-wrap: normal;\"\u003E #include\u0026lt;stdio.h\u0026gt;  \n void main()  \n {  \n   int t,test,total;  \n   scanf(\"%d\",\u0026amp;test);  \n   while(test--){  \n     scanf(\"%d\",\u0026amp;t);  \n     total=1;  \n     int flag=1;  \n     while(t--)  \n     {  \n       if(flag){  \n         if(total==1){  \n           total+=1;  \n         }else{  \n         total*=2;  \n         }  \n       flag--;  \n       }  \n       else{  \n         total+=1;  \n         flag++;  \n       }  \n     }  \n     printf(\"%d\\n\",total);  \n   }  \n }   \n\u003C\/code\u003E\u003C\/pre\u003E\n\u003Cbr \/\u003E\u003C\/div\u003E\n"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https:\/\/blog.grkweb.com\/feeds\/2178678384943778319\/comments\/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https:\/\/blog.grkweb.com\/2014\/09\/utopian-tree.html#comment-form","title":"4 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/2178678384943778319"},{"rel":"self","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/2178678384943778319"},{"rel":"alternate","type":"text/html","href":"https:\/\/blog.grkweb.com\/2014\/09\/utopian-tree.html","title":"Utopian Tree"}],"author":[{"name":{"$t":"GRK"},"uri":{"$t":"http:\/\/www.blogger.com\/profile\/00099219911209322075"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"16","height":"16","src":"https:\/\/img1.blogblog.com\/img\/b16-rounded.gif"}}],"thr$total":{"$t":"4"}},{"id":{"$t":"tag:blogger.com,1999:blog-5735018943946871385.post-1894594100708550161"},"published":{"$t":"2014-07-11T12:18:00.001-07:00"},"updated":{"$t":"2014-07-11T12:45:43.483-07:00"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"c"},{"scheme":"http://www.blogger.com/atom/ns#","term":"c programming"},{"scheme":"http://www.blogger.com/atom/ns#","term":"operator precedence"},{"scheme":"http://www.blogger.com/atom/ns#","term":"programming"}],"title":{"type":"text","$t":"Operator Precedence"},"content":{"type":"html","$t":"\u003Cdiv dir=\"ltr\" style=\"text-align: left;\" trbidi=\"on\"\u003E\n\u003Cdiv dir=\"ltr\" style=\"text-align: left;\" trbidi=\"on\"\u003E\nSimple program for operator precedence parser in C.\u003Cbr \/\u003E\nIt takes the expression as input and calculates the precedence of the operators.\u003Cbr \/\u003E\n\u003Cbr \/\u003E\nSubscribe to the blog to get instant updates via E-Mail.\u003Cbr \/\u003E\n\u003Ch2 style=\"text-align: left;\"\u003E\nPROGRAM CODE:\u003C\/h2\u003E\n\u003Cbr \/\u003E\n\u003Cpre style=\"background-image: URL(http:\/\/2.bp.blogspot.com\/_z5ltvMQPaa8\/SjJXr_U2YBI\/AAAAAAAAAAM\/46OqEP32CJ8\/s320\/codebg.gif); background: #f0f0f0; border: 1px dashed #CCCCCC; color: black; font-family: arial; font-size: 12px; height: auto; line-height: 20px; overflow: auto; padding: 0px; text-align: left; width: 99%;\"\u003E\u003Ccode style=\"color: black; word-wrap: normal;\"\u003E #include\u0026lt;stdio.h\u0026gt;  \n #include\u0026lt;string.h\u0026gt;  \n void main()  \n {  \n   int i,j,cnt=1;  \n   char operators[] =\"*\/%+-\",input[100];  \n   printf(\"Enter the statement : \");  \n   gets(input);  \n   for(i=0;i\u0026lt;strlen(operators);i++)  \n   {  \n     for(j=0;j\u0026lt;strlen(input);j++)  \n     {  \n       if(input[j]==operators[i])  \n       {  \n         printf(\"%d %c=%c%c%c\\n\",cnt++,input[j-1],input[j-1],input[j],input[j+1]);  \n         input[j+1]=input[j-1];  \n       }  \n     }  \n   }  \n }  \n\u003C\/code\u003E\u003C\/pre\u003E\n\u003C\/div\u003E\n\u003Cbr \/\u003E\n\u003Ch2 style=\"text-align: left;\"\u003E\nOUTPUT:\u003C\/h2\u003E\n\u003Cbr \/\u003E\n\u003Cdiv class=\"separator\" style=\"clear: both; text-align: center;\"\u003E\n\u003Ca href=\"http:\/\/3.bp.blogspot.com\/-ms0kOoiSOgM\/U8A4KdjDyYI\/AAAAAAAAAiI\/YhDfxMkwj54\/s1600\/UntitledS.png\" imageanchor=\"1\" style=\"margin-left: 1em; margin-right: 1em;\"\u003E\u003Cimg border=\"0\" src=\"http:\/\/3.bp.blogspot.com\/-ms0kOoiSOgM\/U8A4KdjDyYI\/AAAAAAAAAiI\/YhDfxMkwj54\/s1600\/UntitledS.png\" height=\"321\" width=\"640\" \/\u003E\u003C\/a\u003E\u003C\/div\u003E\n\u003Cbr \/\u003E\nSubscribe to the blog to get instant updates via E-Mail.\u003Cbr \/\u003E\n\u003Cbr \/\u003E\n\u003Cspan style=\"background-color: white; font-family: Arial, Tahoma, Helvetica, FreeSans, sans-serif; font-size: 18px; line-height: 25.200000762939453px;\"\u003ENotify the Suggestions about the program through comments ... :)\u003C\/span\u003E\u003C\/div\u003E\n"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https:\/\/blog.grkweb.com\/feeds\/1894594100708550161\/comments\/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https:\/\/blog.grkweb.com\/2014\/07\/operator-precedence.html#comment-form","title":"0 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/1894594100708550161"},{"rel":"self","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/1894594100708550161"},{"rel":"alternate","type":"text/html","href":"https:\/\/blog.grkweb.com\/2014\/07\/operator-precedence.html","title":"Operator Precedence"}],"author":[{"name":{"$t":"GRK"},"uri":{"$t":"http:\/\/www.blogger.com\/profile\/00099219911209322075"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"16","height":"16","src":"https:\/\/img1.blogblog.com\/img\/b16-rounded.gif"}}],"media$thumbnail":{"xmlns$media":"http://search.yahoo.com/mrss/","url":"http:\/\/3.bp.blogspot.com\/-ms0kOoiSOgM\/U8A4KdjDyYI\/AAAAAAAAAiI\/YhDfxMkwj54\/s72-c\/UntitledS.png","height":"72","width":"72"},"thr$total":{"$t":"0"}},{"id":{"$t":"tag:blogger.com,1999:blog-5735018943946871385.post-8039109526893003507"},"published":{"$t":"2014-07-06T01:39:00.001-07:00"},"updated":{"$t":"2014-07-06T01:39:04.796-07:00"},"category":[{"scheme":"http://www.blogger.com/atom/ns#","term":"c"},{"scheme":"http://www.blogger.com/atom/ns#","term":"c programming"},{"scheme":"http://www.blogger.com/atom/ns#","term":"lexical analyser"}],"title":{"type":"text","$t":"Lexical Analyzer"},"content":{"type":"html","$t":"\u003Cdiv dir=\"ltr\" style=\"text-align: left;\" trbidi=\"on\"\u003E\nSimple Lexical Analyzer program. It takes the filename in the same directory as the input and analyzes the program for variables operators and special characters. and prints the output for each values separately.\u003Cbr \/\u003E\n\u003Cbr \/\u003E\n\u003Cpre style=\"background-image: URL(http:\/\/2.bp.blogspot.com\/_z5ltvMQPaa8\/SjJXr_U2YBI\/AAAAAAAAAAM\/46OqEP32CJ8\/s320\/codebg.gif); background: #f0f0f0; border: 1px dashed #CCCCCC; color: black; font-family: arial; font-size: 12px; height: auto; line-height: 20px; overflow: auto; padding: 0px; text-align: left; width: 99%;\"\u003E\u003Ccode style=\"color: black; word-wrap: normal;\"\u003E #include\u0026lt;stdio.h\u0026gt;  \n #include\u0026lt;conio.h\u0026gt;  \n #include\u0026lt;string.h\u0026gt;  \n void main()  \n {  \n      FILE *fp;  \n      int i=0;  \n      char input[100],filename[20];  \n      clrscr();  \n      printf(\"Enter Filename : \");  \n      scanf(\"%s\",filename);  \n      fp=fopen(filename,\"r\");  \n      while(!feof(fp))  \n      {  \n           input[i]=fgetc(fp);  \n           i++;  \n      }  \n      input[--i]='\\0';  \n      for(i=0;i\u0026lt;strlen(input);i++)  \n      {  \n           if(isalpha(input[i]))  \n           {  \n                printf(\"%c is a Character.\\n\",input[i]);  \n           }  \n           else if(input[i]=='='||input[i]=='+'||input[i]=='-'||input[i]=='*'||input[i]=='\/'||input[i]=='%')  \n           {  \n                printf(\"%c is an Operator.\\n\",input[i]);  \n           }  \n           else if(isspace(input[i])||iscntrl(input[i]))  \n           {  \n           }  \n           else if(isdigit(input[i]))  \n           {  \n                printf(\"%c is a number.\\n\",input[i]);  \n           }  \n           else  \n           {  \n                printf(\"%c is a Special character.\\n\",input[i]);  \n           }  \n      }  \n      getch();  \n }  \n\u003C\/code\u003E\u003C\/pre\u003E\nNotify the Suggestions about the program through comments ... :)\n\u003C\/div\u003E\n"},"link":[{"rel":"replies","type":"application/atom+xml","href":"https:\/\/blog.grkweb.com\/feeds\/8039109526893003507\/comments\/default","title":"Post Comments"},{"rel":"replies","type":"text/html","href":"https:\/\/blog.grkweb.com\/2014\/07\/lexical-analyzer-c-program.html#comment-form","title":"8 Comments"},{"rel":"edit","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/8039109526893003507"},{"rel":"self","type":"application/atom+xml","href":"https:\/\/www.blogger.com\/feeds\/5735018943946871385\/posts\/default\/8039109526893003507"},{"rel":"alternate","type":"text/html","href":"https:\/\/blog.grkweb.com\/2014\/07\/lexical-analyzer-c-program.html","title":"Lexical Analyzer"}],"author":[{"name":{"$t":"GRK"},"uri":{"$t":"http:\/\/www.blogger.com\/profile\/00099219911209322075"},"email":{"$t":"noreply@blogger.com"},"gd$image":{"rel":"http://schemas.google.com/g/2005#thumbnail","width":"16","height":"16","src":"https:\/\/img1.blogblog.com\/img\/b16-rounded.gif"}}],"thr$total":{"$t":"8"}}]}});