Int main(int argc, char* argv[])

{

int* A = new int[10];

int* B = new int[10];

int size = 0;

cout << "Vvedite massiv" << endl;

for (int i = 0; i < 10; i++)

cin >> A[i];

for (int i = 0; i < 10; i++)

if (A[i] % 2 == 0)

B[size++] = A[i];

Sort(B, size);

cout << "Resultat" << endl;

for (int i = 0; i < size; i++)

cout << B[i] << endl;

cin.ignore();

cin.get();

delete A;

delete B;

return 0;

}

Задача 7.

#include <iostream.h>

#include <vcl.h>

#pragma hdrstop

using namespace std;

#pragma argsused

int GetMin(int* mas)

{

int min = mas[0];

int pos = 0;

for (int i = 1; i < 10; i++)

if (mas[i] < min)

{

min = mas[i];

pos = i;

}

return pos;

}

Int main(int argc, char* argv[])

{

int* A = new int[10];

int* B = new int[10];

cout << "Vvedite massiv A" << endl;

for (int i = 0; i < 10; i++)

cin >> A[i];

cout << "Vvedite massiv B" << endl;

for (int i = 0; i < 10; i++)

cin >> B[i];

int index1 = GetMin(A);

int index2 = GetMin(B);

int* p;

if (index1 > index2)

p = A;

else

p = B;

cout << "Resultat" << endl;

for (int i = 0; i < 10; i++)

cout << p[i] << endl;

cin.ignore();

cin.get();

delete A;

delete B;

return 0;

}

Задача 8.

#include <iostream.h>

#include <vcl.h>

#pragma hdrstop

using namespace std;

#pragma argsused

bool IsBelong(float k, float b, float y, float x)

{

bool result;

if ((k * x + b) == y)

result = true;

else

result = false;

return result;

}

Int main(int argc, char* argv[])

{

float k, b, x, y;

cout << "Vvedite k: ";

cin >> k;

cout << "Vvedite b: ";

cin >> b;

cout << "Vvedite x: ";

cin >> x;

cout << "Vvedite y: ";

cin >> y;

if (IsBelong(k, b, y, x))

cout << "Tochka prinadlezhit pryamoi" << endl;

else

cout << "Tochka ne prinadlezhit pryamoi" << endl;

cin.ignore();

cin.get();

return 0;

}

Задача 9.

#include <iostream.h>

#include <vcl.h>

#pragma hdrstop

using namespace std;

#pragma argsused

int DaysCount(int num)

{

Int count;

switch (num)

{

case 1:

{

count = 31;

break;

}

case 2:

{

count = 28;

break;

}

case 3:

{

count = 31;

break;

}

case 4:

{

count = 30;

break;

}

case 5:

{

count = 31;

break;

}

case 6:

{

count = 30;

break;

}

case 7:

{

count = 31;

break;

}

case 8:

{

count = 31;

break;

}

case 9:

{

count = 30;

break;

}

case 10:

{

count = 31;

break;

}

case 11:

{

count = 30;

break;

}

case 12:

{

count = 31;

break;

}

default:

{

count = 0;

break;

}

}

return count;

}