Reply to thread

Message

<blockquote data-quote="madurax86" data-source="post: 4064594" data-attributes="member: 1293">Full code is below its not optimized for speed if you can post the optimizations that can be implemented, heres a <a href="http://1.bp.blogspot.com/_793N2ay-vhU/Sag6kAeuPDI/AAAAAAAAABQ/S7g3On38O8s/s1600/lol.JPG" target="_blank">LOL</a> that i came across when i was coding this last night.Any Problems comments are welcome; there are a lot of C programmers in EK if you can translate this to C <img src="/styles/default/xenforo/smilies/default/happy.gif"&nbsp; class="smilie" loading="lazy" alt=":)" title="Happy&nbsp; &nbsp; :)" data-shortname=":)" /> there are very few changes to be made ryt?[CODE]/*factorial and nCr functions(not optimized)==========================================by madura.x86comment: If you are getting minus values for a given nCr its because &quot;long long&quot;type isnt enough try raising it to double, nothing wrong with the engine the values get awfully longer when n goes just after 51, have fun with it but dont just copy give credit where credit is due.*/#include &lt;cstdlib&gt;#include &lt;iostream&gt;using namespace std;double fact(double i){&nbsp; &nbsp; &nbsp; &nbsp; double j,k;&nbsp; &nbsp; &nbsp; &nbsp; k=1;&nbsp; &nbsp; &nbsp; &nbsp; for (j=1;j&lt;=i;j++) k=k*j;&nbsp; &nbsp; &nbsp; &nbsp; return k;&nbsp; &nbsp; }long long nCr(int n, int r){&nbsp; &nbsp; int j,i,k,m1,n1;&nbsp; &nbsp; long long p,q;&nbsp; &nbsp; long long x[128],y[128];&nbsp; &nbsp; if (r&gt;n) return 0;&nbsp; &nbsp; if (r==n) return 1;&nbsp; &nbsp; if (r==0) return 1;&nbsp; &nbsp; if (n&lt;=2*r){&nbsp; &nbsp; &nbsp; &nbsp; k=0;&nbsp; &nbsp; &nbsp; &nbsp; for (j=n-r+1;j&lt;=n;j++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x[k]=j;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; m1=k;&nbsp; &nbsp; &nbsp; &nbsp; k=0;&nbsp; &nbsp; &nbsp; &nbsp; for (i=2;i&lt;=r;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[k]=i;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; n1=k;&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; else&nbsp; &nbsp; &nbsp; &nbsp; {&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k=0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (j=r+1;j&lt;=n;j++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x[k]=j;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; m1=k;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k=0;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (i=2;i&lt;=n-r;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; k++;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[k]=i;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; n1=k;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (j=1;j&lt;=m1;j++)&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (i=1;i&lt;=n1;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (x[j]%y[i]==0){ &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x[j]=x[j]/y[i];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[i]=1;}&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (y[i]%x[j]==0){ &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; y[i]=y[i]/x[j];&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x[j]=1;}&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; p=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; q=1;&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (j=1;j&lt;=m1;j++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (x[j]!=1) p=p*x[j];}&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; for (j=1;j&lt;=n1;j++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; if (y[j]!=1) q=q*y[j];&nbsp; &nbsp; &nbsp; &nbsp; }&nbsp; &nbsp; return p/q;}int main(int argc, char *argv[]){&nbsp; &nbsp; int i,j;&nbsp; &nbsp; j=51;&nbsp; &nbsp; for (i=0;i&lt;j+1;i++){&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; cout&lt;&lt;j&lt;&lt;&quot;C&quot;&lt;&lt;i&lt;&lt;&quot; = &quot;&lt;&lt;nCr(j,i)&lt;&lt;endl;&nbsp; &nbsp; }&nbsp; &nbsp; &nbsp; &nbsp; system(&quot;PAUSE&quot;);&nbsp; &nbsp; return EXIT_SUCCESS;}[/CODE]</blockquote>

[QUOTE="madurax86, post: 4064594, member: 1293"] Full code is below its not optimized for speed if you can post the optimizations that can be implemented, heres a [URL="http://1.bp.blogspot.com/_793N2ay-vhU/Sag6kAeuPDI/AAAAAAAAABQ/S7g3On38O8s/s1600/lol.JPG"][B]LOL[/B][/URL] that i came across when i was coding this last night. Any Problems comments are welcome; there are a lot of C programmers in EK if you can translate this to C :) there are very few changes to be made ryt? [CODE] /* factorial and nCr functions(not optimized) ========================================== by madura.x86 comment: If you are getting minus values for a given nCr its because "long long" type isnt enough try raising it to double, nothing wrong with the engine the values get awfully longer when n goes just after 51, have fun with it but dont just copy give credit where credit is due. */ #include <cstdlib> #include <iostream> using namespace std; double fact(double i){ double j,k; k=1; for (j=1;j<=i;j++) k=k*j; return k; } long long nCr(int n, int r){ int j,i,k,m1,n1; long long p,q; long long x[128],y[128]; if (r>n) return 0; if (r==n) return 1; if (r==0) return 1; if (n<=2*r){ k=0; for (j=n-r+1;j<=n;j++){ k++; x[k]=j; } m1=k; k=0; for (i=2;i<=r;i++){ k++; y[k]=i; } n1=k; } else { k=0; for (j=r+1;j<=n;j++){ k++; x[k]=j; } m1=k; k=0; for (i=2;i<=n-r;i++){ k++; y[k]=i; } n1=k; } for (j=1;j<=m1;j++) for (i=1;i<=n1;i++){ if (x[j]%y[i]==0){ x[j]=x[j]/y[i]; y[i]=1;} if (y[i]%x[j]==0){ y[i]=y[i]/x[j]; x[j]=1;} } p=1; q=1; for (j=1;j<=m1;j++){ if (x[j]!=1) p=p*x[j];} for (j=1;j<=n1;j++){ if (y[j]!=1) q=q*y[j]; } return p/q; } int main(int argc, char *argv[]){ int i,j; j=51; for (i=0;i<j+1;i++){ cout<<j<<"C"<<i<<" = "<<nCr(j,i)<<endl; } system("PAUSE"); return EXIT_SUCCESS; } [/CODE] [/QUOTE]

Verification

Awruddata maasa keeyada?

Search

Latest ads

Reply to thread