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"  class="smilie" loading="lazy" alt=":P" title=":P    :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"  class="smilie" loading="lazy" alt=":D" title="Big grin    :D" data-shortname=":D" /><img src="/styles/default/xenforo/smilies/default/D.gif"  class="smilie" loading="lazy" alt=":D" title="Big grin    :D" data-shortname=":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 intusing 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]</blockquote>

Verification: Hath warak paha keeyada? (hatha wadikireema paha)

Top Bottom

Search

Latest ads

Reply to thread