.


:




:

































 

 

 

 


5. , .




/*letcount.c*/main() { char name[20], letter; int number, start; puts(" \n"); gets(name); printf(" "); letter = getchar(); countlet(name, letter, &number, &start); printf("\n %c %s %d \n", letter, name, number); printf(" %d ", start); }countlet(ndplume, alpha, count, first)char ndplume[], alpha;int *count, *first; { int index, flag; *count = 0; index = 0; flag = 0; *first = 0; while (ndplume[index!= '\0') { if (ndplume[index] == alpha) { *count = *count+1; if (flag == 0) { *first = index+1; flag = 1; } } index++; } }

countlet() : , count start, .

: number *count, start *first (. 12).


. 12.


. 13.

, while:

while (ndplum[index]!= '\0')

, . , , .

while , if (.13). if , , . , , , :

*count = *count + 1;

, , , . number, number 1, , main(). ,

*count++;

, , *.

if flag. , . *first , . , , 1 ( ). flag 1, .

if , . , index++; if, , while, . - , .

countlet() main(), , , , .

, return. number start . , .

, number start . main(), countlet() , . , .

.

 

 
1. ? 2. ? 3. ? 4. ? 5. ? 6. ? 7. float *num, num *num? 8. ? 9. ?

 

 
1. , float main() , , . 2. , : main() { struct CD { char description[40]; char category[12]; char name[20]; float cost; int number; } disc; puts(" "); printf(" : "); gets(name); printf(" : "); gets(description); printf(" : "); gets(category); printf(" : "); scanf("%f", &cost); printf(" : "); scanf("%d", &number); puts(" : "); printf(": %s\n", name); printf(": %s\n", description); printf(": %s\n", category); printf(": %6.2f\n", cost); printf(" /: %d\n", number); }

 





:


: 2017-03-12; !; : 337 |


:

:

, ,
==> ...

1644 - | 1636 -


© 2015-2024 lektsii.org - -

: 0.008 .