C programming

Saturday, January 17, 2009

#include #include void lasagu() { long int sum=1; int a,m[20],n[20][20],count[20],i,j,p[20],l,k=0,prime[50],o=0,g[50]; n[0][0]=1; textcolor(RED); cprintf(" "); cprintf("\nHow many number you want to Enter:"); scanf("%d",&a); for(i=0;i { textcolor(RED); cprintf(" "); cprintf(" Element [%d]",i+1); scanf("%d",&m[i]); } prime[0]=2;prime[1]=3;prime[2]=5;prime[3]=7; j=4; for(i=2;i<100;i++) { if(i%2==0||i%3==0||i%5==0||i%7==0) continue; else { prime[j]=i; j++; } } for(i=0;i { n[i][0]=1; p[i]=m[i]; count[i]=0; k=1; while(m[i]!=1) { j=0; while(j<100) { if(m[i]%prime[j]==0) { n[i][k]=prime[j]; m[i]=m[i]/prime[j]; count[i]=count[i]+1; k++; j=100; } else j++; } } } // textcolor(RED); // cprintf(" "); for(i=0;i { // textcolor(GREEN); printf("\n "); printf("%d =",p[i]); for(j=0;j<=count[i];j++) { if(j==count[i]) printf("%d",n[i][j]); else printf("%d*",n[i][j]); } // cprintf(" "); } for(i=0;i { for(j=0;j<=count[i];j++) { for(k=i+1;k { l=0; while(l<=count[k]) { if(n[i][j]==1) { l++; continue; } else if(n[i][j]==n[k][l]) { n[k][l]=1; l=count[k]; } l++; } } g[o]=n[i][j]; o++; sum=sum*n[i][j]; } } // for(i=0;i // printf("%d*",g[o]); textcolor(RED); cprintf(" "); cprintf("\nL C D=%ld",sum); cprintf(" "); } void main() { int t=0;char ch; clrscr(); textcolor(GREEN); cprintf(" Welcome to the lasagu "); textcolor(RED); cprintf("\n\n \\****************\\ "); cprintf("\n\n MENU "); cprintf("\n Press L for lasagu : "); cprintf(" Press E for exit: "); while(t==0) { textcolor(GREEN); cprintf("\n Enter a number L or E:"); l: ch =getch(); switch(ch) { case'l': lasagu(); break; case'e': t=1; break; default: goto l; // break; } } }

0 comments:

Visitors

PlugIn.ws - Free Hit Counter, Web Site Statistics, Traffic Analysis

  © Blogger template Leaving by Ourblogtemplates.com 2008

Back to TOP