{"id":428,"date":"2012-07-29T00:11:45","date_gmt":"2012-07-29T04:11:45","guid":{"rendered":"http:\/\/www.joshho.com\/blog\/?p=428"},"modified":"2017-08-01T10:58:15","modified_gmt":"2017-08-01T14:58:15","slug":"project-euler-problem-8","status":"publish","type":"post","link":"https:\/\/www.joshho.com\/blog\/2012\/07\/29\/project-euler-problem-8\/","title":{"rendered":"Project Euler &#8211; Problem 8"},"content":{"rendered":"<p>Problem 8: Discover the largest product of five consecutive digits in the 1000-digit number.<br \/>\n<!--more--><br \/>\n<code><\/p>\n<pre lang=\"java\">\r\nimport java.util.*;\r\nimport java.lang.*;\r\n \r\nclass Main\r\n{\r\n        public static void main (String[] args) throws java.lang.Exception\r\n        {\r\n                String strnum = \"7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450\";\r\n                double largestProd = 0;\r\n                int loc=0;\r\n \r\n                 for(int i=0; i<strnum.length()-13; i++){\r\n                \t\tdouble prod = 1;\r\n                        for(int j=i;j<i+13;j++){\r\n                    \t\tif(strnum.charAt(j) == 48){\/\/Ignore 0\r\n                                i=j; break;\r\n                        \t}\r\n                    \t\tprod *= (strnum.charAt(j)-48);\r\n                        }\r\n                        if(largestProd < prod){\r\n                                largestProd=prod;loc=i;\r\n                        }\r\n                }\r\n                System.out.printf(\"Largest Prod: %.0f\\n\", largestProd);\r\n                System.out.println(\"Largest Prod: \"+prod);\r\n        }\r\n}\r\n<\/pre>\n<p><\/code><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Problem 8: Discover the largest product of five consecutive digits in the 1000-digit number.<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[56],"tags":[],"_links":{"self":[{"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/posts\/428"}],"collection":[{"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/comments?post=428"}],"version-history":[{"count":0,"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/posts\/428\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/media?parent=428"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/categories?post=428"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.joshho.com\/blog\/wp-json\/wp\/v2\/tags?post=428"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}