Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- const int SIZE = 25;
- //Task1
- /*
- int a[SIZE][SIZE];
- int n = 0, m = 0;
- cin >> n >> m;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- cin >> a[i][j];
- }
- }
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- a[i][j] += 10;
- cout << a[i][j] << " ";
- }
- cout << endl;
- }
- */
- //Task2
- /*
- int a[SIZE][SIZE];
- int n = 0, m = 0;
- cin >> n >> m;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- cin >> a[i][j];
- }
- }
- int max = a[0][0];
- int min = a[0][0];
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- if (a[i][j] > max)
- max = a[i][j];
- if (a[i][j] < min)
- min = a[i][j];
- }
- }
- cout << "Maximum: " << max << endl;
- cout << "Minimum: " << min << endl;
- */
- //Task3
- /*int a[SIZE][SIZE];
- int n = 0;
- cin >> n ;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- cin >> a[i][j];
- }
- }*/
- // sum of rows
- /*int sumRow = 0;
- for (int i = 0; i < n; i++)
- {
- sumRow = 0;
- for (int j = 0; j < n; j++)
- {
- sumRow += a[i][j];
- }
- cout << "Sum of " << i << " row is: " << sumRow << endl;
- }*/
- // sum of col
- /*int sumCol = 0;
- for (int i = 0; i < n; i++)
- {
- sumCol = 0;
- for (int j = 0; j < n; j++)
- {
- sumCol += a[j][i];
- }
- cout << "Sum of " << i << " column is: " << sumCol << endl;
- }*/
- //sum of principal diagonal
- /*int sumPD = 0;
- for (int i = 0; i < n; i++)
- sumPD += a[i][i];
- cout << "Sum of principal diagonal is: " << sumPD << endl;
- */
- //sum of under PD
- /*int sumUnderPD = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i > j)
- sumUnderPD += a[i][j];
- }
- }
- cout << "Sum of numbers under the principal diagonal is: " << sumUnderPD << endl;
- */
- //sum of above PD
- /*int sumAbovePD = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i < j)
- {
- sumAbovePD += a[i][j];
- }
- }
- }
- cout << "Sum of numbers above the principal diagonal is: " << sumAbovePD << endl;
- */
- //sum of secondary diagonal
- /*int sumSD = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i + j == n - 1)
- {
- sumSD += a[i][j];
- }
- }
- }
- cout << "Sum of numbers at the secondary diagonal is: " << sumSD << endl;
- */
- // sum under secondary diagonal
- /*int sumUnderSD = 0;
- for (int i = 1; i <= n - 1; i++)
- {
- for (inr j = n -1; )
- if (j >= i)
- {
- sumUnderSD += a[i][j];
- }
- }
- cout << "Sum of numbers under the secondary diagonal is: " << sumUnderSD << endl;*/
- //Task5
- char arr[SIZE];
- cin >> arr;
- char b;
- cin >> b;
- int counter = 0;
- for (int i = 0; arr[i] != '\0'; i++)
- {
- if (b == arr[i])
- {
- counter++;
- arr[i] = '*';
- }
- }
- cout << arr << endl;
- cout << counter << endl;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement