Examination_IT / Programming bases on With C++
.pdf
131
. ?
Z.
int a[] = {3, 7, 8, 9, -8, 5}; int b[] = {3, 7, 8, 9, -8, 5}; int c[6];
int d;
//~QAbFR@CD> QA>BHc@@. d = a[4];
b[5] = d; a[2] = b[0];
//e>^QAbFR@CD> QA>BHc@@.
c = a + b; |
// 8w@9PH. |
|
c = b; |
// 8w@9PH. |
|
if(a == c) d = 0; |
// 8w@9PH. |
|
.5.1 -
Z. B . 5.1
. : d
=. 5 =-
, ;.
8 58 9 5.1. !6:; Ex05_01.cpp
#include "stdafx.h" |
// ^=; setlocale. |
#include <locale.h> |
|
#include <iostream> |
// AQRQPQ<DK <<Q^-<D<Q^. |
#include <iomanip> |
// ^=; CH?@Ab=;RQBQ<. |
using namespace std; |
|
void _tmain()
{
setlocale(LC_CTYPE, "Russian_Russia.1251");
const int n = |
6; // aHPR@J>FP@K BHIC>B <F>E CHFF@<Q<. |
|
int i; |
|
// FJ>RJ@P c@P=Q<. |
// 89:;<=>?@> |
CHFF@<Q< @ @E @?@c@H=@IHc@;. |
|
int a[n] |
= |
{ 1, 7, 0, 8, 9, 8}; |
int b[100] |
= |
{ 1, 6, 3, 9, 3, 3}; |
132
//89:;<=>?@> CHFF@<Q<. int c[n];
int d[n];
//zBHdC>?R 1. ‚<Q^ CHFF@<H F P=H<@HRbBD. cout << "1). ‚<Q^ CHFF@<H F P=H<@HRbBD."; cout << " ‚<>^@R> 6 c>=DE J@F>=> " << endl; for(i = 0; i<n; i++)
{
cout << "c[" << i << "] = "; cin >> c[i];
}
cout << endl;
//zBHdC>?R 2. ‚D<Q^ CHFF@<H < QP?Q AB@=Qk>?@;. cout << "2). ‚D<Q^ CHFF@<H < QP?Q." << endl; for(i = 0; i<n; i++)
cout << "c[" << i << "] = " << c[i] << " "; cout << endl << endl;
//zBHdC>?R 3. l=Qk>?@> ^<bE CHFF@<Q< (<>PRQBQ<). cout << "3). l=Qk>?@> ^<bE CHFF@<Q< (<>PRQBQ<) a @ b"
<<endl;
cout << "F BHIC>{>?@>C B>Ib=fRHRH < CHFF@<> d" << endl;
cout << "(d = a + b).";
cout << endl <<"qHFF@< a:.........."; cout << setw(4);
for(i = 0; i<n; i++) cout << setw(4) << a[i]; cout << endl <<"qHFF@< b:..........";
for(i = 0; i<n; i++) cout << setw(4) << b[i]; cout << endl <<"qHFF@< d = a + d:..";
for(i = 0; i<n; i++)
{
d[i] = a[i] + b[i]; cout << setw(4) << d[i];
}
cout << endl << endl;
// zBHdC>?R 4. lBH<?>?@> ^<bE CHFF@<Q< (<>PRQBQ<). cout << "4). lBH<?>?@> ^<bE CHFF@<Q<." << endl; bool flag = true; // AQ=HdH>C, JRQ CHFF@<D BH<?D. for(i = 0; i<n; i++)
133
if(a[i] != c[i])
{
flag = false; // ?Hw=@ ?>BH<?D> Œ=>C>?RD. break; // AQP@^H>C c@P=.
}
if(flag) // <D<Q^@C FQQ9{>?@> Q BH<>?FR<> CHFF@<Q<.
else |
cout << "a = b" << endl; |
// <D<Q^@C FQQ9{>?@> Q ?>BH<>?FR<> CHFF@<Q<. |
cout << "a != b" << endl; cout << endl;
//zBHdC>?R 5. 89?b=>?@> CHFF@<H. for(i = 0; i<n; i++) d[0] = 0; cout << endl;
//zBHdC>?R 6. ]QA@BQ<H?@> CHFF@<H a < CHFF@< d. for(i = 0; i<n; i++)
d[i] = a[i]; cout << endl;
//†^>C ?HkHR@; =m9QK P=H<@w@ P=H<@HRbBD. system("pause");
}
D. 5.1. D Ex05_01
5.1
134
n ,
;@. D d 5.2.
8 58 9 5.2. !6:; Ex05_02.cpp
#include "stdafx.h" |
// ^=; setlocale. |
#include <locale.h> |
|
#include <iostream> |
// AQRQPQ<DK <<Q^-<D<Q^. |
using namespace std; |
|
/////////////////////////////////////////////////////////
/
// GBQRQR@AD ab?Pc@K.
int InputAmountsElem(int Min, int Max); void InputArray(int A[], int n);
bool CheckOnIncrease(int A[], int n);
/////////////////////////////////////////////////////////
/
// d=H<?H; ab?Pc@;. void _tmain()
{
setlocale(LC_CTYPE, "Russian_Russia.1251"); const int m = 10;
int Array[m]; int n;
//‚<Q^ ^H??DE Q PQ=@J>FR<> Œ=>C>?RQ< CHFF@<H. n = InputAmountsElem(2, m);
//‚<Q^ CHFF@<H.
InputArray(Array, n);
// GBQ<>BPH CHFF@<H ?H <QIBHFRH?@>.
bool Increase = CheckOnIncrease(Array, n); // ‚D<Q^ B>Ib=fRHRQ<.
if(Increase)
cout << "qHFF@< <QIBHFRHm{@K" << endl;
else
cout << "qHFF@< ?> ;<=;>RF; <QIBHFRHm{@C" <<
endl;
135
// †^>C ?HkHR@; =m9QK P=H<@w@ P=H<@HRbBD. system("pause");
}
/////////////////////////////////////////////////////////
/
//‚QI<BH{H>R J@F=Q, <<>^>??Q> F P=H<@HRbBD @ ?HEQ^;{>>F;
//< ^@HAHIQ?> QR min ^Q max. GB@ <<Q^> AQ=fIQ<HR>=>C
//J@F=H ?> @I ŒRQdQ ^@HAHIQ?H ab?Pc@; <DAQ=?;>R AQ<RQB-
//?DK IHABQF <<Q^H.
int InputAmountsElem(int Min, int Max)
{
//‚<Q^ ^H??DE Q PQ=@J>FR<> Œ=>C>?RQ< CHFF@<H F ABQ<>BPQK
//PQBB>PR?QFR@.
int n; do
{
cout << "]Q=@J>FR<Q Œ=>C>?RQ< CHFF@<H (2<=n<=" << Max << ") ";
cin >> n;
} while (n < Min || n > Max); return n;
}
/////////////////////////////////////////////////////////
/
// ‚<Q^@R n Œ=>C>?RQ< c>=QJ@F=>??QdQ CHFF@<H F P=H<@HRbBD.
void InputArray(int A[], int n)
{
int i;
// ‚<Q^ Œ=>C>?RQ< CHFF@<H. for(i = 0; i<n; i++)
{
cout << "a[" << i+1 << "] = "; cin >> A[i];
}
}
/////////////////////////////////////////////////////////
/
//‚QI<BH{H>R true, >=@ CHFF@< A <QIBHFRHm{@K @ false
//< ABQR@<?QC F=bJH>.
bool CheckOnIncrease(int A[], int n)
{
|
136 |
int i; |
|
for(i = 0; i<n-1; i++) |
|
if(A[i] >= A[i+1]) |
// CHFF@< ?> <QIBHFRHm{@K. |
return false; |
|
return true; |
// CHFF@< <QIBHFRHm{@K. |
}
D. 5.2. D Ex05_02
? 4 =,
5.2. 5 =
int InputAmountsElem(int Min, int Max); void InputArray(int A[], int n);
bool CheckOnIncrease(int A[], int n);
. = ;
. ~ Z ; =,
;@ =. 5
,
=, ;@
;@ = ;. 3
Z r , =, ;@
, Z
;@ =. 5 ,
( . 7.2). F , Z
Z
=.
M -F
137
. d - ; ,
@ ; =. ?-
, = -
Z , -
, ; . ? Z
d . .
;
= , -
-
, . .
C++ ;
= rand srand. e rand
0 RAND_MAX,
Z = ; ; -
, = ; srand1
= rand. :, ,
@ , -
.
= rand srand ;
= time.h. B = rand
, , … @ ; -
, - ;@ .
5.2
, @ n Z. B-
; @ Z.
, , - d ,
d
d Z-
1 e MSDN.
138
, d . ` d
Z. B Z, ( . 5.3). . -
.
|
|
|
i |
|
|
|
|
|
|
|
` A |
[0] |
[1] |
[2] |
[3] |
[4] |
[5] |
[6] |
[7] |
[8] |
[9] |
|
|
Summa |
|
|
|
|
|
|
|
|
Summa
Summa
Summa
D. 5.3. F Ex05_02
? A
, ,
Z, d . : -
,
for i. 3 i=0 -
Z -
A[0], A[1] A[2], – Z A[1], A[2], A[3] . B ,
i
[0, n-k-1],
, d. ? -
‰d ;
,
MaxSumma. ?
( i=0) – … , Z,
MaxSumma
- . f
,
int. 3
INT_MIN, = limits.h. 3
( 5.3) d ;@ ; ; .
139
8 58 9 5.3. !6:; Ex05_03.cpp
#include "stdafx.h" |
// ^=; setlocale. |
#include <locale.h> |
|
#include <iostream> |
// AQRQPQ<DK <<Q^-<D<Q^. |
#include <time.h> |
// ^=; ab?Pc@@ rand. |
#include <limits.h> |
// ^=; INT_MIN. |
using namespace std; |
|
void _tmain()
{
setlocale(LC_CTYPE, "Russian_Russia.1251");
const int n = 15; |
// PQ=@J>FR<Q Œ=>C>?RQ< CHFF@<H |
int k = 5; |
// ?HRbBH=f?DE J@F>=. |
// PQ=@J>FR<Q<Q Œ=>C>?RQ< |
|
|
// JHFR@J?QK FbCCD. |
int A[n] = {1,2,3,4,5,20,20,20,20,20,4,3,2,1,0}; int i, j;
int Summa, MaxSumma;
MaxSumma = INT_MIN; // AB@?@CH>C ŒRQ J@F=Q IH
// CHPF@CH=f?Q>. for(i=0; i<n-k-1; i++)
{
Summa = 0;
//eHEQ^@C JHFR@J?bm FbCCb @I k FRQ;{@E B;^QC
//Œ=>C>?RQ<.
Summa = A[i]+A[i+1]+A[i+2]+A[i+3]+A[i+4]; if(Summa > MaxSumma)
MaxSumma = Summa;
}
cout << "qHPF@CH=f?H; FbCCH @I " << k
<<" Œ=>C>?RQ<: " << MaxSumma << endl;
//†^>C ?HkHR@; =m9QK P=H<@w@ P=H<@HRbBD. system("pause");
}
.5.3 r -
A .
int A[n] = {1,2,3,4,5,20,20,20,20,20,4,3,2,1,0};
140
B Z , - , -
Z ,
@ ; Z , - ,
d (5 × 20 100).
. ,
; ;@ :
Summa = A[i]+A[i+1]+A[i+2]+A[i+3]+A[i+4];
d Z,
;@ ; . ? Z, Z
d ; @… . 3 d -
5.4. ! , -
A, =
. :, ;@ ; -
( 5.3), , –( . 5.4).
8 58 9 5.4. !6:; Ex05_03.cpp
#include "stdafx.h" |
// ^=; setlocale. |
#include <locale.h> |
|
#include <iostream> |
// AQRQPQ<DK <<Q^-<D<Q^. |
#include <time.h> |
// ^=; ab?Pc@@ rand. |
#include <limits.h> |
// ^=; INT_MIN. |
using namespace std; |
|
void _tmain()
{
setlocale(LC_CTYPE, "Russian_Russia.1251");
const int n = 15; // PQ=-<Q Œ=>C>?RQ< CHFF@<H ?HRbB. J@F>=.
int k = 5; // PQ=-<Q Œ=>C>?RQ< JHFR@J?QK FbCCD.
int A[n];
int i, j;
int Summa, MaxSumma;
cout << "„FEQ^?DK CHFF@<> " << endl; for(i=0; i<n; i++)