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

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

ru en cn

5482347

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

Миронов Александр Сергеевич

Время

13.10.2021 23:20 (28 д. 13:54) 23:25>>

Обработка

23:20 ... 23:20 (15,08 сек.)

Файл

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

Турнир

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

Задача

C: Set

Набор тестов

Ограничения

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

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

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

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

set.h:6:  private: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:7:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:8:  public: should be indented +1 space inside class Set  [whitespace/indent] [3]
set.h:8:  "public:" should be preceded by a blank line  [whitespace/blank_line] [3]
set.h:9:  Do not leave a blank line after "public:"  [whitespace/blank_line] [3]
set.h:10:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:11:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:13:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:14:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:15:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:16:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:17:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:18:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:20:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:21:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:22:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:23:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:24:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:26:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:27:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:28:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:30:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:31:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:32:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:33:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:34:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:35:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:36:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:37:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:39:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:40:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:41:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:42:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:43:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:44:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:45:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:46:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:47:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:48:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:49:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:50:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:51:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:52:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:54:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:55:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:56:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:57:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:58:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:59:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:60:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:61:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:62:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:64:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:65:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:66:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:67:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:68:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:69:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:70:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:71:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:72:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:74:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:75:  Tab found; better to use spaces  [whitespace/tab] [1]
set.h:76:  Tab found; better to use spaces  [whitespace/tab] [1]
Done processing set.h
Total errors found: 64

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

≡

#pragma once
#include <vector>
#include <algorithm>

class Set {
private:
	std::vector<int64_t> set;
public:

explicit Set(const std::vector<int64_t>& s = { }) : set(s) {
	}

void Add(int64_t num) {
		if (!(std::find(set.begin(), set.end(), num) != set.end())) {
			set.push_back(num);
			sort(set.begin(), set.end());
		}
	}

void Remove(int64_t num) {
		auto it = std::find(set.begin(), set.end(), num);
		if (it != set.end())
			set.erase(it);
	}

bool Contains(int64_t num) const {
		return std::find(set.begin(), set.end(), num) != set.end();
	}

Set Union(const Set& s) const {
		Set setter;
		for (int64_t k : set)
			setter.Add(k);
		for (int64_t k : s.set)
			setter.Add(k);
		return setter;
	}

Set SymmetricDifference(const Set& s) const {
		Set setter;
		for (int64_t k : s.set) {
			if (!(std::find(set.begin(), set.end(), k) != set.end())) {
				setter.Add(k);
			}
		}
		for (int64_t k : set) {
			if (!(std::find(s.set.begin(), s.set.end(), k) != s.set.end())) {
				setter.Add(k);
			}
		}
		return setter;
	}

Set Difference(const Set& s) const {
		Set setter;
		for (int64_t k : set) {
			if (!(std::find(s.set.begin(), s.set.end(), k) != s.set.end())) {
				setter.Add(k);
			}
		}
		return setter;
	}

Set Intersection(const Set& s) const {
		Set setter;
		for (int64_t k : s.set) {
			if ((std::find(set.begin(), set.end(), k) != set.end())) {
				setter.Add(k);
			}
		}
		return setter;
	}

std::vector<int64_t> Data() const {
		return set;
	}
};

(1 557 b)

0.095s 0.015s 10