Основы языка программирования C++ с применением объектно-ориентированного программирования. Чернышов М.К. - 60 стр.

UptoLike

Составители: 

6. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɪɚɡɞɟɥɟɧɢɹ ɬɟɤɫɬɚ, ɡɚɞɚɧɧɨɝɨ ɫɬɪɨɤɨɣ ɥɢɬɟɪ, ɧɚ
ɨɬɞɟɥɶɧɵɟ ɫɥɨɜɚ ɢ ɩɨɞɫɱɟɬɚ ɱɢɫɥɚ ɫɥɨɜ. ɉɨɞ ɫɥɨɜɨɦ ɩɨɧɢɦɚɟɬɫɹ ɩɨɫɥɟɞɨ-
ɜɚɬɟɥɶɧɨɫɬɶ ɥɢɬɟɪ, ɨɬɥɢɱɧɵɯ ɨɬ ɩɪɨɛɟɥɚ, ɨɝɪɚɧɢɱɟɧɧɚɹ ɫɥɟɜɚ ɧɚɱɚɥɨɦ
ɫɬɪɨɤɢ, ɢɥɢ ɩɪɨɛɟɥɨɦ, ɢ ɫɩɪɚɜɚɩɪɨɛɟɥɨɦ, ɡɧɚɤɨɦ ɩɪɟɩɢɧɚɧɢɹ ɢɥɢ ɤɨɧ-
ɰɨɦ ɫɬɪɨɤɢ.
int kwords(char* ss, char* sm, int kmax);
ss
ɢɫɯɨɞɧɚɹ ɫɬɪɨɤɚ, smɦɚɫɫɢɜ ɫɬɪɨɤ ɞɥɢɧɨɣ ɞɨ 30 ɥɢɬɟɪ ɤɚɠɞɚɹ (ɞɥɹ
ɪɚɡɦɟɳɟɧɢɹ ɜɵɞɟɥɟɧɧɵɯ ɫɥɨɜ),
kmaxɦɚɤɫɢɦɚɥɶɧɨɟ ɤɨɥɢɱɟɫɬɜɨ ɜɵɞɟɥɟɧ-
ɧɵɯ ɫɥɨɜ.
ɉɪɟɞɭɫɦɨɬɪɟɬɶ ɫɢɝɧɚɥɢɡɚɰɢɸ ɨ ɫɥɭɱɚɹɯ, ɤɨɝɞɚ ɮɭɧɤɰɢɹ ɧɟɩɪɢɦɟɧɢɦɚ
(ɫɥɢɲɤɨɦ ɦɧɨɝɨ ɫɥɨɜ ɢɥɢ ɫɥɢɲɤɨɦ ɞɥɢɧɧɨɟ ɫɥɨɜɨ).
7. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɨɩɪɟɞɟɥɟɧɢɹ
ɚ) ɧɚɢɛɨɥɶɲɟɝɨ ɩɪɨɫɬɨɝɨ ɱɢɫɥɚ, ɧɟ ɩɪɟɜɨɫɯɨɞɹɳɟɝɨ ɡɚɞɚɧɧɨɟ ɰɟɥɨɟ
n,
ɛ) ɧɚɢɦɟɧɶɲɟɝɨ ɩɪɨɫɬɨɝɨ ɱɢɫɥɚ, ɩɪɟɜɨɫɯɨɞɹɳɟɝɨ ɡɚɞɚɧɧɨɟ ɱɢɫɥɨ n.
int simple(int n);
8. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɪɚɡɥɨɠɟɧɢɹ ɡɚɞɚɧɧɨɝɨ ɰɟɥɨɝɨ ɱɢɫɥɚ ɧɚ ɩɪɨɫɬɵɟ
ɦɧɨɠɢɬɟɥɢ. Ɋɟɡɭɥɶɬɚɬɨɦ ɮɭɧɤɰɢɢ ɞɨɥɠɟɧ ɛɵɬɶ ɦɚɫɫɢɜ, ɫɨɞɟɪɠɚɳɢɣ ɩɪɨ-
ɫɬɵɟ ɦɧɨɠɢɬɟɥɢ, ɢ ɰɟɥɨɟ ɱɢɫɥɨɤɨɥɢɱɟɫɬɜɨ ɦɧɨɠɢɬɟɥɟɣ.
int simplefactor(int n, int *masfactor);
9. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɜɵɱɢɫɥɟɧɢɹ ɱɢɫɥɚ ɫɨɱɟɬɚɧɢɣ ɢɡ n ɡɥɟɦɟɧɬɨɜ ɩɨ
m (n ɢ mɰɟɥɵɟ):
C_nm=n!/((n-m)!*m!)
Ɋɟɡɭɥɶɬɚɬɨɦ ɮɭɧɤɰɢɢ ɞɨɥɠɧɨ ɛɵɬɶ ɰɟɥɨɟ ɢɥɢ ɜɟɳɟɫɬɜɟɧɧɨɟ ɱɢɫɥɨ, ɟɫɥɢ
C_nm<32767, ɢ ɛɭɥɟɜɫɤɨɟ ɡɧɚɱɟɧɢɟ true, ɢɥɢ ɛɭɥɟɜɫɤɨɟ ɡɧɚɱɟɧɢɟ false,
ɟɫɥɢ
C_nm>=32767.
Boolean binom(int n, int m, int *cnm, double *dcnm);
10. Ɇɧɨɝɨɱɥɟɧɵ ɩɪɟɞɫɬɚɜɥɹɸɬɫɹ ɜ ɩɚɦɹɬɢ ɗȼɆ ɰɟɥɵɦ ɱɢɫɥɨɦ nɫɬɟɩɟ-
ɧɶɸ ɦɧɨɝɨɱɥɟɧɚ ɢ ɦɚɫɫɢɜɨɦ ɤɨɷɮɮɢɰɢɟɧɬɨɜ
a[0], a[1], ... ,a[n].
60
6. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɪɚɡɞɟɥɟɧɢɹ ɬɟɤɫɬɚ, ɡɚɞɚɧɧɨɝɨ ɫɬɪɨɤɨɣ ɥɢɬɟɪ, ɧɚ
ɨɬɞɟɥɶɧɵɟ ɫɥɨɜɚ ɢ ɩɨɞɫɱɟɬɚ ɱɢɫɥɚ ɫɥɨɜ. ɉɨɞ ɫɥɨɜɨɦ ɩɨɧɢɦɚɟɬɫɹ ɩɨɫɥɟɞɨ-
ɜɚɬɟɥɶɧɨɫɬɶ ɥɢɬɟɪ, ɨɬɥɢɱɧɵɯ ɨɬ ɩɪɨɛɟɥɚ, ɨɝɪɚɧɢɱɟɧɧɚɹ ɫɥɟɜɚ ɧɚɱɚɥɨɦ
ɫɬɪɨɤɢ, ɢɥɢ ɩɪɨɛɟɥɨɦ, ɢ ɫɩɪɚɜɚ – ɩɪɨɛɟɥɨɦ, ɡɧɚɤɨɦ ɩɪɟɩɢɧɚɧɢɹ ɢɥɢ ɤɨɧ-
ɰɨɦ ɫɬɪɨɤɢ.

     int kwords(char* ss, char* sm, int kmax);

ss – ɢɫɯɨɞɧɚɹ ɫɬɪɨɤɚ, sm – ɦɚɫɫɢɜ ɫɬɪɨɤ ɞɥɢɧɨɣ ɞɨ 30 ɥɢɬɟɪ ɤɚɠɞɚɹ (ɞɥɹ
ɪɚɡɦɟɳɟɧɢɹ ɜɵɞɟɥɟɧɧɵɯ ɫɥɨɜ), kmax – ɦɚɤɫɢɦɚɥɶɧɨɟ ɤɨɥɢɱɟɫɬɜɨ ɜɵɞɟɥɟɧ-
ɧɵɯ ɫɥɨɜ.

ɉɪɟɞɭɫɦɨɬɪɟɬɶ ɫɢɝɧɚɥɢɡɚɰɢɸ ɨ ɫɥɭɱɚɹɯ, ɤɨɝɞɚ ɮɭɧɤɰɢɹ ɧɟɩɪɢɦɟɧɢɦɚ
(ɫɥɢɲɤɨɦ ɦɧɨɝɨ ɫɥɨɜ ɢɥɢ ɫɥɢɲɤɨɦ ɞɥɢɧɧɨɟ ɫɥɨɜɨ).

7. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɨɩɪɟɞɟɥɟɧɢɹ

ɚ) ɧɚɢɛɨɥɶɲɟɝɨ ɩɪɨɫɬɨɝɨ ɱɢɫɥɚ, ɧɟ ɩɪɟɜɨɫɯɨɞɹɳɟɝɨ ɡɚɞɚɧɧɨɟ ɰɟɥɨɟ n,

ɛ) ɧɚɢɦɟɧɶɲɟɝɨ ɩɪɨɫɬɨɝɨ ɱɢɫɥɚ, ɩɪɟɜɨɫɯɨɞɹɳɟɝɨ ɡɚɞɚɧɧɨɟ ɱɢɫɥɨ n.

     int simple(int n);

8. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɪɚɡɥɨɠɟɧɢɹ ɡɚɞɚɧɧɨɝɨ ɰɟɥɨɝɨ ɱɢɫɥɚ ɧɚ ɩɪɨɫɬɵɟ
ɦɧɨɠɢɬɟɥɢ. Ɋɟɡɭɥɶɬɚɬɨɦ ɮɭɧɤɰɢɢ ɞɨɥɠɟɧ ɛɵɬɶ ɦɚɫɫɢɜ, ɫɨɞɟɪɠɚɳɢɣ ɩɪɨ-
ɫɬɵɟ ɦɧɨɠɢɬɟɥɢ, ɢ ɰɟɥɨɟ ɱɢɫɥɨ – ɤɨɥɢɱɟɫɬɜɨ ɦɧɨɠɢɬɟɥɟɣ.

     int simplefactor(int n, int *masfactor);

9. ɋɨɫɬɚɜɢɬɶ ɮɭɧɤɰɢɸ ɞɥɹ ɜɵɱɢɫɥɟɧɢɹ ɱɢɫɥɚ ɫɨɱɟɬɚɧɢɣ ɢɡ n ɡɥɟɦɟɧɬɨɜ ɩɨ
m (n ɢ m – ɰɟɥɵɟ):

     C_nm=n!/((n-m)!*m!)

Ɋɟɡɭɥɶɬɚɬɨɦ ɮɭɧɤɰɢɢ ɞɨɥɠɧɨ ɛɵɬɶ ɰɟɥɨɟ ɢɥɢ ɜɟɳɟɫɬɜɟɧɧɨɟ ɱɢɫɥɨ, ɟɫɥɢ
C_nm<32767, ɢ ɛɭɥɟɜɫɤɨɟ ɡɧɚɱɟɧɢɟ true, ɢɥɢ ɛɭɥɟɜɫɤɨɟ ɡɧɚɱɟɧɢɟ false,
ɟɫɥɢ C_nm>=32767.

     Boolean binom(int n, int m, int *cnm, double *dcnm);

10. Ɇɧɨɝɨɱɥɟɧɵ ɩɪɟɞɫɬɚɜɥɹɸɬɫɹ ɜ ɩɚɦɹɬɢ ɗȼɆ ɰɟɥɵɦ ɱɢɫɥɨɦ n – ɫɬɟɩɟ-
ɧɶɸ ɦɧɨɝɨɱɥɟɧɚ ɢ ɦɚɫɫɢɜɨɦ ɤɨɷɮɮɢɰɢɟɧɬɨɜ a[0], a[1], ... ,a[n].


                                  60