snipt

Ctrl+h for KB shortcuts
Notice: Snipt is moving away from free accounts on May 1st, 2014. Read more about the transition here.
#34958

C++

SOI - Cow Frisbee Team

/*
ID: jahanar1
PROG : fristeam
LANG : C++
*/
#include <iostream>
#include <fstream>
using namespace std;
int list[2000+1];
int main(){
        ifstream fin ("fristeam.in");
        ofstream fout ("fristeam.out");
	int n,f;
	fin>>n>>f;
	for(int i=0;i<n;i++){
		fin>>list[i];
		list[i]=list[i]%f;
	}
	int ans[f][n+1];
	for(int i=0;i<f;i++)
		for(int j=0;j<n+1;j++)
			ans[i][j]=0;
	ans[0][0]=1;
	for(int i=1;i<n+1;i++){
		for(int j=0;j<f;j++){
			ans[j][i]+=ans[j][i-1]%100000000;
			ans[(j+list[i-1])%f][i]+=ans[j][i-1]%100000000;
		}
	}
	fout<<(ans[0][n]%100000000)-1<<endl;
	return 0;
}
https://snipt.net/embed/0293582e9df437601a7e3d85032e7cfb/
https://snipt.net/raw/0293582e9df437601a7e3d85032e7cfb/
0293582e9df437601a7e3d85032e7cfb
cpp
C++
33
2014-04-23T10:22:03
True
False
Oct 25, 2012 at 01:02 AM
/api/public/snipt/34958/
soi-cow-frisbee-team
<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></pre></div></td><td class="code"><div class="highlight"><pre><span id="L-1"><a name="L-1"></a><span class="cm">/*</span> </span><span id="L-2"><a name="L-2"></a><span class="cm">ID: jahanar1</span> </span><span id="L-3"><a name="L-3"></a><span class="cm">PROG : fristeam</span> </span><span id="L-4"><a name="L-4"></a><span class="cm">LANG : C++</span> </span><span id="L-5"><a name="L-5"></a><span class="cm">*/</span> </span><span id="L-6"><a name="L-6"></a><span class="cp">#include &lt;iostream&gt;</span> </span><span id="L-7"><a name="L-7"></a><span class="cp">#include &lt;fstream&gt;</span> </span><span id="L-8"><a name="L-8"></a><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span> </span><span id="L-9"><a name="L-9"></a><span class="kt">int</span> <span class="n">list</span><span class="p">[</span><span class="mi">2000</span><span class="o">+</span><span class="mi">1</span><span class="p">];</span> </span><span id="L-10"><a name="L-10"></a><span class="kt">int</span> <span class="nf">main</span><span class="p">(){</span> </span><span id="L-11"><a name="L-11"></a> <span class="n">ifstream</span> <span class="n">fin</span> <span class="p">(</span><span class="s">&quot;fristeam.in&quot;</span><span class="p">);</span> </span><span id="L-12"><a name="L-12"></a> <span class="n">ofstream</span> <span class="n">fout</span> <span class="p">(</span><span class="s">&quot;fristeam.out&quot;</span><span class="p">);</span> </span><span id="L-13"><a name="L-13"></a> <span class="kt">int</span> <span class="n">n</span><span class="p">,</span><span class="n">f</span><span class="p">;</span> </span><span id="L-14"><a name="L-14"></a> <span class="n">fin</span><span class="o">&gt;&gt;</span><span class="n">n</span><span class="o">&gt;&gt;</span><span class="n">f</span><span class="p">;</span> </span><span id="L-15"><a name="L-15"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</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-16"><a name="L-16"></a> <span class="n">fin</span><span class="o">&gt;&gt;</span><span class="n">list</span><span class="p">[</span><span class="n">i</span><span class="p">];</span> </span><span id="L-17"><a name="L-17"></a> <span class="n">list</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">list</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">%</span><span class="n">f</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="kt">int</span> <span class="n">ans</span><span class="p">[</span><span class="n">f</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-20"><a name="L-20"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</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">f</span><span class="p">;</span><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">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</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">j</span><span class="o">++</span><span class="p">)</span> </span><span id="L-22"><a name="L-22"></a> <span class="n">ans</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="o">=</span><span class="mi">0</span><span class="p">;</span> </span><span id="L-23"><a name="L-23"></a> <span class="n">ans</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span> </span><span id="L-24"><a name="L-24"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</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-25"><a name="L-25"></a> <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;</span><span class="n">f</span><span class="p">;</span><span class="n">j</span><span class="o">++</span><span class="p">){</span> </span><span id="L-26"><a name="L-26"></a> <span class="n">ans</span><span class="p">[</span><span class="n">j</span><span class="p">][</span><span class="n">i</span><span class="p">]</span><span class="o">+=</span><span class="n">ans</span><span class="p">[</span><span class="n">j</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="mi">100000000</span><span class="p">;</span> </span><span id="L-27"><a name="L-27"></a> <span class="n">ans</span><span class="p">[(</span><span class="n">j</span><span class="o">+</span><span class="n">list</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">f</span><span class="p">][</span><span class="n">i</span><span class="p">]</span><span class="o">+=</span><span class="n">ans</span><span class="p">[</span><span class="n">j</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="mi">100000000</span><span class="p">;</span> </span><span id="L-28"><a name="L-28"></a> <span class="p">}</span> </span><span id="L-29"><a name="L-29"></a> <span class="p">}</span> </span><span id="L-30"><a name="L-30"></a> <span class="n">fout</span><span class="o">&lt;&lt;</span><span class="p">(</span><span class="n">ans</span><span class="p">[</span><span class="mi">0</span><span class="p">][</span><span class="n">n</span><span class="p">]</span><span class="o">%</span><span class="mi">100000000</span><span class="p">)</span><span class="o">-</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">endl</span><span class="p">;</span> </span><span id="L-31"><a name="L-31"></a> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span> </span><span id="L-32"><a name="L-32"></a><span class="p">}</span> </span></pre></div> </td></tr></table>
USACO