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

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

ru en cn

5458369

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

Акуленко Валерий Васильевич

Время

08.10.2021 15:38 (23 д. 06:11) 15:44>>

Обработка

15:38 ... 15:38 (3,78 сек.)

Файл

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

Турнир

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

Задача

D: PrimeNumberGenerator

Набор тестов

Ограничения

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

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

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

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

prime_gen.h:9:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:10:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:11:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:12:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:16:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:17:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:18:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:19:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:20:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:21:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:23:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:23:  At least two spaces is best between code and comments  [whitespace/comments] [2]
prime_gen.h:24:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:25:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:26:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:27:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:28:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:29:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:31:  "private:" should be preceded by a blank line  [whitespace/blank_line] [3]
prime_gen.h:32:  Do not leave a blank line after "private:"  [whitespace/blank_line] [3]
prime_gen.h:34:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:35:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:36:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:38:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:39:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:40:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:41:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:42:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:43:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:44:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:45:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:46:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:47:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:48:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:49:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:50:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:54:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:55:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:55:  If/else bodies with multiple statements require braces  [readability/braces] [4]
prime_gen.h:56:  Tab found; better to use spaces  [whitespace/tab] [1]
prime_gen.h:63:  Could not find a newline character at the end of the file.  [whitespace/ending_newline] [5]
Done processing prime_gen.h
Total errors found: 41

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

≡

#ifndef LABS_CPP_PERSON_H
#define LABS_CPP_PERSON_H
#include <vector>
#include <cstdint>
#include <algorithm>
class PrimeNumberGenerator {
 public:
  explicit PrimeNumberGenerator(int start) : _tableInternalIndex(start) {
	while (_size < start)
	  _size *= 2;
	_primeTable = std::vector<int64_t>(_size);
	CalcPrimes(start);
  }

int GetNextPrime() {
	std::vector<int64_t>::iterator it{};
	int64_t answ{};
	if (!_primeNumbers.empty()) {
	  it = std::find(std::begin(_primeNumbers),
					 std::end(_primeNumbers), _primeNumbers.front());
	}

if (it == std::end(_primeNumbers)) { // empty
	  _size *= 2;
	  CalcPrimes(_size / 2);
	}
	answ = *it;
	_primeNumbers.erase(it);
	return answ;
  }
 private:

void CalcPrimes(int start) {
	for (size_t i = 0; i < _size; ++i) {
	  _primeTable[i] = i;
	}

_primeTable[1] = 0;
	for (size_t i = 2; i < _size; ++i) {
	  if (_primeTable[i] != 0) {
		for (size_t j = i * i; j < _size; j += i)
		  _primeTable[j] = 0;
	  }
	}
	int i = 0;
	while (_primeTable[i] < start) {
	  _primeTable[i] = 0;
	  i++;
	}
	FetchFromTable();
  }

void FetchFromTable() {
	for (auto x : _primeTable)
	  if (x != 0)
		_primeNumbers.push_back(x);
  }
  size_t _size = 1500000;
  int _tableInternalIndex = 0;
  std::vector<int64_t> _primeTable;
  std::vector<int64_t> _primeNumbers;
};
#endif

(1 371 b)

0.121s 0.009s 10