snipt

Ctrl+h for KB shortcuts
#15820

C++

Euler 20

#include<iostream.h>
#include<fstream.h>
unsigned long long x[10000]={1};
unsigned long long times(unsigned long long sec,unsigned long long n)
{
     unsigned long long r,p,i,j,t;
     x[n]=x[n+1]=0;
     for(i=0;i<n;i++)
     {
             x[i]*=sec;
     }
     for(i=0;i<n+1;i++)
     {
                        r=x[i]%10;
                        p=x[i]/10;
                        x[i]=r;
                        x[i+1]+=p;
     }
     if(x[n]!=0)
        i++;
     if(x[n+1]!=0)
        i++;
     return i;
}
int main()
{
    ofstream write("20.txt");
    unsigned long long s=0,i,n=1;
    for(i=2;i<100;i++)
       n=times(i,n);
    for(i=0;i<n;i++)
       s+=x[i];
    write<<s;
    return 0;
}
https://snipt.net/embed/76fb569d0e600050b38dacccd9c65f2c/
https://snipt.net/raw/76fb569d0e600050b38dacccd9c65f2c/
76fb569d0e600050b38dacccd9c65f2c
cpp
C++
35
2014-04-17T14:42:46
True
False
/api/public/snipt/15820/
euler-20
<table class="highlighttable"><tr><td class="linenos"><div class="linenodiv"><pre><a href="#L-1"> 1</a> <a href="#L-2"> 2</a> <a href="#L-3"> 3</a> <a href="#L-4"> 4</a> <a href="#L-5"> 5</a> <a href="#L-6"> 6</a> <a href="#L-7"> 7</a> <a href="#L-8"> 8</a> <a href="#L-9"> 9</a> <a href="#L-10">10</a> <a href="#L-11">11</a> <a href="#L-12">12</a> <a href="#L-13">13</a> <a href="#L-14">14</a> <a href="#L-15">15</a> <a href="#L-16">16</a> <a href="#L-17">17</a> <a href="#L-18">18</a> <a href="#L-19">19</a> <a href="#L-20">20</a> <a href="#L-21">21</a> <a href="#L-22">22</a> <a href="#L-23">23</a> <a href="#L-24">24</a> <a href="#L-25">25</a> <a href="#L-26">26</a> <a href="#L-27">27</a> <a href="#L-28">28</a> <a href="#L-29">29</a> <a href="#L-30">30</a> <a href="#L-31">31</a> <a href="#L-32">32</a> <a href="#L-33">33</a> <a href="#L-34">34</a> <a href="#L-35">35</a></pre></div></td><td class="code"><div class="highlight"><pre><span id="L-1"><a name="L-1"></a><span class="cp">#include&lt;iostream.h&gt;</span> </span><span id="L-2"><a name="L-2"></a><span class="cp">#include&lt;fstream.h&gt;</span> </span><span id="L-3"><a name="L-3"></a><span class="kt">unsigned</span> <span class="kt">long</span> <span class="kt">long</span> <span class="n">x</span><span class="p">[</span><span class="mi">10000</span><span class="p">]</span><span class="o">=</span><span class="p">{</span><span class="mi">1</span><span class="p">};</span> </span><span id="L-4"><a name="L-4"></a><span class="kt">unsigned</span> <span class="kt">long</span> <span class="kt">long</span> <span class="nf">times</span><span class="p">(</span><span class="kt">unsigned</span> <span class="kt">long</span> <span class="kt">long</span> <span class="n">sec</span><span class="p">,</span><span class="kt">unsigned</span> <span class="kt">long</span> <span class="kt">long</span> <span class="n">n</span><span class="p">)</span> </span><span id="L-5"><a name="L-5"></a><span class="p">{</span> </span><span id="L-6"><a name="L-6"></a> <span class="kt">unsigned</span> <span class="kt">long</span> <span class="kt">long</span> <span class="n">r</span><span class="p">,</span><span class="n">p</span><span class="p">,</span><span class="n">i</span><span class="p">,</span><span class="n">j</span><span class="p">,</span><span class="n">t</span><span class="p">;</span> </span><span id="L-7"><a name="L-7"></a> <span class="n">x</span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="o">=</span><span class="n">x</span><span class="p">[</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span> </span><span id="L-8"><a name="L-8"></a> <span class="k">for</span><span class="p">(</span><span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span> </span><span id="L-9"><a name="L-9"></a> <span class="p">{</span> </span><span id="L-10"><a name="L-10"></a> <span class="n">x</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*=</span><span class="n">sec</span><span class="p">;</span> </span><span id="L-11"><a name="L-11"></a> <span class="p">}</span> </span><span id="L-12"><a name="L-12"></a> <span class="k">for</span><span class="p">(</span><span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span> </span><span id="L-13"><a name="L-13"></a> <span class="p">{</span> </span><span id="L-14"><a name="L-14"></a> <span class="n">r</span><span class="o">=</span><span class="n">x</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">%</span><span class="mi">10</span><span class="p">;</span> </span><span id="L-15"><a name="L-15"></a> <span class="n">p</span><span class="o">=</span><span class="n">x</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">/</span><span class="mi">10</span><span class="p">;</span> </span><span id="L-16"><a name="L-16"></a> <span class="n">x</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">r</span><span class="p">;</span> </span><span id="L-17"><a name="L-17"></a> <span class="n">x</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span><span class="o">+=</span><span class="n">p</span><span class="p">;</span> </span><span id="L-18"><a name="L-18"></a> <span class="p">}</span> </span><span id="L-19"><a name="L-19"></a> <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="o">!=</span><span class="mi">0</span><span class="p">)</span> </span><span id="L-20"><a name="L-20"></a> <span class="n">i</span><span class="o">++</span><span class="p">;</span> </span><span id="L-21"><a name="L-21"></a> <span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="p">[</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span><span class="o">!=</span><span class="mi">0</span><span class="p">)</span> </span><span id="L-22"><a name="L-22"></a> <span class="n">i</span><span class="o">++</span><span class="p">;</span> </span><span id="L-23"><a name="L-23"></a> <span class="k">return</span> <span class="n">i</span><span class="p">;</span> </span><span id="L-24"><a name="L-24"></a><span class="p">}</span> </span><span id="L-25"><a name="L-25"></a><span class="kt">int</span> <span class="nf">main</span><span class="p">()</span> </span><span id="L-26"><a name="L-26"></a><span class="p">{</span> </span><span id="L-27"><a name="L-27"></a> <span class="n">ofstream</span> <span class="n">write</span><span class="p">(</span><span class="s">&quot;20.txt&quot;</span><span class="p">);</span> </span><span id="L-28"><a name="L-28"></a> <span class="kt">unsigned</span> <span class="kt">long</span> <span class="kt">long</span> <span class="n">s</span><span class="o">=</span><span class="mi">0</span><span class="p">,</span><span class="n">i</span><span class="p">,</span><span class="n">n</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-29"><a name="L-29"></a> <span class="k">for</span><span class="p">(</span><span class="n">i</span><span class="o">=</span><span class="mi">2</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="mi">100</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span> </span><span id="L-30"><a name="L-30"></a> <span class="n">n</span><span class="o">=</span><span class="n">times</span><span class="p">(</span><span class="n">i</span><span class="p">,</span><span class="n">n</span><span class="p">);</span> </span><span id="L-31"><a name="L-31"></a> <span class="k">for</span><span class="p">(</span><span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span> </span><span id="L-32"><a name="L-32"></a> <span class="n">s</span><span class="o">+=</span><span class="n">x</span><span class="p">[</span><span class="n">i</span><span class="p">];</span> </span><span id="L-33"><a name="L-33"></a> <span class="n">write</span><span class="o">&lt;&lt;</span><span class="n">s</span><span class="p">;</span> </span><span id="L-34"><a name="L-34"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-35"><a name="L-35"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
c++, euler