{"id":549,"date":"2011-02-23T20:47:49","date_gmt":"2011-02-24T01:47:49","guid":{"rendered":"http:\/\/www.xavignu.com\/?p=549"},"modified":"2011-02-23T20:47:49","modified_gmt":"2011-02-24T01:47:49","slug":"project-euler","status":"publish","type":"post","link":"https:\/\/www.xavignu.com\/?p=549","title":{"rendered":"Project Euler"},"content":{"rendered":"<p>So I was looking around for some programming information and found <a href=\"http:\/\/projecteuler.net\/\" target=\"_blank\">Project Euler<\/a>. They have a number of problems to program. You can choose any programming language, it&#8217;s just to enhance your programming abilities.<\/p>\n<p>So here is the answer to problem number one.<\/p>\n<p>[perl]<br \/>\n#!\/usr\/bin\/perl<\/p>\n<p>use warnings;<br \/>\nuse strict;<\/p>\n<p>my $sum;<br \/>\nmy $count;<\/p>\n<p>for ($count = 0; $count &lt; 1000; $count ++) {<br \/>\n        if (($count % 3 == 0) || ($count % 5 == 0)) {<br \/>\n                $sum = $count + $sum;<br \/>\n                print &quot;\\$sum is $sum\\n&quot;; }<br \/>\n        }<br \/>\n[\/perl]<\/p>\n<p>It&#8217;s a really simple exercise. You just need to sum of all the multiples of 3 or 5 below 1000.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>So I was looking around for some programming information and found Project Euler. They have a number of problems to program. You can choose any programming language, it&#8217;s just to enhance your programming abilities. So here is the answer to problem number one. [perl] #!\/usr\/bin\/perl use warnings; use strict; my $sum; my $count; for ($count [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false,"jetpack_publicize_feature_enabled":true},"categories":[3],"tags":[22,6,50,70],"jetpack_featured_media_url":"","jetpack_publicize_connections":[],"jetpack_shortlink":"https:\/\/wp.me\/pTQgt-8R","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.xavignu.com\/index.php?rest_route=\/wp\/v2\/posts\/549"}],"collection":[{"href":"https:\/\/www.xavignu.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.xavignu.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.xavignu.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.xavignu.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=549"}],"version-history":[{"count":0,"href":"https:\/\/www.xavignu.com\/index.php?rest_route=\/wp\/v2\/posts\/549\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.xavignu.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=549"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.xavignu.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=549"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.xavignu.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=549"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}