<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Simran Bawkar on Medium]]></title>
        <description><![CDATA[Stories by Simran Bawkar on Medium]]></description>
        <link>https://medium.com/@sim017bawkar?source=rss-7605a78490fb------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*BPpQ9WaJtoRH-sR_.</url>
            <title>Stories by Simran Bawkar on Medium</title>
            <link>https://medium.com/@sim017bawkar?source=rss-7605a78490fb------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 11:40:39 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@sim017bawkar/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[INTRODUCTION TO DIGIT DP]]></title>
            <link>https://sim017bawkar.medium.com/introduction-to-digit-dp-40f0e6c9a77d?source=rss-7605a78490fb------2</link>
            <guid isPermaLink="false">https://medium.com/p/40f0e6c9a77d</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <dc:creator><![CDATA[Simran Bawkar]]></dc:creator>
            <pubDate>Thu, 13 Jun 2019 19:18:26 GMT</pubDate>
            <atom:updated>2019-06-13T19:30:38.938Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*3SgSn4BlQnWRVLNBxxuVcw.png" /><figcaption>source : <a href="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAWcAAACMCAMAAACXkphKAAABs1BMVEUgICAAAAAfHyD///8eHx8YGBgdHh8fHh2ysrIcHR4WFhYaHR8cGxoeICALAAD8//9bW1sAAAsAABDz7dEPDw8ACQ6csssLCQ8eHBkAAAQXFxRMNx0uHQ0QBgB3YlH///pNTU19lLfw7ODo6Ok+Lx8XJTT///RCLhfx18gQFBgiNUWUtMwXAABHMSOwj3kUEQqhx9wAChwDJD5me5PE3epAVGdWb5LQuqqYmZkrRl1heZ3/+uZYQC4hFAyBpLyAmK/m2ce2ytvW5//aybjhv6lYaoJrSC8AAB0mDACasNWewc/e6O7/6dhGPzrKy82ag2G+qIvi+P9lVTx2Vy8ZMVl5hZEzHAD85MUkR1xycnKgqbK42e+MdmSCgICok3qPbV0hMUzo4Nq1w87BvLRBSVApNDzOuZVTboIvSW4bPlopIRfl0rM3MChnXFYgLUnCppWjm4tQYXIADCx5alsvMTRLMg9NXWuIb1La4OePfnYRGyifjm5wjap1WkCegW1UMQV5TiXi69ulmpa8s6s8LBSCdW4yDQCSmaheLAA6PkRWUVpXTEJnPyJnfYJxZl3BnIYAEDnVmN72AAAU5ElEQVR4nO1d/UMax9beWXZZYddF7CILETGgJqsmG4MIRuVDarRFCeYW21DhFsUYjamamEis2vfGm+b15ra5f/J7ziwYzVcbY1vf3nl+kNn5OHPmmTNnzs6uwHEMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDH8BCKduyZ+hFmeB86bPSSjOUzKtiOdrYIrzN9UST29YHw9Fq8NQDh/op+JLrL5U/kiVfw2OwwfSr9dSqg/+QK2V6p06fiGJ6anm08hwX8sEms9GZV73Cp+6NnjvxdSq/AEpgu4ROJ70Xe63f6xsQdLkU+mkJV3hsMsWDofv/xrP72XSfe2yeqoJeht678bqRw/+TVCej2e8wbk+vBGwcyd45t+u9c6Jknbio6ciWgL2SNtn7cAT8qwRYlj5kKJeTvAToqEn4xVIWIrxus8BJabPjhUN5FkjmkEnQtGI95jjU1AiXIqaJUXX7M66HM2ATjRno5Umwie5kVJ9liBdc0CuA/qFMgdk+TXQxScKUr2u1coOJSaV5OCsv5w3kWrXfJqlBeahcfu9dkXzODCL7H5NfAby3BgkdEaODBVGpFiCII3KQuc8TYicuRL+N/GexhIkh4Q8yw67mpjufxKPv9QEnje7f8YUqG5U4/HSjMRz2lI8/nyM7nj6cLzLIWjLz1YFbqfwiFy77N6Ml6AhRxtCyl63Bm2pAJeS4KiWQIrGK9HSFAj8RZd54+dHA3eg0CsIVrUZr+DcrIWgFMeu9Ja6ugvxUYcJZc9XDd4ffep9AvXJDrSaMXhe0g6hZEzmnZuPWiFvjUD90ppTAHvmfrb04fwypNZghqpP+6vxjTUYkbhZm4ZOgGeyiYMEy6V9rBlUaUkujVqX4CV4IOT5qizoBiZmlMMF20H8qX4KnjnLnu0cryYqC+FczZb3CWY0G4TUxpgw0GbL5bKhUZlEbJWcK3UFbAOG7Lrl0a9nbXuGvpLNk2uVWiWXDe57eHMz2wMNywHLogPLs8Fcdrpd24XG2Z4Ow7wRKrqgQqy9uXUwUwtDq3mDV5dnQ7msbV/dKWZDTU3zTjqXoefZcOUm2XRB09BtaDq9gPWfD8Lfnj0DzNJlaUT6UmlIhe5k8XpU9iZC2RDq4+XN6CCkerY9gcjIsiuc6pJh6Rdr0MlT0ldJ43DLbg60DlkykefuWgoFhUYNbiAdzGEX4k4aaZheK9Rsi00bY5/Isy0/Rkii57H4cDbTTtwTtn0SDW/Dwj+UzAnXPiHXszGVRy81eLffnAjX7qrmsmuPXANiyUB6ul25ThtGbPMeDveb72djY5qx5ZCWZgLk+mAmYA7ZUu2ERIDd1qNW/hVXrJ94kj3bBmlLWX4GeHYF9wNO/3A2HyCT6ekp8wbMDuketK2Pkd5sJgCTXSakO3u3n/TZoM53szBRZNiVd3uTeN2a6Bk1Hg5m+glpC42SiCvU4TPQGUjki6/BCWArE8pG5sTrs/l+spPGWUCeB3vmCekdTLXL4uEaISsw8qHwHui1pZBl8Btu++m26iOeex4bYAG2PTLUs+fhJZJOTeEwNVGBOql+WSKJzy6hLuABu0ji/m7oEjj1Ofe1kSmZD0R6rgRuQENOJ9/eJ6AKH9gFO+QkcDp+cG4gYswcCs67ef367FVP67XpdplTb4xcIbtoO/rD2RhphTqW9wOeY8QuBHZBKUGNuG6SGzY04iSwx4GnGvP1peZkgSRCF0jfyGMZ8qanZKl1MEa8iRGo4//edZVMhPY8sDrBYCKuW776toE887APjszJnDkRvEmGoL4QGOq5bVg8Z8ZQMbw0ieYn46/IBMypV1RgkOGbp9oHT/AMigqU58T0KPgHkhy55I64Ks+6iIN8G4SYJOzqGZVx44GJ8I3nv+rZI9/GCO6D9mYTeMZRyyhw5CcMQNx9lTkaYJm9xVytFkaeUfs6z5cDzbSV+8sUViNtX6vHeQ7iogCrw36ztm1yYwRkB5KhLlnw9V1uH0jbLI1uk77pKTtPvrhP7BbPF6e7wA8PjOcJRlMA2w/A878NXjjiGeONaYg3YJ3eJAmbVaujzvN6QBD892ywvJ405cI11yufN+mqbHT57MizcQY8N9d5roAf5tWLMDJt6UUtuLFKBi93tiDorQwQtb8CJI/n/+Pa99C4TqA89wHPAuUZ2Wr9soKBDOePzqaedx621Xlu2DNG3eA3r7QCz3Y6/P538Dz9gPa7ZoLly7wKPDsEN+U5QwtaVpHnZg555uv2TP3wwPhdkgw/p3VmYEUcBWQNni/XefYd9eGo86wCz1/B1O4GDx50Hs6+8kiUhrJyZjxbfuPGCC4h0B/Gr6hy0jZP0l/3OxHWnky+ze+C62i7fw88wzGeqQfgsDKajtcyb05NjMx56n7jGM+XKc90FYA3ktDbIM/Nx3mGpo892K8DeAamKM8c8uyB2TGwRHiL5+Q0zAh08go2gj231TriunCCZ/41z2R35ILVB2fxHAMdwMPtTY7HVMM/CTzznEKWkmBZZ8qz9r0rTzzk4Wye6Lhj+GbLsLnDhkiIh96uCGoyNZj3mhOhhVS7/TXPsKOViY98BysNq5m4kwLcsEQhN/senqn/1Mg9V9nthm3AZ/BHPAvmJqiCIvg3edYiwX1Lo7d5BlPUyBAM5LvZDNYhcuAEz5/V42eLZ23Y6sPX4BlcPnGnpy89BM+Dcl75KA3/AbGR8N9OFz9z7/AbhrrrWiy9yKaAgtyzUik9fduAAO8gHl+IqUggD+rZbhoY2uW9vMUzMiaDQzwoxWdh3WI1iMyhUXFxbsIWK70I197Ds0wSwYNS0ZVpt0NQcVB6hEF63Z45IC0D/aamGjyP1Hl2tKapRncDb/uNUBjlxcZAvCsVjxcrF8hrniET1PnlNc+GSvsoZhrxRqXyrLRgu6WRtp6NUjFcg3UBNMQHU2BI2VSptHq6QwaSBKOEYDd5ecou+KPhPUPybubClYMuQ1oq1sLhxZdOTt8pYOqRdf+mY9gDfrItCDGAty8GjIFxX5ElYxkabnRZIb/VqLKxauDHo6EM8By6jUs6C179S1ieVqtGNQxuk+FwWaP2HH4EK5SXjEIO+n3qNIemu2ReS6bAP3sTMCcNjUQ1kZkCf9t2X+WlgfQ62HM+ugDyIGqQjCcL4XDl6aq5HL5ydMO3U8iGyySRQZ43w6Oy5PkZamWe69Q4umvry6DOvCoo3UXoYLTtKumFRPhgxslpUJQZO+VhToDY6x94B0VQH5OuNrgto8sOaZMCjRRlkBC8F1ZpsKsS6iVONKwPiTay0w/DhG5MQu++YbVLjVYO3qqGd/GYSzw8BoV6/QTAkoguhGDsAvU57NH+WiMBFOfBl/mwPfHxXMDtp90etQaPYL5WyuqEo62OD9dr7T3As9UjHSUhouoRdNIYFtY8Zfz8Jj5KCv+O1AfwliW8t9VbBcK7BfxmvK+nN/KRZ/XUnTD8ViDPgfN0nP4XhdS9sKExnn9/SJr2yc8aGBgYGP6LwDOf+RHQyane9eA50zp9OGtI5+zVkzOCHq10nOa8C+63M5dk68Gq8xPuVeo4ekVGWeqEm21R/FSBvxtOd88o+KPBDuMYTcI7Uu+UoH3xmcWz1P3gw49Bj2n2Dpm0VKy+dFhlaiI0KuN7Ph8U+SdAEi1TUBxgFKisIh5feVBsLe/6Jy5LpZ6FhSbybCX5erEo2o/EHq/OS0cNIaFdtHgWzKHUT/Sg+KgrgKDgc2zHcf2aT/RLUwIqi6Xk2itiVfNvPusSBtI/uP/Qd8B+FbrvsKVlzcNLcucaqbbMyDo5bOk0G55ACiy1tMwoAhfYgU8ic4LcsuqBeibOCBau3kN7lqBVy5jBSVstY1BzzUuLDF7ageqdLTMqMhroxq7w0MkDfZA6z8pSOvWgZcZBi2caZ0OO6oy61PJSpAqsejipuaXdAEEB5FfDLnx2nvP7qtiN4NzMrkMCy9BvOCeyZbg8ozd9zgLSzgI+R9v3SJPj80lMdLfBdeql5Qoko4DF24a6XIPPWJeof5OdT2Oy3cGpkWw4XIn3dBj08DMMjtofHbkDNUMdEfhbuW3oX4WeYg+xVYHTlqF6uKwK0g72kWlLIc9wU4wvT/3g9dKu1q33jgRPOr8MV4QqUHmk6b21DarCGEwIVaas2/3RGu02MFFzQad4HM0HLlYeL9fw8eDjUz9ePXPAkOO/rC2lR+Yck+Phyi9g04ngo63qYGqO8qzu2tZnqndmzHuu2MzW8mxsDHgObsxsJV1XPWYUMwsu4FlNBp+vHQ6G5rSoK/R0KzoYDD3aepLNjOlfuXqwuq3sNodd65jaNryJ4FPusGijPHMS+fLylMcIRKArkJanJ2uSJ12pzHfOqJFgGfQL3dZ6szbab1nzD8/G1lCQR6/GX3KHg6l2f2/2av19o8DF0AWzN3urfnlOAAsecM/1N2NyPPTYo/iH8e0OMuzaNvDVqIeznxNR0ZSBdGrKkMhQT4f2zWyMyMpk+n6gNZ2ag8xksENbgXERsgKDxVcwHOqybZsIZHeky/+VK08cOhn8nAxcu499pTP9vbOYB82tfdD95eX2ZmkHqjgUgu8tYKanrWfPJyoDg/j8aRIa9GYzqiyRtukrvra6oHY7PUSOhEedwLPHGhHy7B/O3vLy58k/S9rhnXi8aEOe7xKONyOuxaampgUbVVtfce278bM7+8rL0YdT5BsckTQAdHWP31XxiWGwgyzTVk3AadS1ZwjmcvCmwQVuUJ7LIIF8+znpzlawTvazdqzDC96+erzhRZ7171y3wHU3nm1x7jQ+EQIFclTw58DzukZff7g9OVgXdMlhVEvx+MK7eT5PNHNaxFVBWpHnvE/gAzcsxpo68DGLf9j2d8p3b7bs5ZHnvMUzBzyr3eN5GAzGdSRSbzWvIofccZ6DP9R5/s7iuWljbMJ22+B49WLqNc92/Z7FM8xsnef7Yzyn37NlaKOnAVQBeL4X3HvYELTqToL2DZ691oiQZyfy/OeR+hZ4fXg2f+Q38j5qzzet51pYXrdnHuw5rwrH7Jl7y573aCuvP+rqeA/PIIPW8dHnwgKvnrTn72evunmctfkjngUBFaCNPDDVr2BWLXv+vC5oiD4fB7/hP2nPlGceQ9XzYdQ8bGV7HnCxdXvGZ6XAhqiI9MVX8M/j4J9FvzjQlvqnoajUPzd4Rv98yVDq/jmmiopfk/3vt+eBtulLhkPRDJ36Z//k4JE9p+ZkZeDbzJQI0sA/YxxOeealgcFUv6Eomgg8Z8ZEpbVtusvXF7rgQUGB3dBNUKAtRO3Zp9DzkobfcDsEx+Ha+SCahyHHVo1I+IhnoTVhK89sVeP0kb2gJm3ra1tPXkKsEFszNmczqxBv7Nd5NodssVU5gi+NepMYDFTjo9pbPPc0eIY5zUB0UJh3evt65rWlRD3egEgMJGyZEzaI6ZZd+QC9SaI8Wy8MgOBCB8QbwfU1I+nKY7yRerkFgtQhW17tTrrCo+L1wVRXM71bRJ4VmJT25tVoNvbpr7ifDbSJrM2WahmnPLsxynInISeYu2QF+aSAV9tGIFqDz4MxWT/aBwMCxM82W+VfYYiffbRe5YKGfgP2wR7g2TzJs2BGay6of8uQWouQiEUqlj3r3WmXrewlEPXaQuUAfX0P4jrKM0dzbRXkubzgcoU2iJ0PRCHktoX3NZIMB22Z4cqobEaztuAexkjIs4zDCv4YBbs4F/YMnkFb6uzUjeqaQ67OOOgIta3Ozhm9HuPT8hlREvwyfOJb6s2d+M6a43BG4TmsujqAGY1WEk+vtjp1OyctdUp4m+nA4we8p/TLh52d+O63ZBx2zphQbCmhgOw1B6/hRyPqhQ4kSx3sWEe/USbQiv7fgN+ooiCMlrDTTkngnDgObGidI9FhyefFbyDoaYZip+cbFDzkiK/PbqSjcw16+IGHDgJtVs8UONFeT+KJglQ/1WicbVhnFPUdSVIaJxiQqFc61sfx8w1ecVgq8CjYboU81vlLQ5BwXI6gNI7oJLHRwdGQ/j+jMREfMBj+Xen3HAt++LSQt3g+0du5sdS/FPTeGn15jOF3Bn+enO1fGLwkMJoZGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYGBgYPh3n6ttlzhn8mva+r20++n3ND9Q52eD8fnHgnw2xWirhz7pZVyf+41ivPrD+OVx8UiqV8Kcw6NUb/9z8+l+jBbH6wPmGFIY61L5YqbjYJTokh+Rs5py6seV3CM4tU+a06gPN4DReoHUy7U7I2tINxeCcDvwjb2kOCfKaddEh1hsYzi3d4ef18/X9gecAat8tQpIbTVfcxTtN8VzHSq7poL1wUDyA9HL54ULTRoBX+7YJWdhbaLqdXMztdS8cLOxHFjc2c03lgeKzpmfxxQsvaIO95f3CQXyxayJXzM39Bb7F4OxgaqTvlsdczif3r+eilf7lWHdLZ3ovmX9Y+3EitlxOXp0sddnVvnJnZHGtNvpVamplsbBO+soX86Ta8q/KlcH/GU6R5H7brdbahaF8pJzIky8f5X5c+cfch35p9r8NxovFDuBZjeRXYkP54RhZzi8vPh/cQ9bnkOe+bY3InJrIxJ+9HMg9vpdRr+delEmhnNwnLw7uVK4s/G90kSR/KP59MvcYeU7eIsXnuZ+g+fn5nsY/HQK/tRUAvzFc6yALlR+jGbK83rbdavH8eCIWebWbnyxekalvce7kLn1X+Wk4U4iRNPDZmnu8EkKeM8BzW4PnxC2w54Ufh//xE+P5GAQ+UMg1LXZ41UiGDG+omxvDuYPCRmH+etNcdGNzf6CYK2u8ltw2OGmnqUuLNC2OdhcPiuXIPIksPivOF38c3iCFR4WOgaZ/3itvzhe2yYu9aC5eYfZ8EpLTUDTDsbQwbyhOQRH9hl8TRVly2hVRESVNhMBZ8tMfCnMKnCb6tWp8a2HfLXJ+0ak5nBClCPT7fSAGgQaizPmNwqPNzMf/xvdfHzxnFJ6aAobCwuvf5BaEN77nxyqW5ELT08Yvgr2uUP/pFPp1Sr3FppcG2wbfBVP7zbxI5q/9kqBOTvdrAgwfB8YxAwMDAwMDAwMDAwMDAwMDA8Pvi/8DzxVZ9bGQeWkAAAAASUVORK5CYII=">google</a></figcaption></figure><p>Dynamic Programming is a popular computer programming method which focuses on solving a given problem by solving its sub problems using the proper base conditions and memoization. There are various DP problems on the internet. Digit DP is one such technique. In this, the solution is made by playing with the digits. We consider numbers as strings and append all possible digits which can be there at any position and make new numbers this way. This can be understood with one such problem statement.</p><p><strong>PROBLEM STATEMENT :</strong></p><p>This problem statement has been taken from <a href="https://www.spoj.com/problems/CPCRC1C/">SPOJ</a>.</p><p>In this two numbers are given say a,b. The problem statement says to find the sum of the digits of the numbers between a and b.</p><p>Constraints : 0&lt;=a,b&lt;=10⁹</p><p><strong>FINDING SOLUTION FOR A GIVEN RANGE:</strong></p><p>We have to find the sum of the digits of the numbers between a and b. This can be further simplified if we just find the sum of the digits of the number between 0 to b and from this subtract the sum of the digits of the numbers from 0 to a.</p><p>This can be illustrated as if we have some function say solve1(int no) that returns the sum of the digit of the numbers between 0 and the given number then the solution to the given problem statement can be shown as : — solve1(b)-solve1(a-1) .</p><p><strong>STATES OF THE DP PROBLEM AND SOLUTION:</strong></p><p>Digit DP is a technique in which we try to form the valid numbers according to the given problem statement. Now suppose if the range given is 0 to 5445. Thus according to our approach we first will be finding the numbers which are between 0 and 5445. This requires the formation of the numbers which are less than 5445. Now suppose the number that has been formed till the position 3 is 544_. The last blank can be filled with the digits 0,1,2,3,4,5 and not 6,7,8,9 otherwise the formed number will become more than the given number 5445. Thus one of the important states is pos — position of the next digit. As seen from the above approach it is important to check whether the number formed is in the given range or not. For this we can have a flag associated with it say f. This flag will help us in the following way : -</p><p>f=0 would mean that there are constraints on the digit that has to be inserted.</p><p>f=1 would mean that any digit can be chosen for the next position.</p><p>The last state that we would require to store is the sum till the given position and for the given flag.</p><p>Thus the main function that would given the sum of the digits of the number is : -</p><pre>int a,b;<br>long long int DP[12][180][2];<br>vector&lt;int&gt; num;<br>long long int solve(int pos,int sum,int f){<br>if(pos==num.size()){<br>  return sum;<br>}<br>if (DP[pos][sum][f]!=-1) return DP[pos][sum][f];<br>long long int res=0;<br>int lmt;<br>if(f==0){<br>  lmt=num[pos];<br>}<br>else lmt=9;<br>for(int dgt=0;dgt&lt;=lmt;dgt++){<br>   int nf=f;<br>   if(f==0 &amp;&amp; dgt&lt;lmt) nf=1;<br>   res+=solve(pos+1,sum+dgt,nf);<br>}<br>return DP[pos][sum][f]=res;<br>}</pre><p>In this DP[pos][sum][f] stores the answer for the given position, sum and state. If the DP[pos][sum][f] is not -1 i.e it stores the already computed value then it simply returns that value. Next we have checked what is the value of our flag f. If the value of our flag is 0 then we have to check what is the maximum digit that can be placed in that position. Like earlier example that we had taken we had seen the 544_ . The digits that can be filled here are 0,1,2,3,4,5. Thus the limit (lmt-variable name here) is the digit that is present in the original number at the given position. If f=1 then we can clearly choose any digit between 0 and 9 for the given position . Like for example the number that we have formed is 543_. Thus the last blank can be filled with the digits between 0 and 9. The next part consists of the recurrence for the next position and the sum and the new flag which is modified according to the condition.</p><p>This value is then stored in the DP[pos][sum][f].</p><p>The other solve1(int no) function can then help us in finding the sum for different numbers. For this the code would be :-</p><pre>long long int solve1(int no){<br> num.clear();<br> while(no!=0){<br>  num.push_back(no%10);<br>  no/=10;<br> }<br> memset(DP,-1,sizeof(DP));<br> reverse(num.begin(),num.end());<br> long long int result=solve(0,0,0);<br> return result;<br>}                          }</pre><p>The time complexity of above approach would be O(10*pos*sum*f). Here pos can take log(n) values, sum can take 10*log(n) values, flag can take 2 values. Thus the total time complexity is O((log(n))²).</p><p>We can also try finding the sum between the given range a,b together by introducing the second flag that checks for the number to be greater than a.</p><p>The entire solution is present in this <a href="https://github.com/sim017/SPOJ_SUM_OF_DIGITS/blob/master/spoj_sum_of_digits.cpp">link</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=40f0e6c9a77d" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>