Join date : 01/01/1970
| Tiêu đề: [code 04 ] tưởng niệm Y_Y (đánh lô đề 0 chết ) Sun Jul 05, 2009 8:39 pm | |
| - Code:
-
#include<stdio.h> #include<conio.h> #include<string.h> /* void accept(char s[],char *ch); int count(char *ch,char s[]); void del(int k,char s[]); void trim(char s[]);
void main() { char s[100],ch; clrscr(); accept(s,&ch); count(&ch,s); trim(s); getch(); }
void accept(char s[],char *ch) { printf("\nInput string: "); fflush(stdin); gets(s); printf("\nInput charater: "); *ch=getchar();
}
int count(char *ch,char s[]) { int i,dai,dem=0; dai=strlen(s);
for(i=0;i<dai;i++) { if(s[i]==*ch) dem++; } printf("\nNumber of %c is: %d",*ch,dem); return dem; } void del(int k,char s[]) { int i,dai; dai=strlen(s); for(i=k;i<dai;i++) { s[i]=s[i+1]; } dai=dai-1;
} void trim(char s[100]) {
printf("\nString after trim: ");
while(s[0]==' ')
{ del(0,s);
}
puts(s); } */ #include<stdlib.h> #include<math.h>
void input(int *n,int a[]); int max_(int n,int a[]); int sumodd(int n ,int a[]); int uscln(int a,int b); int commondivi(int n,int a[]); void menu(void);
void main() { int n,a[100]; char ch; do{ clrscr(); menu(); printf("\nChoice: "); ch=getchar(); switch(ch) { case '1': input(&n,a); getch(); break; case '2': if(max_(n,a)!=0) printf("\nso am lon nhat la: %d",max_(n,a)); else printf("0"); getch(); break; case '3': if(sumodd(n,a)!=0) printf("\ntong cac so le la %d",sumodd(n,a)); else printf("0"); getch(); break; case '4': printf("\nGreatest common divisor of all array is: %d",commondivi(n,a)); getch(); break; case '5': exit(0); }
}while(ch!=5); } void input(int *n,int a[]) { int i; do{ printf("\nInput N: "); scanf("%d",n); }while(*n<=0||*n>=100); for(i=0;i<*n;i++) { printf("\Input a[%d]= ",i); scanf("%d",&a[i]); } } int max_(int n,int a[]) { int maxx,i,j; for(i=0;i<n;i++) { if(a[i]<0) { maxx=a[i]; break; }
} if(i==n)
return (0);
else { for(j=0;j<n;j++) { if(a[j]<0) { if(maxx<a[j]) maxx=a[j]; } }
return (maxx); } } int sumodd(int n,int a[]) { int i,sum=0,dem=0;
for(i=0;i<n;i++) { if(a[i]%2!=0) { sum=sum+a[i]; dem++; } } if(dem==0) return(0); else return (sum);
} int uscln(int a,int b) { int i,uocc=1,min; if(a>b) min=b; else min=a; for(i=1;i<=min;i++) { if(a%i==0&&b%i==0&&i>uocc) uocc=i; } if(a==0) return b; if(b==0) return a; return uocc; } int commondivi(int n,int a[]) { int i,uoc; uoc=uscln(abs(a[0]),abs(a[1])); for(i=0;i<n;i++) { uoc=uscln(uoc,abs(a[i])); } return uoc; } void menu(void) { printf("\n1. Input N and array of integer"); printf("\n2. Find the largest even negavite number value"); printf("\n3. calculate total of the ODD numbers"); printf("\n4. Calculate greatset common divisor of all array member"); printf("\n5. Exit"); }
| |
|