Reply to thread

Message

<blockquote data-quote="madurax86" data-source="post: 8062527" data-attributes="member: 1293">this can be done thru binomial theorem <img src="/styles/default/xenforo/smilies/default/P.gif"&nbsp; class="smilie" loading="lazy" alt=":P" title=":P&nbsp; &nbsp; :P" data-shortname=":P" /> but it uses more resources and it is slow for this usage. Thus I use some nifty algorithm workaround with some c++ STL. This is C++, so use an appropriate compiler; I recommend g++. <img src="/styles/default/xenforo/smilies/default/D.gif"&nbsp; class="smilie" loading="lazy" alt=":D" title="Big grin&nbsp; &nbsp; :D" data-shortname=":D" /><img src="/styles/default/xenforo/smilies/default/D.gif"&nbsp; class="smilie" loading="lazy" alt=":D" title="Big grin&nbsp; &nbsp; :D" data-shortname=":D" /> and oh it prints the triangle for 500 lines in a few seconds, do stress test this one.[code]#include &lt;iostream&gt;#include &lt;vector&gt;#define TYPE unsigned long intusing namespace std;void pas(int n){&nbsp; &nbsp; if (n&gt;=1) cout&lt;&lt;&quot;1\n&quot;; else return;&nbsp; &nbsp; if (n&gt;=2) cout&lt;&lt;&quot;1 1\n&quot;;&nbsp; &nbsp; &nbsp; &nbsp; vector&lt;TYPE&gt; *pv=new vector&lt;TYPE&gt;;&nbsp; &nbsp; vector&lt;TYPE&gt; *pvw;&nbsp; &nbsp; vector&lt;TYPE&gt;::iterator iter;&nbsp; &nbsp; &nbsp; &nbsp; TYPE i, tot;&nbsp; &nbsp; &nbsp; &nbsp; pv-&gt;push_back(1);&nbsp; &nbsp; pv-&gt;push_back(1);&nbsp; &nbsp; while (n&gt;2){&nbsp; &nbsp; &nbsp; &nbsp; pvw = new vector&lt;TYPE&gt;;&nbsp; &nbsp; &nbsp; &nbsp; pvw-&gt;push_back(1);&nbsp; &nbsp; &nbsp; &nbsp; iter=pv-&gt;begin();&nbsp; &nbsp; &nbsp; &nbsp; i = *iter;&nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;&quot;1 &quot;;&nbsp; &nbsp; &nbsp; &nbsp; for (iter++; iter!=pv-&gt;end(); iter++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; tot = i + *iter;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; i = *iter;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; pvw-&gt;push_back(tot);&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;tot&lt;&lt;&quot; &quot;;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; pvw-&gt;push_back(1);&nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;&quot;1\n&quot;;&nbsp; &nbsp; &nbsp; &nbsp; delete pv;&nbsp; &nbsp; &nbsp; &nbsp; pv = pvw;&nbsp; &nbsp; &nbsp; &nbsp; n--;&nbsp; &nbsp; }}int main(){&nbsp;&nbsp; int inp;&nbsp; &nbsp; cout&lt;&lt;&quot;How many levels of the pascal triangle do you want? &quot;;&nbsp; &nbsp; cin&gt;&gt;inp;&nbsp; &nbsp; pas(inp);&nbsp; &nbsp; return 0;}[/code]</blockquote>

[QUOTE="madurax86, post: 8062527, member: 1293"] this can be done thru binomial theorem :P but it uses more resources and it is slow for this usage. Thus I use some nifty algorithm workaround with some c++ STL. This is C++, so use an appropriate compiler; I recommend g++. :D:D and oh it prints the triangle for 500 lines in a few seconds, do stress test this one. [code] #include <iostream> #include <vector> #define TYPE unsigned long int using namespace std; void pas(int n) { if (n>=1) cout<<"1\n"; else return; if (n>=2) cout<<"1 1\n"; vector<TYPE> *pv=new vector<TYPE>; vector<TYPE> *pvw; vector<TYPE>::iterator iter; TYPE i, tot; pv->push_back(1); pv->push_back(1); while (n>2){ pvw = new vector<TYPE>; pvw->push_back(1); iter=pv->begin(); i = *iter; cout<<"1 "; for (iter++; iter!=pv->end(); iter++){ tot = i + *iter; i = *iter; pvw->push_back(tot); cout<<tot<<" "; } pvw->push_back(1); cout<<"1\n"; delete pv; pv = pvw; n--; } } int main() { int inp; cout<<"How many levels of the pascal triangle do you want? "; cin>>inp; pas(inp); return 0; } [/code] [/QUOTE]

Verification

Hath warak paha keeyada? (hatha wadikireema paha)

Search

Latest ads

Reply to thread