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

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

ru en cn

5421939

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

Пиляй Николай Владимирович

Время

16:00<< 30.09.2021 16:00 (15 д. 06:34) 16:01>>

Обработка

16:00 ... 16:00 (3,98 сек.)

Файл

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

Турнир

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

Задача

E: Date

Набор тестов

Ограничения

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

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

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

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

date.h:11:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:13:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:14:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:15:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:16:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:17:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:19:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:20:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:21:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:22:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:23:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:25:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:26:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:27:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:28:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:29:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:30:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:31:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:33:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:34:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:35:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:36:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:37:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:37:  Lines should be <= 80 characters long  [whitespace/line_length] [2]
date.h:37:  Use int16/int64/etc, rather than the C type long  [runtime/int] [4]
date.h:38:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:39:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:40:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:41:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:42:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:43:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:44:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:45:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:46:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:47:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:48:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:49:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:50:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:51:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:53:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:54:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:55:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:55:  Consider using localtime_r(...) instead of localtime(...) for improved thread safety.  [runtime/threadsafe_fn] [2]
date.h:56:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:56:  Consider using localtime_r(...) instead of localtime(...) for improved thread safety.  [runtime/threadsafe_fn] [2]
date.h:57:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:58:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:59:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:60:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:61:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:62:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:62:  { should almost always be at the end of the previous line  [whitespace/braces] [4]
date.h:62:  Missing space before {  [whitespace/braces] [5]
date.h:63:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:64:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:65:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:66:  Tab found; better to use spaces  [whitespace/tab] [1]
date.h:67:  Tab found; better to use spaces  [whitespace/tab] [1]
Done processing date.h
Total errors found: 58

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

≡

#pragma once
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <ctime>

class Date {
 public:
	int y, m, d;

explicit Date(int year, int month, int day) {
		y = year;
		m = month;
		d = day;
	}

bool IsLeap() const {
		if ((this->y % 4 == 0 && this->y % 100 != 0) || this->y % 400 == 0)
			return 1;
		return 0;
	}

std::string ToString() const {
		std::string str_d = std::to_string(this->d + 100).erase(0, 1);
		std::string str_m = std::to_string(this->m + 100).erase(0, 1);
		std::string str_y = std::to_string(this->y + 10000).erase(0, 1);
		std::string str_date = str_d + "." + str_m + "." + str_y;
		return str_date;
	}

Date DaysLater(int days) const {
		int new_d = this->d;
		int new_m = (this->m + 9) % 12;
		int new_y = this->y - new_m / 10;;
		long long int days_count = 365 * new_y + new_y / 4 - new_y / 100 + new_y / 400 + (new_m * 306 + 5) / 10 + (new_d - 1);
		days_count += days;
		new_y = (10000 * days_count + 14780) / 3652425;
		int ddd = days_count - (365 * new_y + new_y / 4 - new_y / 100 + new_y / 400);
		if (ddd < 0) {
			new_y = new_y - 1;
			ddd = days_count - (365 * new_y + new_y / 4 - new_y / 100 + new_y / 400);
		}
		int mi = (100 * ddd + 52) / 3060;
		int mm = (mi + 2) % 12 + 1;
		new_y = new_y + (mi + 2) / 12;
		int dd = ddd - (mi * 306 + 5) / 10 + 1;
		Date new_date(new_y, mm, dd);
		return new_date;
	}

int DaysLeft(const Date& date) const {
		time_t tmp = { 0 };
		struct std::tm a = *localtime(&tmp);;
		struct std::tm b = *localtime(&tmp);;
		a = { 0, 0, 0, this->d, this->m, this->y };
		b = { 0, 0, 0, date.d, date.m, date.y };
		std::time_t x = std::mktime(&a);
		std::time_t y = std::mktime(&b);
		if (x != (std::time_t)(-1) && y != (std::time_t)(-1))
		{
			double difference = std::difftime(y, x) / (60 * 60 * 24);
			return difference;
		}
		return 0;
	}
};

(1 929 b)

0.038s 0.009s 10