2 курс. Программирование на C++. Турнир 1, осень 2021

вход курсы / турниры задачи участники консоль модули компиляторы ключевые слова результаты

ru en cn

5466204

Пользователь

Павлюк Роман Сергеевич

Время

10.10.2021 15:32 (25 д. 06:06) 15:34>>

Обработка

15:32 ... 15:32 (5,71 сек.)

Файл

5466204.cpp (CLang++ 5.0.0 + Address Sanitizer)

Турнир

2 курс. Программирование на C++. Турнир 1, осень 2021

Задача

C: Set

Набор тестов

Ограничения

Время: 1с Память: 512Мб

Состояние [?]

LI	Ошибка проверки исходного кода

код | результаты

set.h:4:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:11:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:14:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:22:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:23:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:35:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:37:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:55:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:73:  Missing space around colon in range-based for loop  [whitespace/forcolon] [2]
set.h:81:  Add #include <vector> for vector<>  [build/include_what_you_use] [4]
Done processing set.h
Total errors found: 10

[печатать | | ]

≡

#include "set.h"

Set::Set(const std::vector<int64_t> &vector) {
    for (auto const item: vector) {
        this->Add(item);
    }
}

Set Set::Union(const Set &old) const {
    Set new_set;
    for (auto const item: old.Data()) {
        new_set.Add(item);
    }
    for (auto const item: this->vector) {
        new_set.Add(item);
    }
    return new_set;
}

Set Set::Intersection(const Set &another) const {
    Set new_set;
    for (auto const item1: this->vector) {
        for (auto const item2: another.Data()) {
            if (item1 == item2) {
                new_set.Add(item1);
            }
        }
    }
    return new_set;
}

Set Set::Difference(const Set &another) const {
    Set new_set;
    bool used;
    for (auto const item1: this->vector) {
        used = true;
        for (auto const item2: another.Data()) {
            if (item1 == item2) {
                used = false;
                break;
            }
        }
        if (used) {
            new_set.Add(item1);
        }
    }
    return new_set;
}

Set Set::SymmetricDifference(const Set &another) const {
    return this->Difference(another).Union(another.Difference(*this));
}

void Set::Add(int64_t num) {
    for (auto const item: this->vector) {
        if (item == num) {
            return;
        }
    }
    this->vector.push_back(num);
}

void Set::Remove(int64_t num) {
    for (int i = 0; i < this->vector.size(); i++) {
        if (this->vector[i] == num) {
            this->vector.erase(this->vector.begin() + i);
            break;
        }
    }
}

bool Set::Contains(int64_t num) const {
    for (auto const item: this->vector) {
        if (item == num) {
            return true;
        }
    }
    return false;
}

std::vector<int64_t> Set::Data() const {
    return this->vector;
}

(1 880 b)

0.061s 0.009s 10