Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int get_rand(int a, int b);
- void task0() {
- int arr[6];
- for (int k = 0; k < size(arr); k++) {
- arr[k] = 3 + 2 * k;
- }
- int summ = 0;
- for (int k = 0; k < size(arr); k++) {
- summ += arr[k];
- }
- for (int k = 0; k < size(arr); k++) {
- cout << arr[k] << " ";
- }
- cout << endl;
- cout << summ << " " << (double)summ / size(arr) << endl;
- }
- void test_arr_2D() {
- const int size1 = 4;
- const int size2 = 5;
- int arr[size1][size2];
- arr[0][0] = 12;
- for (int k = 0; k < size1; k++) {
- for (int n = 0; n < size2; n++) {
- arr[k][n] = (k + 1) * (n + 1);
- }
- }
- for (int k = 0; k < size1; k++) {
- for (int n = 0; n < size2; n++) {
- cout << arr[k][n] << "\t";
- }
- cout << endl;
- }
- int x = 255;
- cout << &x << endl;
- cout << &(arr[0][0]) << " " << arr << " " << arr[0]<< endl;
- }
- void test_arr2D_like_arr1D() {
- const int size1 = 4;
- const int size2 = 5;
- int arr[size1 * size2];
- //arr[0][0] = 12;
- for (int k = 0; k < size1; k++) {
- for (int n = 0; n < size2; n++) {
- arr[k * size2 + n] = (n + 1) * (k + 1);
- }
- }
- for (int k = 0; k < size1; k++) {
- for (int n = 0; n < size2; n++) {
- cout << arr[k * size2 + n] << "\t";
- }
- cout << endl;
- }
- }
- const int size_h = 4 + 1;
- //const int size_w = 5 + 1;
- #define SIZE_W 5 + 1
- void gen_arr(int size_h, int size_w, int arr[][SIZE_W]) {
- for (int k = 0; k < size_h; k++) {
- for (int n = 0; n < size_w; n++) {
- arr[k][n] = get_rand(-10, 10);
- }
- }
- }
- void calc_arr(int size_h, int size_w, int arr[][SIZE_W]) {
- for (int k = 0; k < size_h; k++) {
- arr[k][size_w - 1] = 0;
- }
- for (int n = 0; n < size_w-1; n++) {
- arr[size_h -1][n] = 0;
- }
- for (int k = 0; k < size_h - 1; k++) {
- for (int n = 0; n < size_w - 1; n++) {
- arr[k][size_w - 1] += arr[k][n];
- arr[size_h - 1][n] += arr[k][n];
- arr[size_h - 1][size_w - 1] += arr[k][n];
- }
- }
- }
- void show_arr(int size_h, int size_w, int arr[][SIZE_W]) {
- for (int k = 0; k < size_h; k++) {
- for (int n = 0; n < size_w; n++) {
- cout << arr[k][n] << "\t";
- }
- cout << endl;
- }
- }
- int get_rand(int a, int b) {
- return rand() % (b - a + 1) + a;
- }
- void test_sum2D() {
- int arr[size_h][SIZE_W];
- gen_arr(size_h-1, SIZE_W-1, arr);
- calc_arr(size_h, SIZE_W, arr);
- show_arr(size_h, SIZE_W, arr);
- }
- int main() {
- srand(time(NULL));
- //task0();
- //test_arr_2D();
- //test_arr2D_like_arr1D();
- test_sum2D();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment