}
}
digit[i]='\\0';
printf(\ digit=%s\\n\
3. дʵַ֣Ĵ #include <> #include <>
int StringLength(char *s) { int k; for(k=0;*s++;k++); return k; }
void main() {
char string[81]; printf(\ gets(string); printf(\}
4. дʵ֣һַеĸȫתΪд #include <> #include <>
char *Upper(char *s) {
char *ps; ps=s; while(*ps) {
if(*ps>='a' && *ps<='z') *ps=*ps-32; ps++; } return s; }
void main() {
char string[81]; printf(\ gets(string); printf(\ printf(\}
5. дʵ֣һַһַгֵĴ
#include <> #include <>
int Occur(char *s, char c) { int k=0; while(*s) { if(*s==c) k++; s++; } return k; }
void main() {
char string[81],c; printf(\ gets(string); printf(\ c=getchar();
printf(\c,Occur(string,c),string); }
6. дʵ֣жһַǷijַг֡ #include <> #include <>
int IsSubstring(char *str,char *substr) {
int i,j,k,num=0; for(i=0;str[i]!='\\0' && num==0;i++) {
for(j=i,k=0;substr[k]==str[j];k++,j++) if(substr[k+1]=='\\0') { num=1; break; } } return num; }
void main() {
char string[81],sub[81]; printf(\ gets(string); printf(\ gets(sub);
}
printf(\ if(!IsSubstring(string,sub)) printf(\
printf(\
7. nΧһȦ˳źšûӼ뱨ʼλãӸ˿ʼ0ʼΪ3ıȦʣµǼ ѧ
8. һͶά飬СΪmnҪҳֵڵкУԼֵһmaxԪmain룬ںmax ѧ
9. nѧÿѧmſγ̣ҪһܼnѧĿγ̣ijһѧһŻһϿγ̲ѧĺ루ѧŴ0ʼȫγ̳ɼ ѧ
ϰʮһ һѡ
110: A A B D D B D D D C 1120: C B B C C
1___2______3_ _
2 struct node *next
3 struct link *head p->data p->next 4__ A _
1д #include <> struct Complex { double m_r,m_i; };
struct Complex sub(struct Complex c1,struct Complex c2) {
struct Complex c; = = return c; }
void main() {
struct Complex c1 ={,},c2={,}; struct Complex c; c=sub(c1,c2);
printf(c=%g+i%g\\n,,; }
2һꡢ¡յĽṹ塣һڣڱǵڼע⡣ #include <> struct ymd { int day; int month; int year; };
int dayof[13]={0,31,28,31,30,31,30,31,31,30,31,30,31}; int days(struct ymd *p) { int i,d; if(p->year%4==0&&p->year0!=0||p->year@0==0) dayof[2]=29; d=p->day; for(i=1;i
void main() { struct ymd date; int d; for(;;) { printf(\ scanf(\ if==0) break; d=days(&date); printf(\ } }
310ѧÿѧݰѧš3ſγ̵ijɼӼ10ѧݣҪ3ſγ̵ƽɼԼ߷ֵѧѧš3ſγ̳ɼƽ #include <> #define N 10 struct student {
char num[6];