{"id":236,"date":"2021-01-11T23:42:00","date_gmt":"2021-01-11T18:12:00","guid":{"rendered":"https:\/\/www.codingbroz.com\/?p=236"},"modified":"2021-01-11T23:39:37","modified_gmt":"2021-01-11T18:09:37","slug":"multiple-of-3-codechef-solution","status":"publish","type":"post","link":"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/","title":{"rendered":"Multiple of 3 CodeChef Solution &#8211; DSA LEARNING SERIES"},"content":{"rendered":"\n<p>Today we will be Solving <strong>Multiple of 3 CodeChef Problem<\/strong> which is a part of <strong>CodeChef DSA Learning Series<\/strong>.<\/p>\n\n\n\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_65 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<label for=\"ez-toc-cssicon-toggle-item-662c2f7e67424\" class=\"ez-toc-cssicon-toggle-label\"><label class=\"ez-toc-title\">Table of Contents<\/label>\n<span class=\"ez-toc-cssicon\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #0090ff;color:#0090ff\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #0090ff;color:#0090ff\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/label><input type=\"checkbox\"  id=\"ez-toc-cssicon-toggle-item-662c2f7e67424\" checked \/><nav><ul class='ez-toc-list ez-toc-list-level-1 ' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Task\" title=\"Task\">Task<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Input\" title=\"Input \">Input <\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Output\" title=\"Output\">Output<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Constraints\" title=\"Constraints\">Constraints<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Example\" title=\"Example\">Example<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Explanation\" title=\"Explanation\">Explanation<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#Solutions_%E2%80%93_Multiple_of_3_CodeChef_Solution\" title=\"Solutions &#8211; Multiple of 3 CodeChef Solution\">Solutions &#8211; Multiple of 3 CodeChef Solution<\/a><ul class='ez-toc-list-level-3' ><li class='ez-toc-heading-level-3'><a class=\"ez-toc-link ez-toc-heading-8\" href=\"https:\/\/www.codingbroz.com\/multiple-of-3-codechef-solution\/#C\" title=\"C++\">C++<\/a><\/li><\/ul><\/li><\/ul><\/nav><\/div>\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Task\"><\/span><strong>Task<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Consider a very long K-digit number N with digits d0, d1, \u2026, dK-1 (in decimal notation; d0 is the most significant and dK-1 the least significant digit). This number is so large that we can&#8217;t give it to you on the input explicitly; instead, you are only given its starting digits and a way to construct the remainder of the number.<\/p>\n\n\n\n<p>Specifically, you are given d0 and d1; for each i \u2265 2, di is the sum of all preceding (more significant) digits, modulo 10 \u2014 more formally, the following formula must hold:<\/p>\n\n\n\n<p>Determine if N is a multiple of 3.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Input\"><\/span><strong>Input<\/strong> <span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.<\/p>\n\n\n\n<p>The first and only line of each test case contains three space-separated integers K, d0 and d1.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Output\"><\/span><strong>Output<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>For each test case, print a single line containing the string &#8220;YES&#8221; (without quotes) if the number N is a multiple of 3 or &#8220;NO&#8221; (without quotes) otherwise.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Constraints\"><\/span><strong>Constraints<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<ul><li><strong>1 \u2264 T \u2264 1000<\/strong><\/li><li><strong>2 \u2264 K \u2264 1012<\/strong><\/li><li><strong>1 \u2264 d0 \u2264 9<\/strong><\/li><li><strong>0 \u2264 d1 \u2264 9<\/strong><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Example\"><\/span><strong>Example<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Input<\/strong><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>3\n5 3 4\n13 8 1\n760399384224 5 1<\/code><\/pre>\n\n\n\n<p><strong>Output<\/strong> <\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>NO\nYES\nYES\n<\/code><\/pre>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Explanation\"><\/span><strong>Explanation<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Example case 1:<\/strong> The whole number N is 34748, which is not divisible by 3, so the answer is NO.<\/p>\n\n\n\n<p><strong>Example case 2:<\/strong> The whole number N is 8198624862486, which is divisible by 3, so the answer is YES.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Solutions_%E2%80%93_Multiple_of_3_CodeChef_Solution\"><\/span><strong>Solutions &#8211; Multiple of 3 CodeChef Solution<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<pre class=\"wp-block-code\"><code>import java.util.Scanner;\n\nclass MULTHREE {\n    public static void solve(long k,int d0,int d1){\n        StringBuffer sb=new StringBuffer(\"\"+d0+d1);\n        long sum=d1+d0;\n\n        if(k&gt;=3){\n            if(sum%5!=0){\n                sum=sum+(sum%10);\n                for(long i=(k-3)%4;i&gt;0;i--){\n                    sum=sum+(sum%10);\n                }\n                sum=sum+((k-3)\/4)*20;\n            }else {\n                System.out.println(\"NO\");\n                return;\n            }\n        }\n\n        if(sum%3==0){\n            System.out.println(\"YES\");\n        }else {\n            System.out.println(\"NO\");\n        }\n\n\n    }\n    public static void main(String&#91;] args) {\n        Scanner sc=new Scanner(System.in);\n        int T=sc.nextInt();\n        while (T--&gt;0){\n           int d0,d1;\n           long k;\n           k=sc.nextLong();\n           d0=sc.nextInt();\n           d1=sc.nextInt();\n           solve(k,d0,d1);\n        }\n    }\n}\n<\/code><\/pre>\n\n\n\n<h3 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"C\"><\/span><strong>C++<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h3>\n\n\n\n<pre class=\"wp-block-code\"><code>#include &lt;bits\/stdc++.h&gt;\ntypedef long long ll;\nusing namespace std;\n\nint main() {\n\n\n\n\tios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);\n\n\tint t ;\n\n\tcin &gt;&gt; t;\n\n\twhile(t--){\n\n\t\tll k;int d0,d1;\n\t\tcin &gt;&gt; k &gt;&gt; d0 &gt;&gt; d1;\n\t\tint s = d0+d1;\n\n\t\tint c = (2*s)%10 + (4*s)%10 +(6*s)%10 +(8*s)%10;\n\t\tll cycles = (k-3)\/4;\n\t\tll ans = 0;\n\t\tif(k==2){\n\t\t\tans = s;\n\t\t} \n\t\telse{\n\t\t\tans = s+(s%10) + (c *1LL *cycles);\n\t\t\n\t\tint left = (k-3)-(cycles*4);\n\t\tint p=2;\n\t\tfor(int i=1;i&lt;=left;i++){\n\t\t\tans += (p*s)%10;\n\t\t\tp=(p*2)%10;\n\t\t}\n\t}\n\n\t\n\t\tif(ans%3==0) cout &lt;&lt; \"YES\\n\";\n\n\t\telse      cout &lt;&lt; \"NO\\n\";\n\t}\n\treturn 0;\n}<\/code><\/pre>\n\n\n\n<p><strong>Disclaimer:<\/strong> The above Problem (<strong>Multiple of 3<\/strong>) is generated by <strong><a href=\"https:\/\/www.codechef.com\/\" target=\"_blank\" aria-label=\"CodeChef (opens in a new tab)\" rel=\"noreferrer noopener\" class=\"rank-math-link\">CodeChef<\/a><\/strong> but the Solution is provided by <strong><a href=\"https:\/\/www.codingbroz.com\/\" class=\"rank-math-link\">CodingBroz<\/a><\/strong>.<\/p>\n\n\n\n<p><strong>Broz Who Code<\/strong><\/p>\n\n\n\n<p><strong>CodingBroz<\/strong><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Today we will be Solving Multiple of 3 CodeChef Problem which is a part of CodeChef DSA Learning Series. Task Consider a very long K-digit number N with digits d0, d1, \u2026, dK-1 (in decimal notation; d0 is the most significant and dK-1 the least significant digit). This number is so large that we can&#8217;t [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"default","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[54,71],"tags":[55,22,72],"jetpack_sharing_enabled":true,"jetpack_featured_media_url":"","jetpack-related-posts":[],"_links":{"self":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/236"}],"collection":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/comments?post=236"}],"version-history":[{"count":2,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/236\/revisions"}],"predecessor-version":[{"id":255,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/posts\/236\/revisions\/255"}],"wp:attachment":[{"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/media?parent=236"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/categories?post=236"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.codingbroz.com\/wp-json\/wp\/v2\/tags?post=236"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}