Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <algorithm>
- int main()
- {
- using namespace std;
- int n;
- cout << "Enter n: " << endl;
- cin >> n;
- double** mas = new double* [n];
- for (int i = 0; i < n; i++)
- mas[i] = new double[n];
- for (int i = 0; i < n; i++)
- for (int j = 0; j < n; j++)
- cin >> mas[i][j];
- double sum = 0;
- int m = 0;
- vector <double> mas2(m);
- int k = 0;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (((i <= j / 2) && (j >= n / 2) && (j - i >= n / 2)) || ((i >= n / 2) && (j >= n / 2) && (j - n + i + 1 >= n / 2)))
- { //mas[j][i] = 1;
- mas2.insert(mas2.begin() + k, mas[j][i]);
- //mas2[k] = mas[j][i];
- //sum += mas[j][i];
- k++;
- }
- }
- }
- cout << sum << endl;
- /*for (int i = 0; i < n; i++)
- {
- cout << endl;
- for (int j = 0; j < n; j++)
- {
- cout << mas[i][j] << " ";
- }
- }
- cout << endl;*/
- for (int i = 0; i < mas2.size(); i++)
- {
- cout << mas2[i] << " ";
- }
- for (int i = 0; i < mas2.size() - 1; i++)
- {
- sort(mas2.begin(), mas2.end());
- }
- int l = 0;
- for (int i = 0; i < mas2.size(); i++)
- {
- l = 0;
- double t;
- for (int j = 0; j < mas2.size(); j++)
- {
- if (mas2[i] == mas2[j])
- {
- l++;
- t = mas2[i];
- }
- }
- /*if (l > 1)
- { //далее с этого места вырезать все значения мас 2 итое
- for (int h = 0; h < mas2.size(); h++)
- {
- if (mas2[h] == t)
- {
- mas2.erase(mas2.begin() + h);
- }
- }
- sum -= l * t;
- }*/
- if (l == 1)
- {
- sum += t;
- }
- }
- cout << "Your result: " << sum;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement