Join date : 01/01/1970
| Tiêu đề: code 18 full option mời các bác vào xem , chém gió Tue Jun 23, 2009 4:27 pm | |
| EXAM1 - Code:
-
find and return maximum of three integer number. int max(int a,int b,int c); input integer N and array N integer element void input(int *n,int a[]); input integer N and check is prime (nguyen to) or not . int check(int *N); //(return 1 neu N la so nguyen to; return 0 neu N 0 la so nguyen to ) find the lagest strings have length equal maximum length N strings. void lagerst(int n ,char a[][100],char max[]);
EXAM2: - Accept a,b,c from user's input (a,b,c>0) - Print each common estimate( uoc so chung ) of a,b,c. - Print max of a,b,c - Code:
-
#include<stdio.h> #include<conio.h>
void accept(int *a,int *b,int *c); void estimate(int a,int b,int c); void max(int a,int b,int c);
void main() { int a,b,c; clrscr();
accept(&a,&b,&c); estimate(a,b,c); max(a,b,c); getch(); }
void accept(int *a,int *b,int *c) { do{ printf("\nInput a = "); scanf("%d",a); }while(*a<0); do{ printf("\nInput b = "); scanf("%d",b); }while(*b<0); do{ printf("\nInput c = "); scanf("%d",c); }while(*c<0);
}
void estimate(int a,int b,int c) { int min,i; if(a<b&&a<c) min=a; else if(b<c) min=b; else min=c; printf("common estimate of %d, %d, %d are ",a,b,c); printf("1"); for(i=2;i<=min;i++) {
if(a%i==0&&b%i==0&&c%i==0) printf(", %d",i); }
}
void max(int a,int b,int c) { int max; if(a>b&&a>c) max=a; else if(b>c) max=b; else max=c; printf("\nmaximum of %d, %d, %d is %d",a,b,c,max); }
EXAM3: 1. input N and N strings. 2. print N strings 3. convert the last strings. 4. find the symmetric strings. 5. exit. - Code:
-
#include<stdio.h> #include<conio.h> #include<string.h>
void input(int *n,char s[][100]); void print(int n,char s[][100]); void convert(int n,char s[][100]); void find(int n,char s[][100]); void menu(void);
void main() { int n; char s[20][100],ch; do{ menu(); fflush(stdin); ch=getchar(); switch (ch) { case '1': input(&n,s); getch(); break; case '2': print(n,s); getch(); break; case '3': convert(n,s); getch(); break; case '4': find(n,s); getch(); break; case '5': exit(0); } }while(ch);
}
void input(int *n,char s[][100]) { int i,j; do{ printf("\nN = "); scanf("%d",n); }while(*n>=20||*n<=0); for(i=0;i<*n;i++) { printf("\nstring %d:",i); fflush(stdin); gets(s[i]); } } void print(int n,char s[][100]) { int i; for(i=0;i<n;i++) { puts(s[i]) ; } }
void convert(int n,char s[][100]) { int i,dai; char temp; dai=strlen(s[n-1]); printf("\nThe last string is: "); puts(s[n-1]); for(i=0;i<=dai/2;i++) { temp=s[n-1][i]; s[n-1][i]=s[n-1][dai-i-1]; s[n-1][dai-1-i]=temp; } printf("\nConvert last string is: "); puts(s[n-1]);
} void find(int n,char s[][100]) { int i,j,dem=0,dai;
for(i=0;i<n;i++) { dai=strlen(s[i]);
for(j=0;j<dai;j++) { if(s[i][j]!=s[i][dai-1-j]) break;
} if(j==dai) dem++; } printf("\nNumber of symmetric string is %d, they are:\n",dem); for(i=0;i<n;i++) { dai=strlen(s[i]); for(j=0;j<dai;j++) { if(s[i][j]!=s[i][dai-1-j]) break; } if(j==dai) puts(s[i]); }
}
void menu(void) { clrscr(); printf("\n1. Input N and N strings."); printf("\n2. Print N strings."); printf("\n3. Convert the last strings."); printf("\n4. Find the symmetric string."); printf("\n5. Exit\n"); printf("Choice: "); }
| |
|
haph86 Gà mới lớn
Tổng số bài gửi : 40 Join date : 04/06/2009
| Tiêu đề: Re: code 18 full option mời các bác vào xem , chém gió Wed Jun 24, 2009 9:24 am | |
| ờ thì chém, làm chuẩn thế =)) | |
|