{summa = 0; (int j = 0; j
cout <<В«Середнє арифметичнеВ« <
double min = a [i] [0], max = a [i] [0]; (int j = 1; j
{(a [i] [j] max) = a [i] [j] ;
} <
} (int i = 0; i
{max = a [0] [i]; (int j = 1; j max) = a [j] [ i]; <
} (В«pauseВ»); 0;
}
Малюнок А.3 - Програмна реалізація рішення задачі № 3
# include В«stdafx.hВ»
# include
# include namespace std; SearchMax (double a [], int n); SearchMin (double a [], int n); Count (double a [], int n, double max, double min); _tmain (int argc, _TCHAR * argv [])
{(0, В«RUSВ»); int n1 = 18, n2 = 12, n3 = 10; b [n1], c [n2], z [n3]; <<В« Array b: В«<
{[i] = 2.8 - (i + 4.5); <
} <
{[i] = -12.6 + (i - 2.2); <
} <
{[i] = -9.1 - (i + 5.7); <
} <
} SearchMax (double a [], int n)
{max = a [0]; (int i = 1; i max) = a [i]; max;
} SearchMin (double a [], int n)
{min = a [0]; (int i = 1; i
} Count (double a [], int n, double max, double min)
{x = (max-min)/2; c = 0; (int i = 0; i
}
Малюнок А.4 - Програмна реалізація рішення задачі № 4
// App5.cpp: Defines the entry point for the console application.
//
# include В«stdafx.hВ»
# include
# include namespace std; Calc (double a [], int n); _tmain (int argc, _TCHAR * argv [])
{(0, В«RUSВ»); int n1 = 8, n2 = 11, n3 = 14; f [n1], g [n2], h [n3]; <<В« Array f: В«<