Тутынина Полина #35
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,3 @@ | ||
| build-*/ | ||
| a.out | ||
| *.out |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,7 +1,7 @@ | ||
| #include <cstdint> | ||
| #include <stdexcept> | ||
|
|
||
| //Функция, которая суммирует два числа | ||
| int64_t Addition(int a, int b) { | ||
| return static_cast<int64_t>(a) + static_cast<int64_t>(b); | ||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,7 +1,104 @@ | ||
| #include <cstddef> | ||
| #include <cctype> | ||
|
|
||
| /* Преобразует строку по правилам: | ||
| - Повторяющиеся символы (кроме пробелов) заменяются на символ+число повторений | ||
| - Цифры заменяются на '*' | ||
| - Все латинские буквы преобразуются в прописные | ||
| - Последовательные пробелы заменяются на разделитель | ||
| - Остальные символы заменяются на '_' | ||
| Возвращает новую длину строки */ | ||
|
|
||
| size_t CharChanger(char array[], size_t size, char delimiter) { | ||
| if (size == 0) return 0; | ||
|
|
||
| size_t write_pos = 0; | ||
| char prev_char = '\0'; | ||
| char current_sequence_char = '\0'; | ||
| size_t count = 0; | ||
| bool in_space_sequence = false; | ||
|
|
||
| for (size_t read_pos = 0; read_pos < size && array[read_pos] != '\0'; read_pos++) { | ||
|
Contributor
Author
There was a problem hiding this comment. префиксный инкремент нужен |
||
| char current_char = array[read_pos]; | ||
|
|
||
| // Обработка пробелов | ||
| if (current_char == ' ') { | ||
| // Если у нас есть незаписанная последовательность, записываем ее | ||
| if (current_sequence_char != '\0') { | ||
| array[write_pos++] = current_sequence_char; | ||
| if (count > 1) { | ||
| if (count >= 10) { | ||
| array[write_pos++] = '0'; | ||
| } else { | ||
| array[write_pos++] = '0' + count; | ||
| } | ||
| } | ||
| current_sequence_char = '\0'; | ||
| count = 0; | ||
| } | ||
|
|
||
| // Добавляем разделитель для каждой группы пробелов | ||
| if (!in_space_sequence) { | ||
| array[write_pos++] = delimiter; | ||
| in_space_sequence = true; | ||
| } | ||
| continue; | ||
| } | ||
|
|
||
| // Не пробел - сбрасываем флаг последовательности пробелов | ||
| in_space_sequence = false; | ||
|
|
||
| // Преобразование символа | ||
| char transformed_char = current_char; | ||
|
|
||
| if (std::isdigit(current_char)) { | ||
| transformed_char = '*'; | ||
| } else if (std::isalpha(current_char)) { | ||
| transformed_char = std::toupper(current_char); | ||
| } else if (current_char != ' ') { | ||
| transformed_char = '_'; | ||
| } | ||
|
|
||
| // Обработка последовательностей символов | ||
| if (current_char == prev_char) { | ||
| count++; | ||
|
Contributor
Author
There was a problem hiding this comment. префиксный инкремент нужен |
||
| } else { | ||
| // Запись предыдущей последовательности | ||
| if (current_sequence_char != '\0') { | ||
| array[write_pos++] = current_sequence_char; | ||
| if (count > 1) { | ||
| if (count >= 10) { | ||
| array[write_pos++] = '0'; | ||
|
Contributor
Author
There was a problem hiding this comment. это достаточно большая вложенность, обычно от такого можно избавиться |
||
| } else { | ||
| array[write_pos++] = '0' + count; | ||
| } | ||
| } | ||
| } | ||
|
Contributor
Author
There was a problem hiding this comment. дублирование кода, выше есть точно такой же блок, значит можно было написать оптимальнее, что-то может вынести во вспомогательные функции |
||
| // Начало новой последовательности | ||
| prev_char = current_char; | ||
| current_sequence_char = transformed_char; | ||
| count = 1; | ||
| } | ||
| } | ||
|
|
||
| // Запись последней последовательности (если не пробел) | ||
| if (current_sequence_char != '\0') { | ||
| array[write_pos++] = current_sequence_char; | ||
| if (count > 1) { | ||
| if (count >= 10) { | ||
| array[write_pos++] = '0'; | ||
| } else { | ||
| array[write_pos++] = '0' + count; | ||
| } | ||
| } | ||
| } | ||
|
|
||
|
|
||
| // Завершение строки | ||
| if (write_pos < size) { | ||
| array[write_pos] = '\0'; | ||
| } else if (size > 0) { | ||
| array[size - 1] = '\0'; | ||
| } | ||
|
|
||
| return write_pos; | ||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,68 @@ | ||
| #include <cmath> | ||
|
|
||
| // Константы для перевода | ||
| constexpr double CM_IN_METER = 100.0; | ||
| constexpr double METERS_IN_FOOT = 0.3048; | ||
| constexpr double INCHES_IN_FOOT = 12.0; | ||
| constexpr double CM_IN_INCH = 2.54; | ||
|
|
||
|
|
||
| // Метры в футы | ||
| constexpr double operator"" _m_to_ft(long double meters) { | ||
| return static_cast<long double>(meters / METERS_IN_FOOT); | ||
| } | ||
|
|
||
| // Метры в дюймы | ||
| constexpr double operator"" _m_to_in(long double meters) { | ||
| return static_cast<double>(meters * CM_IN_METER / CM_IN_INCH); | ||
| } | ||
|
|
||
| // Метры в сантиметры | ||
| constexpr double operator"" _m_to_cm(long double meters) { | ||
| return static_cast<double>(meters * CM_IN_METER); | ||
| } | ||
|
|
||
| // Сантиметры в метры | ||
| constexpr double operator"" _cm_to_m(long double centimeters) { | ||
| return static_cast<long double>(centimeters / CM_IN_METER); | ||
| } | ||
|
|
||
| // Сантиметры в футы | ||
| constexpr double operator"" _cm_to_ft(long double centimeters) { | ||
| return static_cast<double>(centimeters / CM_IN_METER / METERS_IN_FOOT); | ||
| } | ||
|
|
||
| // Сантиметры в дюймы | ||
| constexpr double operator"" _cm_to_in(long double centimeters) { | ||
| return static_cast<double>(centimeters / CM_IN_INCH); | ||
| } | ||
|
|
||
| // Футы в метры | ||
| constexpr double operator"" _ft_to_m(long double feet) { | ||
| return static_cast<double>(feet * METERS_IN_FOOT); | ||
| } | ||
|
|
||
| // Футы в сантиметры | ||
| constexpr double operator"" _ft_to_cm(long double feet) { | ||
| return static_cast<double>(feet * METERS_IN_FOOT * CM_IN_METER); | ||
| } | ||
|
|
||
| // Футы в дюймы | ||
| constexpr double operator"" _ft_to_in(long double feet) { | ||
| return static_cast<double>(feet * INCHES_IN_FOOT); | ||
| } | ||
|
|
||
|
|
||
| // Дюймы в метры | ||
| constexpr double operator"" _in_to_m(long double inches) { | ||
| return static_cast<double>(inches * CM_IN_INCH / CM_IN_METER); | ||
| } | ||
|
|
||
| // Дюймы в сантиметры | ||
| constexpr double operator"" _in_to_cm(long double inches) { | ||
| return static_cast<double>(inches * CM_IN_INCH); | ||
| } | ||
|
|
||
| // Дюймы в футы | ||
| constexpr double operator"" _in_to_ft(long double inches) { | ||
| return static_cast<double>(inches / INCHES_IN_FOOT); | ||
| } | ||
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,7 +1,40 @@ | ||
| #include <iostream> | ||
|
|
||
| /*функцию, преобразующая целое число | ||
| и размер в байтах и выводит на экран битовое представление числа в формате 0bXXXX'XXXX.*/ | ||
| void PrintBits(long long value, size_t bytes) { | ||
| // Проверка допустимости размера | ||
| if (bytes == 0 || bytes > 8) { | ||
| return; | ||
| } | ||
|
|
||
| // Вывод префикс | ||
| std::cout << "0b"; | ||
|
|
||
| // Цикл по всем битам от старшего к младшему | ||
| for (int byte = bytes - 1; byte >= 0; --byte) { | ||
|
|
||
| // Текущий байт | ||
|
Contributor
Author
There was a problem hiding this comment. это написано в имени переменной ниже |
||
| unsigned char current_byte = (value >> (byte * 8)) & 0xFF; | ||
|
|
||
| // Вывод битов текущего байта | ||
| for (int bit = 7; bit >= 0; --bit) { | ||
| // Текущий бит (7-й бит - старший) | ||
| unsigned char current_bit = (current_byte >> bit) & 1; | ||
| std::cout << (current_bit ? '1' : '0'); | ||
|
|
||
| // Добавление апострофа после 4-го бита в каждом байте | ||
| if (bit == 4) { | ||
| std::cout << "'"; | ||
| } | ||
| } | ||
|
|
||
| // Добавление апострофа между байтами (кроме последнего) | ||
| if (byte > 0) { | ||
| std::cout << "'"; | ||
| } | ||
| } | ||
|
|
||
| // Завершение вывода | ||
| std::cout << "\n"; | ||
| } | ||
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Лишний каст, второй операнд не следует приводить явно, так как он бы преобразовался с помощью неявного каста. Принято использовать такую возможность и не писать явный каст самостоятельно второй раз