Compare commits
2 Commits
64597ccc7e
...
68cefa440f
| Author | SHA1 | Date | |
|---|---|---|---|
| 68cefa440f | |||
| b18d091370 |
255
Part1/Lab1/Mashinnoe/Lab1_1.cpp
Normal file
255
Part1/Lab1/Mashinnoe/Lab1_1.cpp
Normal file
@@ -0,0 +1,255 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
#include <iomanip>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
const char universum[] = "ABCDEFGHIJKMNLOPQRSTUVWXYZ";
|
||||||
|
const char filename[] = "Test_result.txt";
|
||||||
|
const int length = 26;
|
||||||
|
const int durationCoeff = 1000000;
|
||||||
|
int customTestAmount = 0;
|
||||||
|
char stringA[length], stringB[length], stringC[length], stringD[length];
|
||||||
|
unsigned int vectorA, vectorB, vectorC, vectorD, vectorF;
|
||||||
|
|
||||||
|
|
||||||
|
void setupConsole()
|
||||||
|
{
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
SetConsoleOutputCP(1251);
|
||||||
|
SetConsoleCP(1251);
|
||||||
|
cout << fixed;
|
||||||
|
cout << setprecision(7);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputGreeting()
|
||||||
|
{
|
||||||
|
cout << "Программа рассчитывает значение множества F согласно следующим законам - " << endl;
|
||||||
|
cout << "F = D && (A || B) && !C, что равносильно F = D*(A + B) - C." << endl;
|
||||||
|
cout << "Универсум: " << universum << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void input()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Введите множество A: ";
|
||||||
|
cin >> stringA;
|
||||||
|
cout << "Введите множество B: ";
|
||||||
|
cin >> stringB;
|
||||||
|
cout << "Введите множество C: ";
|
||||||
|
cin >> stringC;
|
||||||
|
cout << "Введите множество D: ";
|
||||||
|
cin >> stringD;
|
||||||
|
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isCorrectSymbol(char symbol)
|
||||||
|
{
|
||||||
|
return ((symbol >= universum[0] && symbol <= universum[length - 1]) || symbol == '\0') ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isStringCorrect(char* string)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length && string[i] != '\0'; i++)
|
||||||
|
if (!isCorrectSymbol(string[i]))
|
||||||
|
return 0;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
int memberToIndex(char member)
|
||||||
|
{
|
||||||
|
return member - universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
char indexToMember(int number)
|
||||||
|
{
|
||||||
|
return number + universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned int vectorFromString(const char string[])
|
||||||
|
{
|
||||||
|
int vector = 0;
|
||||||
|
for (int i = 0; string[i]; ++i)
|
||||||
|
vector |= (1 << memberToIndex(string[i]));
|
||||||
|
return vector;
|
||||||
|
};
|
||||||
|
|
||||||
|
void convertSets()
|
||||||
|
{
|
||||||
|
vectorA = vectorFromString(stringA);
|
||||||
|
vectorB = vectorFromString(stringB);
|
||||||
|
vectorC = vectorFromString(stringC);
|
||||||
|
vectorD = vectorFromString(stringD);
|
||||||
|
}
|
||||||
|
|
||||||
|
void calculateAnswer()
|
||||||
|
{
|
||||||
|
vectorF = vectorD & (vectorA | vectorB) & ~vectorC;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToConsole(int vector)
|
||||||
|
{
|
||||||
|
for (int i = 0, k = 0; i < length; ++i)
|
||||||
|
if ((vector >> i) & 1)
|
||||||
|
cout << indexToMember(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToFile(int vector, ofstream& output)
|
||||||
|
{
|
||||||
|
for (int i = 0, k = 0; i < length; ++i)
|
||||||
|
if ((vector >> i) & 1)
|
||||||
|
output << indexToMember(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isSetEmpty(int vector)
|
||||||
|
{
|
||||||
|
if (vector == 0)
|
||||||
|
return 1;
|
||||||
|
else return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputAnswer()
|
||||||
|
{
|
||||||
|
cout << "Ответ: F = ";
|
||||||
|
if (isSetEmpty(vectorF))
|
||||||
|
cout << "пустое множество";
|
||||||
|
else
|
||||||
|
outputSetToConsole(vectorF);
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
double calulateDuration()
|
||||||
|
{
|
||||||
|
double firstPoint, lastPoint, duration = 0;
|
||||||
|
for (int i = 0; i < durationCoeff; i++)
|
||||||
|
{
|
||||||
|
firstPoint = clock();
|
||||||
|
calculateAnswer();
|
||||||
|
lastPoint = clock();
|
||||||
|
duration += lastPoint - firstPoint;
|
||||||
|
}
|
||||||
|
return duration / durationCoeff;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputDuration()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Временная сложность алгоритма - O(1), постоянное время" << endl;
|
||||||
|
cout << "На выполнение алгоритма уходит " << calulateDuration() << " секунд." << endl;
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
float factorial(int number)
|
||||||
|
{
|
||||||
|
float factorial = 1;
|
||||||
|
for (int i = 1; i <= number; i++)
|
||||||
|
factorial *= i;
|
||||||
|
return factorial;
|
||||||
|
}
|
||||||
|
|
||||||
|
int randomInt(int max)
|
||||||
|
{
|
||||||
|
return rand() % (max + 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned int randomVector(long long max)
|
||||||
|
{
|
||||||
|
return (rand() * 2 + randomInt(1)) * (rand() * 2 + randomInt(3));
|
||||||
|
}
|
||||||
|
|
||||||
|
void fillVectors()
|
||||||
|
{
|
||||||
|
unsigned int maxVector = pow(2, length) - 1;
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
{
|
||||||
|
vectorA = randomVector(maxVector);
|
||||||
|
vectorB = randomVector(maxVector);
|
||||||
|
vectorC = randomVector(maxVector);
|
||||||
|
vectorD = randomVector(maxVector);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void badInputLoop()
|
||||||
|
{
|
||||||
|
while (cin.fail() || customTestAmount < 0)
|
||||||
|
{
|
||||||
|
cout << "Неправильный ввод, повторите еще раз:" << endl;
|
||||||
|
cin.clear();
|
||||||
|
cin.ignore(32767, '\n');
|
||||||
|
cin >> customTestAmount;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void testInfo()
|
||||||
|
{
|
||||||
|
cout << setprecision(0);
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Из 26 символов может быть составлено " << factorial(length) << " перестановок" << endl;
|
||||||
|
cout << "Сколько программа должна проделать тестов со случайными комбинациями?" << endl;
|
||||||
|
cin >> customTestAmount;
|
||||||
|
badInputLoop();
|
||||||
|
if (customTestAmount > 0)
|
||||||
|
cout << "Отчеты будут выведены в файл " << filename << endl;
|
||||||
|
else cout << "Тесты не будут проделаны" << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputTestAnswer(ofstream& output)
|
||||||
|
{
|
||||||
|
if (isSetEmpty(vectorF))
|
||||||
|
output << "пустое множество";
|
||||||
|
else
|
||||||
|
outputSetToFile(vectorF, output);
|
||||||
|
}
|
||||||
|
|
||||||
|
void executeTest()
|
||||||
|
{
|
||||||
|
ofstream output;
|
||||||
|
output.open(filename);
|
||||||
|
for (int i = 0; i < customTestAmount; i++)
|
||||||
|
{
|
||||||
|
fillVectors();
|
||||||
|
vectorF = 0;
|
||||||
|
output << "Множество A: ";
|
||||||
|
outputSetToFile(vectorA, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество B: ";
|
||||||
|
outputSetToFile(vectorB, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество C: ";
|
||||||
|
outputSetToFile(vectorC, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество D: ";
|
||||||
|
outputSetToFile(vectorD, output);
|
||||||
|
output << endl;
|
||||||
|
calculateAnswer();
|
||||||
|
output << "Ответ: F = ";
|
||||||
|
outputTestAnswer(output);
|
||||||
|
output << endl;
|
||||||
|
output << '*' << endl;
|
||||||
|
}
|
||||||
|
output.close();
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
setupConsole();
|
||||||
|
outputGreeting();
|
||||||
|
input();
|
||||||
|
while (!isStringCorrect(stringA) || !isStringCorrect(stringB) || !isStringCorrect(stringC) || !isStringCorrect(stringD))
|
||||||
|
{
|
||||||
|
cout << "Некорректный ввод" << endl;
|
||||||
|
input();
|
||||||
|
}
|
||||||
|
convertSets();
|
||||||
|
calculateAnswer();
|
||||||
|
outputAnswer();
|
||||||
|
outputDuration();
|
||||||
|
testInfo();
|
||||||
|
executeTest();
|
||||||
|
}
|
||||||
31
Part1/Lab1/Mashinnoe/Lab1_1.sln
Normal file
31
Part1/Lab1/Mashinnoe/Lab1_1.sln
Normal file
@@ -0,0 +1,31 @@
|
|||||||
|
|
||||||
|
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||||
|
# Visual Studio Version 16
|
||||||
|
VisualStudioVersion = 16.0.31025.194
|
||||||
|
MinimumVisualStudioVersion = 10.0.40219.1
|
||||||
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Lab1_1", "Lab1_1.vcxproj", "{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}"
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||||
|
Debug|x64 = Debug|x64
|
||||||
|
Debug|x86 = Debug|x86
|
||||||
|
Release|x64 = Release|x64
|
||||||
|
Release|x86 = Release|x86
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Debug|x64.ActiveCfg = Debug|x64
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Debug|x64.Build.0 = Debug|x64
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Debug|x86.ActiveCfg = Debug|Win32
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Debug|x86.Build.0 = Debug|Win32
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Release|x64.ActiveCfg = Release|x64
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Release|x64.Build.0 = Release|x64
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Release|x86.ActiveCfg = Release|Win32
|
||||||
|
{8E1DEADF-98BA-4947-9AED-5486C2F7B9F5}.Release|x86.Build.0 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(SolutionProperties) = preSolution
|
||||||
|
HideSolutionNode = FALSE
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||||
|
SolutionGuid = {83E70304-D43D-4184-9D07-00854F397EB3}
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
150
Part1/Lab1/Mashinnoe/Lab1_1.vcxproj
Normal file
150
Part1/Lab1/Mashinnoe/Lab1_1.vcxproj
Normal file
@@ -0,0 +1,150 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup Label="ProjectConfigurations">
|
||||||
|
<ProjectConfiguration Include="Debug|Win32">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|Win32">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Debug|x64">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|x64">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
</ItemGroup>
|
||||||
|
<PropertyGroup Label="Globals">
|
||||||
|
<VCProjectVersion>16.0</VCProjectVersion>
|
||||||
|
<Keyword>Win32Proj</Keyword>
|
||||||
|
<ProjectGuid>{8e1deadf-98ba-4947-9aed-5486c2f7b9f5}</ProjectGuid>
|
||||||
|
<RootNamespace>Lab11</RootNamespace>
|
||||||
|
<WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||||
|
<ImportGroup Label="ExtensionSettings">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="Shared">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<PropertyGroup Label="UserMacros" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1_1.cpp" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt" />
|
||||||
|
</ItemGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||||
|
<ImportGroup Label="ExtensionTargets">
|
||||||
|
</ImportGroup>
|
||||||
|
</Project>
|
||||||
27
Part1/Lab1/Mashinnoe/Lab1_1.vcxproj.filters
Normal file
27
Part1/Lab1/Mashinnoe/Lab1_1.vcxproj.filters
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup>
|
||||||
|
<Filter Include="Исходные файлы">
|
||||||
|
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||||
|
<Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Файлы заголовков">
|
||||||
|
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||||
|
<Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Файлы ресурсов">
|
||||||
|
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||||
|
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||||
|
</Filter>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1_1.cpp">
|
||||||
|
<Filter>Исходные файлы</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt">
|
||||||
|
<Filter>Файлы ресурсов</Filter>
|
||||||
|
</Text>
|
||||||
|
</ItemGroup>
|
||||||
|
</Project>
|
||||||
4
Part1/Lab1/Mashinnoe/Lab1_1.vcxproj.user
Normal file
4
Part1/Lab1/Mashinnoe/Lab1_1.vcxproj.user
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<PropertyGroup />
|
||||||
|
</Project>
|
||||||
60
Part1/Lab1/Mashinnoe/Test_result.txt
Normal file
60
Part1/Lab1/Mashinnoe/Test_result.txt
Normal file
@@ -0,0 +1,60 @@
|
|||||||
|
Множество A: CDEHJKMNOTUVWYZ
|
||||||
|
Множество B: CDEFGHJMQRSUVX
|
||||||
|
Множество C: ACDEJNOPSUVWY
|
||||||
|
Множество D: BEFGHJKLMNOPRTUVYZ
|
||||||
|
Ответ: F = FGHKMRTZ
|
||||||
|
*
|
||||||
|
Множество A: CEFILMRSWY
|
||||||
|
Множество B: BCFIJKNOPRSTVWY
|
||||||
|
Множество C: BDEFIJKMOPQTUXYZ
|
||||||
|
Множество D: CHLMNSUYZ
|
||||||
|
Ответ: F = CLNS
|
||||||
|
*
|
||||||
|
Множество A: ABCEFGIJKNOQRTUVXYZ
|
||||||
|
Множество B: GHINPRSXYZ
|
||||||
|
Множество C: BCHJMNPQRSVWXZ
|
||||||
|
Множество D: DEGLMNOPQWYZ
|
||||||
|
Ответ: F = EGOY
|
||||||
|
*
|
||||||
|
Множество A: AHIJKMNOPQRSU
|
||||||
|
Множество B: BEFGHIMNOQRSTVWXZ
|
||||||
|
Множество C: BDEHIJKLOUVXY
|
||||||
|
Множество D: BCDEFLNQSUVWXY
|
||||||
|
Ответ: F = FNQSW
|
||||||
|
*
|
||||||
|
Множество A: AEFGJLNPVX
|
||||||
|
Множество B: BFJNOQRTVXY
|
||||||
|
Множество C: EFIJKMNOQRUXYZ
|
||||||
|
Множество D: MNPRT
|
||||||
|
Ответ: F = PT
|
||||||
|
*
|
||||||
|
Множество A: BCDEFHMOPRSTUX
|
||||||
|
Множество B: DEIKPQRTVWZ
|
||||||
|
Множество C: BCFJKMNOPRSXYZ
|
||||||
|
Множество D: DHIKLOPQTY
|
||||||
|
Ответ: F = DHIQT
|
||||||
|
*
|
||||||
|
Множество A: ABDGIJKMSVWXZ
|
||||||
|
Множество B: CIMNOPQRSUVW
|
||||||
|
Множество C: BCDFIKNSTUVWY
|
||||||
|
Множество D: CGHIJLMRSUWXYZ
|
||||||
|
Ответ: F = GJMRXZ
|
||||||
|
*
|
||||||
|
Множество A: ABDEHIRSTUWZ
|
||||||
|
Множество B: ABDGIJLOSTUZ
|
||||||
|
Множество C: ACEFHLOPTUWX
|
||||||
|
Множество D: CIKNOPQZ
|
||||||
|
Ответ: F = IZ
|
||||||
|
*
|
||||||
|
Множество A: CDEIJLMOQSTUWYZ
|
||||||
|
Множество B: CFJKLMNOQTUVWXZ
|
||||||
|
Множество C: AEJKMPRSWZ
|
||||||
|
Множество D: ABFHIKLMORTY
|
||||||
|
Ответ: F = FILOTY
|
||||||
|
*
|
||||||
|
Множество A: AHJLMNUVXYZ
|
||||||
|
Множество B: BFHIJKLNORTVYZ
|
||||||
|
Множество C: FGJKLNPRSWX
|
||||||
|
Множество D: CHINPQRSTUV
|
||||||
|
Ответ: F = HITUV
|
||||||
|
*
|
||||||
189
Part1/Lab1/Mashinnoe/zavtrak.cpp
Normal file
189
Part1/Lab1/Mashinnoe/zavtrak.cpp
Normal file
@@ -0,0 +1,189 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
const int length = 32;
|
||||||
|
const char universum[] = "АБВГДЕЖЗИЙКЛМНОПРСТУФХЦЧШЩЪЫЬЭЮЯ";
|
||||||
|
char stringA[length];
|
||||||
|
char stringB[length];
|
||||||
|
char stringC[length];
|
||||||
|
char stringD[length];
|
||||||
|
bool vectorA[length], vectorB[length], vectorC[length], vectorD[length], vectorF[length];
|
||||||
|
double firstTimePoint, lastTimePoint, totalTime = 0;
|
||||||
|
const char filename[] = "output.txt";
|
||||||
|
const int testAmount = 10;
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
void setupConsole()
|
||||||
|
{
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
SetConsoleOutputCP(1251);
|
||||||
|
SetConsoleCP(1251);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputGreeting()
|
||||||
|
{
|
||||||
|
cout << "Программа рассчитывает значение множества F согласно следующим законам - " << endl;
|
||||||
|
cout << "F = A - (B v C v D), что равносильно F = A - B - C - D." << endl;
|
||||||
|
cout << "Универсум: " << universum << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void input()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "Введите множество A: ";
|
||||||
|
cin >> stringA;
|
||||||
|
cout << "Введите множество B: ";
|
||||||
|
cin >> stringB;
|
||||||
|
cout << "Введите множество C: ";
|
||||||
|
cin >> stringC;
|
||||||
|
cout << "Введите множество D: ";
|
||||||
|
cin >> stringD;
|
||||||
|
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
int memberToIndex(char member)
|
||||||
|
{
|
||||||
|
return member - 'А';
|
||||||
|
}
|
||||||
|
|
||||||
|
char indexToMember(int number)
|
||||||
|
{
|
||||||
|
return number + 'А';
|
||||||
|
}
|
||||||
|
|
||||||
|
void vectorFromString(bool*vector, const char string[])
|
||||||
|
{
|
||||||
|
for (int i = 0; string[i]; i++)
|
||||||
|
vector[memberToIndex(string[i])] = 1;
|
||||||
|
};
|
||||||
|
|
||||||
|
void convertSets()
|
||||||
|
{
|
||||||
|
vectorFromString(vectorA, stringA);
|
||||||
|
vectorFromString(vectorB, stringB);
|
||||||
|
vectorFromString(vectorC, stringC);
|
||||||
|
vectorFromString(vectorD, stringD);
|
||||||
|
}
|
||||||
|
|
||||||
|
void calculateAnswer()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
vectorF[i] = (vectorA[i] && !vectorB[i] && !vectorC[i] && !vectorD[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToConsole(bool(&vector)[length])
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; ++i)
|
||||||
|
if (vector[i])
|
||||||
|
cout << indexToMember(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToFile(bool(&vector)[length], ofstream& output)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; ++i)
|
||||||
|
if (vector[i])
|
||||||
|
output << indexToMember(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
void executeTask()
|
||||||
|
{
|
||||||
|
convertSets();
|
||||||
|
calculateAnswer();
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputAnswer()
|
||||||
|
{
|
||||||
|
cout << "Ответ: F = ";
|
||||||
|
outputSetToConsole(vectorF);
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
int factorial(int number)
|
||||||
|
{
|
||||||
|
int factorial = 1;
|
||||||
|
for (int i = 1; i <= number; i++)
|
||||||
|
factorial *= number;
|
||||||
|
return factorial;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool randomBool()
|
||||||
|
{
|
||||||
|
return rand() % 2;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fillVectors()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
{
|
||||||
|
vectorA[i] = randomBool();
|
||||||
|
vectorB[i] = randomBool();
|
||||||
|
vectorC[i] = randomBool();
|
||||||
|
vectorD[i] = randomBool();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void clearAnswerVector()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
vectorF[i] = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void executeTest()
|
||||||
|
{
|
||||||
|
ofstream output;
|
||||||
|
output.open(filename);
|
||||||
|
for (int i = 0; i < testAmount; i++)
|
||||||
|
{
|
||||||
|
fillVectors();
|
||||||
|
clearAnswerVector();
|
||||||
|
output << "Множество A: ";
|
||||||
|
outputSetToFile(vectorA, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество B: ";
|
||||||
|
outputSetToFile(vectorB, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество C: ";
|
||||||
|
outputSetToFile(vectorC, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество D: ";
|
||||||
|
outputSetToFile(vectorD, output);
|
||||||
|
output << endl;
|
||||||
|
firstTimePoint = clock();
|
||||||
|
calculateAnswer();
|
||||||
|
lastTimePoint = clock();
|
||||||
|
totalTime += lastTimePoint - firstTimePoint;
|
||||||
|
output << "Ответ: F = ";
|
||||||
|
outputSetToFile(vectorF, output);
|
||||||
|
output << endl;
|
||||||
|
output << '*' << endl;
|
||||||
|
}
|
||||||
|
output.close();
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputTestInfo()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Из 33 символов может быть составлено " << factorial(length) << " перестановок" << endl;
|
||||||
|
cout << "Программой будут рассмотрены лишь " << testAmount << " случайных комбинаций" << endl;
|
||||||
|
cout << "Отчеты будут выведены в файл output.txt" << endl;
|
||||||
|
cout << "На выполнение алгоритма уходит " << totalTime / 1000 << " секунд." << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
setupConsole();
|
||||||
|
outputGreeting();
|
||||||
|
input();
|
||||||
|
executeTask();
|
||||||
|
outputAnswer();
|
||||||
|
executeTest();
|
||||||
|
outputTestInfo();
|
||||||
|
}
|
||||||
288
Part1/Lab1/Massiv_simv/Lab1_3.cpp
Normal file
288
Part1/Lab1/Massiv_simv/Lab1_3.cpp
Normal file
@@ -0,0 +1,288 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
#include <iomanip>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
const char universum[] = "ABCDEFGHIJKMNLOPQRSTUVWXYZ";
|
||||||
|
const char filename[] = "Test_result.txt";
|
||||||
|
const int length = 26;
|
||||||
|
const int durationCoeff = 1000000;
|
||||||
|
int customTestAmount = 0;
|
||||||
|
char stringA[length], stringB[length], stringC[length], stringD[length];
|
||||||
|
char vectorA[length], vectorB[length], vectorC[length], vectorD[length], vectorF[length];
|
||||||
|
|
||||||
|
|
||||||
|
void setupConsole()
|
||||||
|
{
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
SetConsoleOutputCP(1251);
|
||||||
|
SetConsoleCP(1251);
|
||||||
|
cout << fixed << setprecision(7);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputGreeting()
|
||||||
|
{
|
||||||
|
cout << "Программа рассчитывает значение множества F согласно следующим законам - " << endl;
|
||||||
|
cout << "F = D && (A || B) && !C, что равносильно F = D*(A + B) - C." << endl;
|
||||||
|
cout << "Универсум: " << universum << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void input()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Введите множество A: ";
|
||||||
|
cin >> stringA;
|
||||||
|
cout << "Введите множество B: ";
|
||||||
|
cin >> stringB;
|
||||||
|
cout << "Введите множество C: ";
|
||||||
|
cin >> stringC;
|
||||||
|
cout << "Введите множество D: ";
|
||||||
|
cin >> stringD;
|
||||||
|
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isCorrectSymbol(char symbol)
|
||||||
|
{
|
||||||
|
return ((symbol >= universum[0] && symbol <= universum[length - 1]) || symbol == '\0') ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isStringCorrect(char* string)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length && string[i] != '\0'; i++)
|
||||||
|
if (!isCorrectSymbol(string[i]))
|
||||||
|
return 0;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
int memberToIndex(char member)
|
||||||
|
{
|
||||||
|
return member - universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
char indexToMember(int number)
|
||||||
|
{
|
||||||
|
return number + universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
void vectorFromString(char* vector, const char string[])
|
||||||
|
{
|
||||||
|
for (int i = 0; string[i]; i++) {
|
||||||
|
int j = 0;
|
||||||
|
for (j = 0; j < i; j++) {
|
||||||
|
if (memberToIndex(string[i]) < memberToIndex(vector[j])) {
|
||||||
|
for (int k = i + 1; k > j; k--) {
|
||||||
|
vector[k] = vector[k - 1];
|
||||||
|
}
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (memberToIndex(string[i]) == memberToIndex(vector[j])) {
|
||||||
|
j = -1;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if(j != -1) vector[j] = string[i];
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
void convertSets()
|
||||||
|
{
|
||||||
|
vectorFromString(vectorA, stringA);
|
||||||
|
vectorFromString(vectorB, stringB);
|
||||||
|
vectorFromString(vectorC, stringC);
|
||||||
|
vectorFromString(vectorD, stringD);
|
||||||
|
}
|
||||||
|
|
||||||
|
void calculateAnswer()
|
||||||
|
{
|
||||||
|
for (int i = 0; vectorA[i]; i++)
|
||||||
|
vectorF[i] = vectorA[i];
|
||||||
|
|
||||||
|
int j = 0;
|
||||||
|
for (int i = 0; vectorB[i]; i++) {
|
||||||
|
while (j < strlen(vectorF) && memberToIndex(vectorB[i]) > memberToIndex(vectorF[j])) j++;
|
||||||
|
if (memberToIndex(vectorB[i]) != memberToIndex(vectorF[j])) {
|
||||||
|
for (int k = strlen(vectorF); k >= j; k--) vectorF[k + 1] = vectorF[k];
|
||||||
|
vectorF[j] = vectorB[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
j = 0;
|
||||||
|
for (int i = 0; vectorC[i]; i++) {
|
||||||
|
while (j < strlen(vectorF) && memberToIndex(vectorC[i]) > memberToIndex(vectorF[j])) j++;
|
||||||
|
if (memberToIndex(vectorC[i]) == memberToIndex(vectorF[j])) {
|
||||||
|
for (int k = j; k < strlen(vectorF); k++) vectorF[k] = vectorF[k + 1];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
j = 0;
|
||||||
|
for (int i = 0; vectorD[i]; i++) {
|
||||||
|
while (j < strlen(vectorF) && memberToIndex(vectorD[i]) > memberToIndex(vectorF[j])) {
|
||||||
|
for (int k = j; k < strlen(vectorF); k++) vectorF[k] = vectorF[k + 1];
|
||||||
|
}
|
||||||
|
if (memberToIndex(vectorD[i]) == memberToIndex(vectorF[j])) j++;
|
||||||
|
}
|
||||||
|
for (j; j < strlen(vectorF); j++) {
|
||||||
|
vectorF[j] = '\0';
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToConsole(char* vector)
|
||||||
|
{
|
||||||
|
for (int i = 0; vector[i]; i++)
|
||||||
|
cout << vector[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToFile(char* vector, ofstream& output)
|
||||||
|
{
|
||||||
|
for (int i = 0; vector[i]; i++)
|
||||||
|
output << vector[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isSetEmpty(char* vector)
|
||||||
|
{
|
||||||
|
return (vector[0] == '\0') ? true : false;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputAnswer()
|
||||||
|
{
|
||||||
|
cout << "Ответ: F = ";
|
||||||
|
if (isSetEmpty(vectorF))
|
||||||
|
cout << "пустое множество";
|
||||||
|
else
|
||||||
|
outputSetToConsole(vectorF);
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
double calulateDuration()
|
||||||
|
{
|
||||||
|
double firstPoint, lastPoint, duration = 0;
|
||||||
|
for (int i = 0; i < durationCoeff; i++)
|
||||||
|
{
|
||||||
|
firstPoint = clock();
|
||||||
|
calculateAnswer();
|
||||||
|
lastPoint = clock();
|
||||||
|
duration += lastPoint - firstPoint;
|
||||||
|
}
|
||||||
|
return duration / durationCoeff;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputDuration()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Временная сложность алгоритма - O(1), постоянное время" << endl;
|
||||||
|
cout << "На выполнение алгоритма уходит " << calulateDuration() << " секунд." << endl;
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
float factorial(int number)
|
||||||
|
{
|
||||||
|
float factorial = 1;
|
||||||
|
for (int i = 1; i <= number; i++)
|
||||||
|
factorial *= i;
|
||||||
|
return factorial;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool randomVector()
|
||||||
|
{
|
||||||
|
return rand() % 2;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fillVectors()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++) {
|
||||||
|
vectorA[i] = '\0';
|
||||||
|
vectorB[i] = '\0';
|
||||||
|
vectorC[i] = '\0';
|
||||||
|
vectorD[i] = '\0';
|
||||||
|
}
|
||||||
|
for (int i = 0; i < length; i++) {
|
||||||
|
if (randomVector()) vectorA[strlen(vectorA)] = indexToMember(i);
|
||||||
|
if (randomVector()) vectorB[strlen(vectorB)] = indexToMember(i);
|
||||||
|
if (randomVector()) vectorC[strlen(vectorC)] = indexToMember(i);
|
||||||
|
if (randomVector()) vectorD[strlen(vectorD)] = indexToMember(i);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void clearAnswerVector()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < strlen(vectorF); i++)
|
||||||
|
vectorF[i] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
void badInputLoop()
|
||||||
|
{
|
||||||
|
while (cin.fail() || customTestAmount < 0)
|
||||||
|
{
|
||||||
|
cout << "Неправильный ввод, повторите еще раз:" << endl;
|
||||||
|
cin.clear();
|
||||||
|
cin.ignore(32767, '\n');
|
||||||
|
cin >> customTestAmount;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void testInfo()
|
||||||
|
{
|
||||||
|
cout << setprecision(0);
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Из 26 символов может быть составлено " << factorial(length) << " перестановок" << endl;
|
||||||
|
cout << "Сколько программа должна проделать тестов со случайными комбинациями?" << endl;
|
||||||
|
cin >> customTestAmount;
|
||||||
|
badInputLoop();
|
||||||
|
if (customTestAmount > 0)
|
||||||
|
cout << "Отчеты будут выведены в файл " << filename << endl;
|
||||||
|
else cout << "Тесты не будут проделаны" << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void executeTest()
|
||||||
|
{
|
||||||
|
ofstream output;
|
||||||
|
output.open(filename);
|
||||||
|
for (int i = 0; i < customTestAmount; i++)
|
||||||
|
{
|
||||||
|
fillVectors();
|
||||||
|
clearAnswerVector();
|
||||||
|
output << "Множество A: ";
|
||||||
|
outputSetToFile(vectorA, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество B: ";
|
||||||
|
outputSetToFile(vectorB, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество C: ";
|
||||||
|
outputSetToFile(vectorC, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество D: ";
|
||||||
|
outputSetToFile(vectorD, output);
|
||||||
|
output << endl;
|
||||||
|
calculateAnswer();
|
||||||
|
output << "Ответ: F = ";
|
||||||
|
outputSetToFile(vectorF, output);
|
||||||
|
output << endl;
|
||||||
|
output << '*' << endl;
|
||||||
|
}
|
||||||
|
output.close();
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
setupConsole();
|
||||||
|
outputGreeting();
|
||||||
|
input();
|
||||||
|
while (!isStringCorrect(stringA) || !isStringCorrect(stringB) || !isStringCorrect(stringC) || !isStringCorrect(stringD))
|
||||||
|
{
|
||||||
|
cout << "Некорректный ввод" << endl;
|
||||||
|
input();
|
||||||
|
}
|
||||||
|
convertSets();
|
||||||
|
calculateAnswer();
|
||||||
|
outputAnswer();
|
||||||
|
outputDuration();
|
||||||
|
testInfo();
|
||||||
|
executeTest();
|
||||||
|
}
|
||||||
60
Part1/Lab1/Massiv_simv/Test_result.txt
Normal file
60
Part1/Lab1/Massiv_simv/Test_result.txt
Normal file
@@ -0,0 +1,60 @@
|
|||||||
|
Множество A: ABDEFIJKLMOUWZ
|
||||||
|
Множество B: ADHJKNOPSTUXZ
|
||||||
|
Множество C: CDEGHIJLMNOTXYZ
|
||||||
|
Множество D: CDFKLNRWY
|
||||||
|
Ответ: F = FKW
|
||||||
|
*
|
||||||
|
Множество A: BDFGHIJKLTVY
|
||||||
|
Множество B: DFIJKNOPSVWXZ
|
||||||
|
Множество C: ABDEFIJKMPQTWXYZ
|
||||||
|
Множество D: BCIJNOPRTVWY
|
||||||
|
Ответ: F = NOV
|
||||||
|
*
|
||||||
|
Множество A: CDGNOPSTVWYZ
|
||||||
|
Множество B: ABCDIJKLPQTUVXY
|
||||||
|
Множество C: BCGJMPQRSWZ
|
||||||
|
Множество D: CDFGIMORSTWY
|
||||||
|
Ответ: F = DIOTY
|
||||||
|
*
|
||||||
|
Множество A: BCDFHJMOPRVWYZ
|
||||||
|
Множество B: ACDEGHNPRSUVXYZ
|
||||||
|
Множество C: ABDHJKLMSUWZ
|
||||||
|
Множество D: ABCFGHILNPRVY
|
||||||
|
Ответ: F = CFGNPRVY
|
||||||
|
*
|
||||||
|
Множество A: ABCEGHIKLMPRSUX
|
||||||
|
Множество B: COUXZ
|
||||||
|
Множество C: ABEFIQRSTUWX
|
||||||
|
Множество D: ABFGIKMNOPQRUWYZ
|
||||||
|
Ответ: F = GKMOPZ
|
||||||
|
*
|
||||||
|
Множество A: BDEGHIKMNOPSTVY
|
||||||
|
Множество B: ABCEIJKNRSUVZ
|
||||||
|
Множество C: BCDEFGKLMNQRSTUVWXY
|
||||||
|
Множество D: JKMNOQRUWXZ
|
||||||
|
Ответ: F = JOZ
|
||||||
|
*
|
||||||
|
Множество A: BFGHIKLNOPQRUVWZ
|
||||||
|
Множество B: BEHJLMPRSVWX
|
||||||
|
Множество C: ABCIJMOPQRTXY
|
||||||
|
Множество D: BCDEGILMNOQSVWY
|
||||||
|
Ответ: F = EGLNSVW
|
||||||
|
*
|
||||||
|
Множество A: BDFGKLMNPTVXZ
|
||||||
|
Множество B: ADFJKLNSXYZ
|
||||||
|
Множество C: ACDEFGHJMNQSTUWX
|
||||||
|
Множество D: ABHIJKLMNQRTUVW
|
||||||
|
Ответ: F = BKLV
|
||||||
|
*
|
||||||
|
Множество A: BDGHJLNPQRTVWYZ
|
||||||
|
Множество B: BGHJQTUVWZ
|
||||||
|
Множество C: CHKLMPUXZ
|
||||||
|
Множество D: BCDFGMOQRSTUWYZ
|
||||||
|
Ответ: F = BDGQRTWY
|
||||||
|
*
|
||||||
|
Множество A: ABCEGHJLMQRTUVXZ
|
||||||
|
Множество B: ACFGILMNRVWX
|
||||||
|
Множество C: BFHIJMOQUWY
|
||||||
|
Множество D: BCFJLMNOPSVY
|
||||||
|
Ответ: F = CLNV
|
||||||
|
*
|
||||||
31
Part1/Lab1/Massiv_simv/lab1_3.sln
Normal file
31
Part1/Lab1/Massiv_simv/lab1_3.sln
Normal file
@@ -0,0 +1,31 @@
|
|||||||
|
|
||||||
|
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||||
|
# Visual Studio Version 16
|
||||||
|
VisualStudioVersion = 16.0.30804.86
|
||||||
|
MinimumVisualStudioVersion = 10.0.40219.1
|
||||||
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "lab1_3", "lab1_3.vcxproj", "{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}"
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||||
|
Debug|x64 = Debug|x64
|
||||||
|
Debug|x86 = Debug|x86
|
||||||
|
Release|x64 = Release|x64
|
||||||
|
Release|x86 = Release|x86
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Debug|x64.ActiveCfg = Debug|x64
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Debug|x64.Build.0 = Debug|x64
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Debug|x86.ActiveCfg = Debug|Win32
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Debug|x86.Build.0 = Debug|Win32
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Release|x64.ActiveCfg = Release|x64
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Release|x64.Build.0 = Release|x64
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Release|x86.ActiveCfg = Release|Win32
|
||||||
|
{945AD67E-9CAA-4BA6-B7B2-937E53F8E45B}.Release|x86.Build.0 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(SolutionProperties) = preSolution
|
||||||
|
HideSolutionNode = FALSE
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||||
|
SolutionGuid = {4FCBA152-888E-40B7-A874-3297AD785AB2}
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
150
Part1/Lab1/Massiv_simv/lab1_3.vcxproj
Normal file
150
Part1/Lab1/Massiv_simv/lab1_3.vcxproj
Normal file
@@ -0,0 +1,150 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup Label="ProjectConfigurations">
|
||||||
|
<ProjectConfiguration Include="Debug|Win32">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|Win32">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Debug|x64">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|x64">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
</ItemGroup>
|
||||||
|
<PropertyGroup Label="Globals">
|
||||||
|
<VCProjectVersion>16.0</VCProjectVersion>
|
||||||
|
<Keyword>Win32Proj</Keyword>
|
||||||
|
<ProjectGuid>{945ad67e-9caa-4ba6-b7b2-937e53f8e45b}</ProjectGuid>
|
||||||
|
<RootNamespace>lab13</RootNamespace>
|
||||||
|
<WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||||
|
<ImportGroup Label="ExtensionSettings">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="Shared">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<PropertyGroup Label="UserMacros" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1_3.cpp" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt" />
|
||||||
|
</ItemGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||||
|
<ImportGroup Label="ExtensionTargets">
|
||||||
|
</ImportGroup>
|
||||||
|
</Project>
|
||||||
27
Part1/Lab1/Massiv_simv/lab1_3.vcxproj.filters
Normal file
27
Part1/Lab1/Massiv_simv/lab1_3.vcxproj.filters
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup>
|
||||||
|
<Filter Include="Source Files">
|
||||||
|
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||||
|
<Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Header Files">
|
||||||
|
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||||
|
<Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Resource Files">
|
||||||
|
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||||
|
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||||
|
</Filter>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1_3.cpp">
|
||||||
|
<Filter>Source Files</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt">
|
||||||
|
<Filter>Resource Files</Filter>
|
||||||
|
</Text>
|
||||||
|
</ItemGroup>
|
||||||
|
</Project>
|
||||||
4
Part1/Lab1/Massiv_simv/lab1_3.vcxproj.user
Normal file
4
Part1/Lab1/Massiv_simv/lab1_3.vcxproj.user
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<PropertyGroup />
|
||||||
|
</Project>
|
||||||
376
Part1/Lab1/Spiski/Lab1_2.cpp
Normal file
376
Part1/Lab1/Spiski/Lab1_2.cpp
Normal file
@@ -0,0 +1,376 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
#include <iomanip>
|
||||||
|
|
||||||
|
struct Set {
|
||||||
|
char el;
|
||||||
|
Set* next;
|
||||||
|
Set(char e, Set* n = nullptr) : el(e), next(n) { }
|
||||||
|
~Set() { delete next; }
|
||||||
|
};
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
const char universum[] = "ABCDEFGHIJKMNLOPQRSTUVWXYZ";
|
||||||
|
const char filename[] = "Test_result.txt";
|
||||||
|
const int length = 26;
|
||||||
|
const int durationCoeff = 1000000;
|
||||||
|
int customTestAmount = 0;
|
||||||
|
char stringA[length], stringB[length], stringC[length], stringD[length];
|
||||||
|
Set *vectorA = nullptr, *vectorB = nullptr, *vectorC = nullptr, *vectorD = nullptr, *vectorF = nullptr;
|
||||||
|
|
||||||
|
|
||||||
|
void setupConsole()
|
||||||
|
{
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
SetConsoleOutputCP(1251);
|
||||||
|
SetConsoleCP(1251);
|
||||||
|
cout << fixed << setprecision(7);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputGreeting()
|
||||||
|
{
|
||||||
|
cout << "Ïðîãðàììà ðàññ÷èòûâàåò çíà÷åíèå ìíîæåñòâà F ñîãëàñíî ñëåäóþùèì çàêîíàì - " << endl;
|
||||||
|
cout << "F = D && (A || B) && !C, ÷òî ðàâíîñèëüíî F = D*(A + B) - C." << endl;
|
||||||
|
cout << "Óíèâåðñóì: " << universum << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void input()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Ââåäèòå ìíîæåñòâî A: ";
|
||||||
|
cin >> stringA;
|
||||||
|
cout << "Ââåäèòå ìíîæåñòâî B: ";
|
||||||
|
cin >> stringB;
|
||||||
|
cout << "Ââåäèòå ìíîæåñòâî C: ";
|
||||||
|
cin >> stringC;
|
||||||
|
cout << "Ââåäèòå ìíîæåñòâî D: ";
|
||||||
|
cin >> stringD;
|
||||||
|
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isCorrectSymbol(char symbol)
|
||||||
|
{
|
||||||
|
return ((symbol >= universum[0] && symbol <= universum[length - 1]) || symbol == '\0') ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isStringCorrect(char* string)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length && string[i] != '\0'; i++)
|
||||||
|
if (!isCorrectSymbol(string[i]))
|
||||||
|
return 0;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
int memberToIndex(char member)
|
||||||
|
{
|
||||||
|
return member - universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
char indexToMember(int number)
|
||||||
|
{
|
||||||
|
return number + universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
Set* vectorFromString(Set* vector, const char string[])
|
||||||
|
{
|
||||||
|
Set* p = vector;
|
||||||
|
for (int i = 0; string[i]; i++) {
|
||||||
|
if (p) {
|
||||||
|
p = vector;
|
||||||
|
if (memberToIndex(vector->el) > memberToIndex(string[i])) {
|
||||||
|
p = new Set(string[i], vector);
|
||||||
|
vector = p;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
while (p->next && memberToIndex(p->next->el) < memberToIndex(string[i])) p = p->next;
|
||||||
|
if (p->next) p->next = new Set(string[i], p->next);
|
||||||
|
else {
|
||||||
|
if (memberToIndex(p->el) < memberToIndex(string[i])) p->next = new Set(string[i]);
|
||||||
|
else {
|
||||||
|
if (memberToIndex(p->el) != memberToIndex(string[i])) {
|
||||||
|
p->next = new Set(string[i], p->next);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
vector = new Set(string[i]);
|
||||||
|
p = vector;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return vector;
|
||||||
|
}
|
||||||
|
|
||||||
|
void convertSets()
|
||||||
|
{
|
||||||
|
vectorA = vectorFromString(vectorA, stringA);
|
||||||
|
vectorB = vectorFromString(vectorB, stringB);
|
||||||
|
vectorC = vectorFromString(vectorC, stringC);
|
||||||
|
vectorD = vectorFromString(vectorD, stringD);
|
||||||
|
}
|
||||||
|
|
||||||
|
void calculateAnswer()
|
||||||
|
{
|
||||||
|
Set* pF = vectorF;
|
||||||
|
for (Set* pA = vectorA; pA; pA = pA->next) {
|
||||||
|
if (pF) {
|
||||||
|
pF->next = new Set(pA->el);
|
||||||
|
pF = pF->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pF = new Set(pA->el);
|
||||||
|
vectorF = pF;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pF = vectorF;
|
||||||
|
for (Set* pB = vectorB; pB; pB = pB->next) {
|
||||||
|
if (pF) {
|
||||||
|
while (pF->next && memberToIndex(pF->next->el) < memberToIndex(pB->el)) pF = pF->next;
|
||||||
|
if (!pF->next || memberToIndex(pF->next->el) != memberToIndex(pB->el)) {
|
||||||
|
if (pF == vectorF) {
|
||||||
|
if (memberToIndex(pB->el) <= memberToIndex(pF->el)) {
|
||||||
|
pF = new Set(pB->el, vectorF);
|
||||||
|
vectorF = pF;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pF->next = new Set(pB->el, pF->next);
|
||||||
|
pF = pF->next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pF = new Set(pB->el);
|
||||||
|
vectorF = pF;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pF = vectorF;
|
||||||
|
for (Set* pC = vectorC; pC && pF; pC = pC->next) {
|
||||||
|
if (memberToIndex(pF->el) == memberToIndex(pC->el) && pF == vectorF) {
|
||||||
|
vectorF = pF->next;
|
||||||
|
pF = pF->next;
|
||||||
|
}
|
||||||
|
while (pF && pF->next && memberToIndex(pF->next->el) < memberToIndex(pC->el)) pF = pF->next;
|
||||||
|
if (pF && pF->next && memberToIndex(pF->next->el) == memberToIndex(pC->el)) pF->next = pF->next->next;
|
||||||
|
}
|
||||||
|
pF = vectorF;
|
||||||
|
Set* last = nullptr;
|
||||||
|
for (Set* pD = vectorD; pD; pD = pD->next) {
|
||||||
|
while (pF && memberToIndex(pF->el) < memberToIndex(pD->el)) pF = pF->next;
|
||||||
|
if (pF && memberToIndex(pF->el) == memberToIndex(pD->el)) {
|
||||||
|
if (last == nullptr) {
|
||||||
|
last = pF;
|
||||||
|
vectorF = pF;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
last->next = pF;
|
||||||
|
last = pF;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if(pF) last->next = nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToConsole(Set* vector)
|
||||||
|
{
|
||||||
|
for (Set* p = vector; p; p = p->next)
|
||||||
|
cout << p->el;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToFile(Set* vector, ofstream& output)
|
||||||
|
{
|
||||||
|
for (Set* p = vector; p; p = p->next)
|
||||||
|
output << p->el;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isSetEmpty(Set* vector)
|
||||||
|
{
|
||||||
|
return vector ? 0 : 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputAnswer()
|
||||||
|
{
|
||||||
|
cout << "Îòâåò: F = ";
|
||||||
|
if (isSetEmpty(vectorF))
|
||||||
|
cout << "ïóñòîå ìíîæåñòâî";
|
||||||
|
else
|
||||||
|
outputSetToConsole(vectorF);
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
double calulateDuration()
|
||||||
|
{
|
||||||
|
double firstPoint, lastPoint, duration = 0;
|
||||||
|
for (int i = 0; i < durationCoeff; i++)
|
||||||
|
{
|
||||||
|
firstPoint = clock();
|
||||||
|
calculateAnswer();
|
||||||
|
lastPoint = clock();
|
||||||
|
duration += lastPoint - firstPoint;
|
||||||
|
}
|
||||||
|
return duration / durationCoeff;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputDuration()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Âðåìåííàÿ ñëîæíîñòü àëãîðèòìà - O(1), ïîñòîÿííîå âðåìÿ" << endl;
|
||||||
|
cout << "Íà âûïîëíåíèå àëãîðèòìà óõîäèò " << calulateDuration() << " ñåêóíä." << endl;
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
float factorial(int number)
|
||||||
|
{
|
||||||
|
float factorial = 1;
|
||||||
|
for (int i = 1; i <= number; i++)
|
||||||
|
factorial *= i;
|
||||||
|
return factorial;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool randomVector()
|
||||||
|
{
|
||||||
|
return rand() % 2;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fillVectors()
|
||||||
|
{
|
||||||
|
Set* pA = vectorA, * pB = vectorB, * pC = vectorC, * pD = vectorD;
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
{
|
||||||
|
if (randomVector()) {
|
||||||
|
if (pA) {
|
||||||
|
pA->next = new Set(indexToMember(i));
|
||||||
|
pA = pA->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
vectorA = new Set(indexToMember(i));
|
||||||
|
pA = vectorA;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (randomVector()) {
|
||||||
|
if (pB) {
|
||||||
|
pB->next = new Set(indexToMember(i));
|
||||||
|
pB = pB->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
vectorB = new Set(indexToMember(i));
|
||||||
|
pB = vectorB;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (randomVector()) {
|
||||||
|
if (pC) {
|
||||||
|
pC->next = new Set(indexToMember(i));
|
||||||
|
pC = pC->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
vectorC = new Set(indexToMember(i));
|
||||||
|
pC = vectorC;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (randomVector()) {
|
||||||
|
if (pD) {
|
||||||
|
pD->next = new Set(indexToMember(i));
|
||||||
|
pD = pD->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
vectorD = new Set(indexToMember(i));
|
||||||
|
pD = vectorD;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void clearAnswerVector()
|
||||||
|
{
|
||||||
|
delete vectorA;
|
||||||
|
vectorA = nullptr;
|
||||||
|
delete vectorB;
|
||||||
|
vectorB = nullptr;
|
||||||
|
delete vectorC;
|
||||||
|
vectorC = nullptr;
|
||||||
|
delete vectorD;
|
||||||
|
vectorD = nullptr;
|
||||||
|
delete vectorF;
|
||||||
|
vectorF = nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
void badInputLoop()
|
||||||
|
{
|
||||||
|
while (cin.fail() || customTestAmount < 0)
|
||||||
|
{
|
||||||
|
cout << "Íåïðàâèëüíûé ââîä, ïîâòîðèòå åùå ðàç:" << endl;
|
||||||
|
cin.clear();
|
||||||
|
cin.ignore(32767, '\n');
|
||||||
|
cin >> customTestAmount;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void testInfo()
|
||||||
|
{
|
||||||
|
cout << setprecision(0);
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Èç 26 ñèìâîëîâ ìîæåò áûòü ñîñòàâëåíî " << factorial(length) << " ïåðåñòàíîâîê" << endl;
|
||||||
|
cout << "Ñêîëüêî ïðîãðàììà äîëæíà ïðîäåëàòü òåñòîâ ñî ñëó÷àéíûìè êîìáèíàöèÿìè?" << endl;
|
||||||
|
cin >> customTestAmount;
|
||||||
|
badInputLoop();
|
||||||
|
if (customTestAmount > 0)
|
||||||
|
cout << "Îò÷åòû áóäóò âûâåäåíû â ôàéë " << filename << endl;
|
||||||
|
else cout << "Òåñòû íå áóäóò ïðîäåëàíû" << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void executeTest()
|
||||||
|
{
|
||||||
|
ofstream output;
|
||||||
|
output.open(filename);
|
||||||
|
for (int i = 0; i < customTestAmount; i++)
|
||||||
|
{
|
||||||
|
clearAnswerVector();
|
||||||
|
fillVectors();
|
||||||
|
output << "Ìíîæåñòâî A: ";
|
||||||
|
outputSetToFile(vectorA, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Ìíîæåñòâî B: ";
|
||||||
|
outputSetToFile(vectorB, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Ìíîæåñòâî C: ";
|
||||||
|
outputSetToFile(vectorC, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Ìíîæåñòâî D: ";
|
||||||
|
outputSetToFile(vectorD, output);
|
||||||
|
output << endl;
|
||||||
|
calculateAnswer();
|
||||||
|
output << "Îòâåò: F = ";
|
||||||
|
outputSetToFile(vectorF, output);
|
||||||
|
output << endl;
|
||||||
|
output << '*' << endl;
|
||||||
|
}
|
||||||
|
output.close();
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
setupConsole();
|
||||||
|
outputGreeting();
|
||||||
|
input();
|
||||||
|
while (!isStringCorrect(stringA) || !isStringCorrect(stringB) || !isStringCorrect(stringC) || !isStringCorrect(stringD))
|
||||||
|
{
|
||||||
|
cout << "Íåêîððåêòíûé ââîä" << endl;
|
||||||
|
input();
|
||||||
|
}
|
||||||
|
convertSets();
|
||||||
|
calculateAnswer();
|
||||||
|
outputAnswer();
|
||||||
|
outputDuration();
|
||||||
|
testInfo();
|
||||||
|
executeTest();
|
||||||
|
}
|
||||||
31
Part1/Lab1/Spiski/Lab1_2.sln
Normal file
31
Part1/Lab1/Spiski/Lab1_2.sln
Normal file
@@ -0,0 +1,31 @@
|
|||||||
|
|
||||||
|
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||||
|
# Visual Studio Version 16
|
||||||
|
VisualStudioVersion = 16.0.30804.86
|
||||||
|
MinimumVisualStudioVersion = 10.0.40219.1
|
||||||
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Lab1_2", "Lab1_2.vcxproj", "{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}"
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||||
|
Debug|x64 = Debug|x64
|
||||||
|
Debug|x86 = Debug|x86
|
||||||
|
Release|x64 = Release|x64
|
||||||
|
Release|x86 = Release|x86
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Debug|x64.ActiveCfg = Debug|x64
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Debug|x64.Build.0 = Debug|x64
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Debug|x86.ActiveCfg = Debug|Win32
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Debug|x86.Build.0 = Debug|Win32
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Release|x64.ActiveCfg = Release|x64
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Release|x64.Build.0 = Release|x64
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Release|x86.ActiveCfg = Release|Win32
|
||||||
|
{8489226B-D3FE-48BC-BD12-A3E04ED4EE76}.Release|x86.Build.0 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(SolutionProperties) = preSolution
|
||||||
|
HideSolutionNode = FALSE
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||||
|
SolutionGuid = {A83C62FA-2C3E-42FC-A61C-68426AECC40E}
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
150
Part1/Lab1/Spiski/Lab1_2.vcxproj
Normal file
150
Part1/Lab1/Spiski/Lab1_2.vcxproj
Normal file
@@ -0,0 +1,150 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup Label="ProjectConfigurations">
|
||||||
|
<ProjectConfiguration Include="Debug|Win32">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|Win32">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Debug|x64">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|x64">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
</ItemGroup>
|
||||||
|
<PropertyGroup Label="Globals">
|
||||||
|
<VCProjectVersion>16.0</VCProjectVersion>
|
||||||
|
<Keyword>Win32Proj</Keyword>
|
||||||
|
<ProjectGuid>{8489226b-d3fe-48bc-bd12-a3e04ed4ee76}</ProjectGuid>
|
||||||
|
<RootNamespace>Lab12</RootNamespace>
|
||||||
|
<WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||||
|
<ImportGroup Label="ExtensionSettings">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="Shared">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<PropertyGroup Label="UserMacros" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1_2.cpp" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt" />
|
||||||
|
</ItemGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||||
|
<ImportGroup Label="ExtensionTargets">
|
||||||
|
</ImportGroup>
|
||||||
|
</Project>
|
||||||
27
Part1/Lab1/Spiski/Lab1_2.vcxproj.filters
Normal file
27
Part1/Lab1/Spiski/Lab1_2.vcxproj.filters
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup>
|
||||||
|
<Filter Include="Source Files">
|
||||||
|
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||||
|
<Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Header Files">
|
||||||
|
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||||
|
<Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Resource Files">
|
||||||
|
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||||
|
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||||
|
</Filter>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1_2.cpp">
|
||||||
|
<Filter>Source Files</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt">
|
||||||
|
<Filter>Resource Files</Filter>
|
||||||
|
</Text>
|
||||||
|
</ItemGroup>
|
||||||
|
</Project>
|
||||||
4
Part1/Lab1/Spiski/Lab1_2.vcxproj.user
Normal file
4
Part1/Lab1/Spiski/Lab1_2.vcxproj.user
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<PropertyGroup />
|
||||||
|
</Project>
|
||||||
60
Part1/Lab1/Spiski/Test_result.txt
Normal file
60
Part1/Lab1/Spiski/Test_result.txt
Normal file
@@ -0,0 +1,60 @@
|
|||||||
|
Множество A: ABDEFIJKLMOUWZ
|
||||||
|
Множество B: ADHJKNOPSTUXZ
|
||||||
|
Множество C: CDEGHIJLMNOTXYZ
|
||||||
|
Множество D: CDFKLNRWY
|
||||||
|
Ответ: F = FKW
|
||||||
|
*
|
||||||
|
Множество A: BDFGHIJKLTVY
|
||||||
|
Множество B: DFIJKNOPSVWXZ
|
||||||
|
Множество C: ABDEFIJKMPQTWXYZ
|
||||||
|
Множество D: BCIJNOPRTVWY
|
||||||
|
Ответ: F = NOV
|
||||||
|
*
|
||||||
|
Множество A: CDGNOPSTVWYZ
|
||||||
|
Множество B: ABCDIJKLPQTUVXY
|
||||||
|
Множество C: BCGJMPQRSWZ
|
||||||
|
Множество D: CDFGIMORSTWY
|
||||||
|
Ответ: F = DIOTY
|
||||||
|
*
|
||||||
|
Множество A: BCDFHJMOPRVWYZ
|
||||||
|
Множество B: ACDEGHNPRSUVXYZ
|
||||||
|
Множество C: ABDHJKLMSUWZ
|
||||||
|
Множество D: ABCFGHILNPRVY
|
||||||
|
Ответ: F = CFGNPRVY
|
||||||
|
*
|
||||||
|
Множество A: ABCEGHIKLMPRSUX
|
||||||
|
Множество B: COUXZ
|
||||||
|
Множество C: ABEFIQRSTUWX
|
||||||
|
Множество D: ABFGIKMNOPQRUWYZ
|
||||||
|
Ответ: F = GKMOPZ
|
||||||
|
*
|
||||||
|
Множество A: BDEGHIKMNOPSTVY
|
||||||
|
Множество B: ABCEIJKNRSUVZ
|
||||||
|
Множество C: BCDEFGKLMNQRSTUVWXY
|
||||||
|
Множество D: JKMNOQRUWXZ
|
||||||
|
Ответ: F = OZ
|
||||||
|
*
|
||||||
|
Множество A: BFGHIKLNOPQRUVWZ
|
||||||
|
Множество B: BEHJLMPRSVWX
|
||||||
|
Множество C: ABCIJMOPQRTXY
|
||||||
|
Множество D: BCDEGILMNOQSVWY
|
||||||
|
Ответ: F = EGLNSVW
|
||||||
|
*
|
||||||
|
Множество A: BDFGKLMNPTVXZ
|
||||||
|
Множество B: ADFJKLNSXYZ
|
||||||
|
Множество C: ACDEFGHJMNQSTUWX
|
||||||
|
Множество D: ABHIJKLMNQRTUVW
|
||||||
|
Ответ: F = BKLV
|
||||||
|
*
|
||||||
|
Множество A: BDGHJLNPQRTVWYZ
|
||||||
|
Множество B: BGHJQTUVWZ
|
||||||
|
Множество C: CHKLMPUXZ
|
||||||
|
Множество D: BCDFGMOQRSTUWYZ
|
||||||
|
Ответ: F = DGQRTWY
|
||||||
|
*
|
||||||
|
Множество A: ABCEGHJLMQRTUVXZ
|
||||||
|
Множество B: ACFGILMNRVWX
|
||||||
|
Множество C: BFHIJMOQUWY
|
||||||
|
Множество D: BCFJLMNOPSVY
|
||||||
|
Ответ: F = CLNV
|
||||||
|
*
|
||||||
246
Part1/Lab1/Vector_bit/Lab1.cpp
Normal file
246
Part1/Lab1/Vector_bit/Lab1.cpp
Normal file
@@ -0,0 +1,246 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
#include <iomanip>
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
const char universum[] = "ABCDEFGHIJKMNLOPQRSTUVWXYZ";
|
||||||
|
const char filename[] = "Test_result.txt";
|
||||||
|
const int length = 26;
|
||||||
|
const int durationCoeff = 1000000;
|
||||||
|
int customTestAmount = 0;
|
||||||
|
char stringA[length], stringB[length], stringC[length], stringD[length];
|
||||||
|
bool vectorA[length], vectorB[length], vectorC[length], vectorD[length], vectorF[length];
|
||||||
|
|
||||||
|
|
||||||
|
void setupConsole()
|
||||||
|
{
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
SetConsoleOutputCP(1251);
|
||||||
|
SetConsoleCP(1251);
|
||||||
|
cout << fixed << setprecision(7);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputGreeting()
|
||||||
|
{
|
||||||
|
cout << "Программа рассчитывает значение множества F согласно следующим законам - " << endl;
|
||||||
|
cout << "F = D && (A || B) && !C, что равносильно F = D*(A + B) - C." << endl;
|
||||||
|
cout << "Универсум: " << universum << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void input()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Введите множество A: ";
|
||||||
|
cin >> stringA;
|
||||||
|
cout << "Введите множество B: ";
|
||||||
|
cin >> stringB;
|
||||||
|
cout << "Введите множество C: ";
|
||||||
|
cin >> stringC;
|
||||||
|
cout << "Введите множество D: ";
|
||||||
|
cin >> stringD;
|
||||||
|
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isCorrectSymbol(char symbol)
|
||||||
|
{
|
||||||
|
return ((symbol >= universum[0] && symbol <= universum[length - 1]) || symbol == '\0') ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isStringCorrect(char* string)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length && string[i] != '\0'; i++)
|
||||||
|
if (!isCorrectSymbol(string[i]))
|
||||||
|
return 0;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
int memberToIndex(char member)
|
||||||
|
{
|
||||||
|
return member - universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
char indexToMember(int number)
|
||||||
|
{
|
||||||
|
return number + universum[0];
|
||||||
|
}
|
||||||
|
|
||||||
|
void vectorFromString(bool* vector, const char string[])
|
||||||
|
{
|
||||||
|
for (int i = 0; string[i]; i++)
|
||||||
|
vector[memberToIndex(string[i])] = 1;
|
||||||
|
};
|
||||||
|
|
||||||
|
void convertSets()
|
||||||
|
{
|
||||||
|
vectorFromString(vectorA, stringA);
|
||||||
|
vectorFromString(vectorB, stringB);
|
||||||
|
vectorFromString(vectorC, stringC);
|
||||||
|
vectorFromString(vectorD, stringD);
|
||||||
|
}
|
||||||
|
|
||||||
|
void calculateAnswer()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
vectorF[i] = vectorD[i] && (vectorA[i] || vectorB[i]) && !vectorC[i];
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToConsole(bool* vector)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; ++i)
|
||||||
|
if (vector[i])
|
||||||
|
cout << indexToMember(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputSetToFile(bool* vector, ofstream& output)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; ++i)
|
||||||
|
if (vector[i])
|
||||||
|
output << indexToMember(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isSetEmpty(bool* vector)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
if (vector[i] == 1)
|
||||||
|
return 0;
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputAnswer()
|
||||||
|
{
|
||||||
|
cout << "Ответ: F = ";
|
||||||
|
if (isSetEmpty(vectorF))
|
||||||
|
cout << "пустое множество";
|
||||||
|
else
|
||||||
|
outputSetToConsole(vectorF);
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
double calulateDuration()
|
||||||
|
{
|
||||||
|
double firstPoint, lastPoint, duration = 0;
|
||||||
|
for (int i = 0; i < durationCoeff; i++)
|
||||||
|
{
|
||||||
|
firstPoint = clock();
|
||||||
|
calculateAnswer();
|
||||||
|
lastPoint = clock();
|
||||||
|
duration += lastPoint - firstPoint;
|
||||||
|
}
|
||||||
|
return duration / durationCoeff;
|
||||||
|
}
|
||||||
|
|
||||||
|
void outputDuration()
|
||||||
|
{
|
||||||
|
cout << endl;
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Временная сложность алгоритма - O(1), постоянное время" << endl;
|
||||||
|
cout << "На выполнение алгоритма уходит " << calulateDuration() << " секунд." << endl;
|
||||||
|
cout << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
float factorial(int number)
|
||||||
|
{
|
||||||
|
float factorial = 1;
|
||||||
|
for (int i = 1; i <= number; i++)
|
||||||
|
factorial *= i;
|
||||||
|
return factorial;
|
||||||
|
}
|
||||||
|
|
||||||
|
bool randomVector()
|
||||||
|
{
|
||||||
|
return rand() % 2;
|
||||||
|
}
|
||||||
|
|
||||||
|
void fillVectors()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
{
|
||||||
|
vectorA[i] = randomVector();
|
||||||
|
vectorB[i] = randomVector();
|
||||||
|
vectorC[i] = randomVector();
|
||||||
|
vectorD[i] = randomVector();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void clearAnswerVector()
|
||||||
|
{
|
||||||
|
for (int i = 0; i < length; i++)
|
||||||
|
vectorF[i] = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void badInputLoop()
|
||||||
|
{
|
||||||
|
while (cin.fail() || customTestAmount < 0)
|
||||||
|
{
|
||||||
|
cout << "Неправильный ввод, повторите еще раз:" << endl;
|
||||||
|
cin.clear();
|
||||||
|
cin.ignore(32767, '\n');
|
||||||
|
cin >> customTestAmount;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void testInfo()
|
||||||
|
{
|
||||||
|
cout << setprecision(0);
|
||||||
|
cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << endl;
|
||||||
|
cout << "Из 26 символов может быть составлено " << factorial(length) << " перестановок" << endl;
|
||||||
|
cout << "Сколько программа должна проделать тестов со случайными комбинациями?" << endl;
|
||||||
|
cin >> customTestAmount;
|
||||||
|
badInputLoop();
|
||||||
|
if (customTestAmount > 0)
|
||||||
|
cout << "Отчеты будут выведены в файл " << filename << endl;
|
||||||
|
else cout << "Тесты не будут проделаны" << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
void executeTest()
|
||||||
|
{
|
||||||
|
ofstream output;
|
||||||
|
output.open(filename);
|
||||||
|
for (int i = 0; i < customTestAmount; i++)
|
||||||
|
{
|
||||||
|
fillVectors();
|
||||||
|
clearAnswerVector();
|
||||||
|
output << "Множество A: ";
|
||||||
|
outputSetToFile(vectorA, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество B: ";
|
||||||
|
outputSetToFile(vectorB, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество C: ";
|
||||||
|
outputSetToFile(vectorC, output);
|
||||||
|
output << endl;
|
||||||
|
output << "Множество D: ";
|
||||||
|
outputSetToFile(vectorD, output);
|
||||||
|
output << endl;
|
||||||
|
calculateAnswer();
|
||||||
|
output << "Ответ: F = ";
|
||||||
|
outputSetToFile(vectorF, output);
|
||||||
|
output << endl;
|
||||||
|
output << '*' << endl;
|
||||||
|
}
|
||||||
|
output.close();
|
||||||
|
}
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
setupConsole();
|
||||||
|
outputGreeting();
|
||||||
|
input();
|
||||||
|
while (!isStringCorrect(stringA) || !isStringCorrect(stringB) || !isStringCorrect(stringC) || !isStringCorrect(stringD))
|
||||||
|
{
|
||||||
|
cout << "Некорректный ввод" << endl;
|
||||||
|
input();
|
||||||
|
}
|
||||||
|
convertSets();
|
||||||
|
calculateAnswer();
|
||||||
|
outputAnswer();
|
||||||
|
outputDuration();
|
||||||
|
testInfo();
|
||||||
|
executeTest();
|
||||||
|
}
|
||||||
31
Part1/Lab1/Vector_bit/Lab1.sln
Normal file
31
Part1/Lab1/Vector_bit/Lab1.sln
Normal file
@@ -0,0 +1,31 @@
|
|||||||
|
|
||||||
|
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||||
|
# Visual Studio Version 16
|
||||||
|
VisualStudioVersion = 16.0.31025.194
|
||||||
|
MinimumVisualStudioVersion = 10.0.40219.1
|
||||||
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Lab1", "Lab1.vcxproj", "{56A2AB4F-94CB-4D3E-9174-96C549809152}"
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||||
|
Debug|x64 = Debug|x64
|
||||||
|
Debug|x86 = Debug|x86
|
||||||
|
Release|x64 = Release|x64
|
||||||
|
Release|x86 = Release|x86
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Debug|x64.ActiveCfg = Debug|x64
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Debug|x64.Build.0 = Debug|x64
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Debug|x86.ActiveCfg = Debug|Win32
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Debug|x86.Build.0 = Debug|Win32
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Release|x64.ActiveCfg = Release|x64
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Release|x64.Build.0 = Release|x64
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Release|x86.ActiveCfg = Release|Win32
|
||||||
|
{56A2AB4F-94CB-4D3E-9174-96C549809152}.Release|x86.Build.0 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(SolutionProperties) = preSolution
|
||||||
|
HideSolutionNode = FALSE
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||||
|
SolutionGuid = {7983316A-D121-4CF6-82F5-FCA20F9DC2CE}
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
150
Part1/Lab1/Vector_bit/Lab1.vcxproj
Normal file
150
Part1/Lab1/Vector_bit/Lab1.vcxproj
Normal file
@@ -0,0 +1,150 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup Label="ProjectConfigurations">
|
||||||
|
<ProjectConfiguration Include="Debug|Win32">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|Win32">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Debug|x64">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|x64">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
</ItemGroup>
|
||||||
|
<PropertyGroup Label="Globals">
|
||||||
|
<VCProjectVersion>16.0</VCProjectVersion>
|
||||||
|
<Keyword>Win32Proj</Keyword>
|
||||||
|
<ProjectGuid>{56a2ab4f-94cb-4d3e-9174-96c549809152}</ProjectGuid>
|
||||||
|
<RootNamespace>Lab1</RootNamespace>
|
||||||
|
<WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||||
|
<ImportGroup Label="ExtensionSettings">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="Shared">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<PropertyGroup Label="UserMacros" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1.cpp" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt" />
|
||||||
|
</ItemGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||||
|
<ImportGroup Label="ExtensionTargets">
|
||||||
|
</ImportGroup>
|
||||||
|
</Project>
|
||||||
27
Part1/Lab1/Vector_bit/Lab1.vcxproj.filters
Normal file
27
Part1/Lab1/Vector_bit/Lab1.vcxproj.filters
Normal file
@@ -0,0 +1,27 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup>
|
||||||
|
<Filter Include="Исходные файлы">
|
||||||
|
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||||
|
<Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Файлы заголовков">
|
||||||
|
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||||
|
<Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Файлы ресурсов">
|
||||||
|
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||||
|
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||||
|
</Filter>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab1.cpp">
|
||||||
|
<Filter>Исходные файлы</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<Text Include="Test_result.txt">
|
||||||
|
<Filter>Файлы ресурсов</Filter>
|
||||||
|
</Text>
|
||||||
|
</ItemGroup>
|
||||||
|
</Project>
|
||||||
4
Part1/Lab1/Vector_bit/Lab1.vcxproj.user
Normal file
4
Part1/Lab1/Vector_bit/Lab1.vcxproj.user
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<PropertyGroup />
|
||||||
|
</Project>
|
||||||
72
Part1/Lab1/Vector_bit/Test_result.txt
Normal file
72
Part1/Lab1/Vector_bit/Test_result.txt
Normal file
@@ -0,0 +1,72 @@
|
|||||||
|
Множество A: ABDEFIJKLMOUWZ
|
||||||
|
Множество B: ADHJKNOPSTUXZ
|
||||||
|
Множество C: CDEGHIJLMNOTXYZ
|
||||||
|
Множество D: CDFKLNRWY
|
||||||
|
Ответ: F = FKW
|
||||||
|
*
|
||||||
|
Множество A: BDFGHIJKLTVY
|
||||||
|
Множество B: DFIJKNOPSVWXZ
|
||||||
|
Множество C: ABDEFIJKMPQTWXYZ
|
||||||
|
Множество D: BCIJNOPRTVWY
|
||||||
|
Ответ: F = NOV
|
||||||
|
*
|
||||||
|
Множество A: CDGNOPSTVWYZ
|
||||||
|
Множество B: ABCDIJKLPQTUVXY
|
||||||
|
Множество C: BCGJMPQRSWZ
|
||||||
|
Множество D: CDFGIMORSTWY
|
||||||
|
Ответ: F = DIOTY
|
||||||
|
*
|
||||||
|
Множество A: BCDFHJMOPRVWYZ
|
||||||
|
Множество B: ACDEGHNPRSUVXYZ
|
||||||
|
Множество C: ABDHJKLMSUWZ
|
||||||
|
Множество D: ABCFGHILNPRVY
|
||||||
|
Ответ: F = CFGNPRVY
|
||||||
|
*
|
||||||
|
Множество A: ABCEGHIKLMPRSUX
|
||||||
|
Множество B: COUXZ
|
||||||
|
Множество C: ABEFIQRSTUWX
|
||||||
|
Множество D: ABFGIKMNOPQRUWYZ
|
||||||
|
Ответ: F = GKMOPZ
|
||||||
|
*
|
||||||
|
Множество A: BDEGHIKMNOPSTVY
|
||||||
|
Множество B: ABCEIJKNRSUVZ
|
||||||
|
Множество C: BCDEFGKLMNQRSTUVWXY
|
||||||
|
Множество D: JKMNOQRUWXZ
|
||||||
|
Ответ: F = JOZ
|
||||||
|
*
|
||||||
|
Множество A: BFGHIKLNOPQRUVWZ
|
||||||
|
Множество B: BEHJLMPRSVWX
|
||||||
|
Множество C: ABCIJMOPQRTXY
|
||||||
|
Множество D: BCDEGILMNOQSVWY
|
||||||
|
Ответ: F = EGLNSVW
|
||||||
|
*
|
||||||
|
Множество A: BDFGKLMNPTVXZ
|
||||||
|
Множество B: ADFJKLNSXYZ
|
||||||
|
Множество C: ACDEFGHJMNQSTUWX
|
||||||
|
Множество D: ABHIJKLMNQRTUVW
|
||||||
|
Ответ: F = BKLV
|
||||||
|
*
|
||||||
|
Множество A: BDGHJLNPQRTVWYZ
|
||||||
|
Множество B: BGHJQTUVWZ
|
||||||
|
Множество C: CHKLMPUXZ
|
||||||
|
Множество D: BCDFGMOQRSTUWYZ
|
||||||
|
Ответ: F = BDGQRTWY
|
||||||
|
*
|
||||||
|
Множество A: ABCEGHJLMQRTUVXZ
|
||||||
|
Множество B: ACFGILMNRVWX
|
||||||
|
Множество C: BFHIJMOQUWY
|
||||||
|
Множество D: BCFJLMNOPSVY
|
||||||
|
Ответ: F = CLNV
|
||||||
|
*
|
||||||
|
Множество A: DEFHKTWXYZ
|
||||||
|
Множество B: ABCGIMOPRSVW
|
||||||
|
Множество C: DFJNQTWYZ
|
||||||
|
Множество D: FJKNOPQSVWZ
|
||||||
|
Ответ: F = KOPSV
|
||||||
|
*
|
||||||
|
Множество A: BCEFJKLOPTWY
|
||||||
|
Множество B: AEFHKLPQUVW
|
||||||
|
Множество C: BCDEGKLMNOWX
|
||||||
|
Множество D: ADGJKLMORSVWYZ
|
||||||
|
Ответ: F = AJVY
|
||||||
|
*
|
||||||
26
Part1/Lab2/Lab2.cpp
Normal file
26
Part1/Lab2/Lab2.cpp
Normal file
@@ -0,0 +1,26 @@
|
|||||||
|
#include <string.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <time.h>
|
||||||
|
#include <iostream>
|
||||||
|
using namespace std;
|
||||||
|
#include "Set4.h"
|
||||||
|
int Set::N = 26, Set::cnt = 0; // Îïðåäåëåíèå ñòàòè÷åñêèõ ÷ëåíîâ êëàññà
|
||||||
|
const long q0 = 100000; // Êîëè÷åñòâî ïîâòîðåíèé öèêëà âðåìåíè
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
srand(time(nullptr));
|
||||||
|
Set A('A'), B('B'), C('C'), D('D'), E; //A, B, C, D ãåíåðèðóþòñÿ. E — ïóñòîå ìí-âî
|
||||||
|
clock_t begin = clock();
|
||||||
|
for (long q = 0; q < q0; ++q)
|
||||||
|
{
|
||||||
|
E = D & (A | B) & ~C;
|
||||||
|
//E = ~A;
|
||||||
|
}
|
||||||
|
clock_t end = clock();
|
||||||
|
E.Show();
|
||||||
|
cout << " Middle power =" <<
|
||||||
|
(A.power() + B.power() + C.power() + D.power() + E.power()) / 5 <<
|
||||||
|
" Time=" << end - begin << " / " << q0 << endl;
|
||||||
|
cin.get();
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
31
Part1/Lab2/Lab2.sln
Normal file
31
Part1/Lab2/Lab2.sln
Normal file
@@ -0,0 +1,31 @@
|
|||||||
|
|
||||||
|
Microsoft Visual Studio Solution File, Format Version 12.00
|
||||||
|
# Visual Studio Version 16
|
||||||
|
VisualStudioVersion = 16.0.30804.86
|
||||||
|
MinimumVisualStudioVersion = 10.0.40219.1
|
||||||
|
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "Lab2", "Lab2.vcxproj", "{43E2B72C-FD3D-4357-ACBD-6379834A6269}"
|
||||||
|
EndProject
|
||||||
|
Global
|
||||||
|
GlobalSection(SolutionConfigurationPlatforms) = preSolution
|
||||||
|
Debug|x64 = Debug|x64
|
||||||
|
Debug|x86 = Debug|x86
|
||||||
|
Release|x64 = Release|x64
|
||||||
|
Release|x86 = Release|x86
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ProjectConfigurationPlatforms) = postSolution
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Debug|x64.ActiveCfg = Debug|x64
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Debug|x64.Build.0 = Debug|x64
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Debug|x86.ActiveCfg = Debug|Win32
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Debug|x86.Build.0 = Debug|Win32
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Release|x64.ActiveCfg = Release|x64
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Release|x64.Build.0 = Release|x64
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Release|x86.ActiveCfg = Release|Win32
|
||||||
|
{43E2B72C-FD3D-4357-ACBD-6379834A6269}.Release|x86.Build.0 = Release|Win32
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(SolutionProperties) = preSolution
|
||||||
|
HideSolutionNode = FALSE
|
||||||
|
EndGlobalSection
|
||||||
|
GlobalSection(ExtensibilityGlobals) = postSolution
|
||||||
|
SolutionGuid = {C2582D30-E578-4B2C-AB32-A4F887D1D73C}
|
||||||
|
EndGlobalSection
|
||||||
|
EndGlobal
|
||||||
153
Part1/Lab2/Lab2.vcxproj
Normal file
153
Part1/Lab2/Lab2.vcxproj
Normal file
@@ -0,0 +1,153 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project DefaultTargets="Build" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup Label="ProjectConfigurations">
|
||||||
|
<ProjectConfiguration Include="Debug|Win32">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|Win32">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>Win32</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Debug|x64">
|
||||||
|
<Configuration>Debug</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
<ProjectConfiguration Include="Release|x64">
|
||||||
|
<Configuration>Release</Configuration>
|
||||||
|
<Platform>x64</Platform>
|
||||||
|
</ProjectConfiguration>
|
||||||
|
</ItemGroup>
|
||||||
|
<PropertyGroup Label="Globals">
|
||||||
|
<VCProjectVersion>16.0</VCProjectVersion>
|
||||||
|
<Keyword>Win32Proj</Keyword>
|
||||||
|
<ProjectGuid>{43e2b72c-fd3d-4357-acbd-6379834a6269}</ProjectGuid>
|
||||||
|
<RootNamespace>Lab2</RootNamespace>
|
||||||
|
<WindowsTargetPlatformVersion>10.0</WindowsTargetPlatformVersion>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.Default.props" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>true</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'" Label="Configuration">
|
||||||
|
<ConfigurationType>Application</ConfigurationType>
|
||||||
|
<UseDebugLibraries>false</UseDebugLibraries>
|
||||||
|
<PlatformToolset>v142</PlatformToolset>
|
||||||
|
<WholeProgramOptimization>true</WholeProgramOptimization>
|
||||||
|
<CharacterSet>Unicode</CharacterSet>
|
||||||
|
</PropertyGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.props" />
|
||||||
|
<ImportGroup Label="ExtensionSettings">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="Shared">
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<ImportGroup Label="PropertySheets" Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<Import Project="$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props" Condition="exists('$(UserRootDir)\Microsoft.Cpp.$(Platform).user.props')" Label="LocalAppDataPlatform" />
|
||||||
|
</ImportGroup>
|
||||||
|
<PropertyGroup Label="UserMacros" />
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<LinkIncremental>true</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<PropertyGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<LinkIncremental>false</LinkIncremental>
|
||||||
|
</PropertyGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>_DEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemDefinitionGroup Condition="'$(Configuration)|$(Platform)'=='Release|x64'">
|
||||||
|
<ClCompile>
|
||||||
|
<WarningLevel>Level3</WarningLevel>
|
||||||
|
<FunctionLevelLinking>true</FunctionLevelLinking>
|
||||||
|
<IntrinsicFunctions>true</IntrinsicFunctions>
|
||||||
|
<SDLCheck>true</SDLCheck>
|
||||||
|
<PreprocessorDefinitions>NDEBUG;_CONSOLE;%(PreprocessorDefinitions)</PreprocessorDefinitions>
|
||||||
|
<ConformanceMode>true</ConformanceMode>
|
||||||
|
</ClCompile>
|
||||||
|
<Link>
|
||||||
|
<SubSystem>Console</SubSystem>
|
||||||
|
<EnableCOMDATFolding>true</EnableCOMDATFolding>
|
||||||
|
<OptimizeReferences>true</OptimizeReferences>
|
||||||
|
<GenerateDebugInformation>true</GenerateDebugInformation>
|
||||||
|
</Link>
|
||||||
|
</ItemDefinitionGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab2.cpp" />
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClInclude Include="Set1.h" />
|
||||||
|
<ClInclude Include="Set2.h" />
|
||||||
|
<ClInclude Include="Set3.h" />
|
||||||
|
<ClInclude Include="Set4.h" />
|
||||||
|
</ItemGroup>
|
||||||
|
<Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
|
||||||
|
<ImportGroup Label="ExtensionTargets">
|
||||||
|
</ImportGroup>
|
||||||
|
</Project>
|
||||||
36
Part1/Lab2/Lab2.vcxproj.filters
Normal file
36
Part1/Lab2/Lab2.vcxproj.filters
Normal file
@@ -0,0 +1,36 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="4.0" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<ItemGroup>
|
||||||
|
<Filter Include="Source Files">
|
||||||
|
<UniqueIdentifier>{4FC737F1-C7A5-4376-A066-2A32D752A2FF}</UniqueIdentifier>
|
||||||
|
<Extensions>cpp;c;cc;cxx;c++;cppm;ixx;def;odl;idl;hpj;bat;asm;asmx</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Header Files">
|
||||||
|
<UniqueIdentifier>{93995380-89BD-4b04-88EB-625FBE52EBFB}</UniqueIdentifier>
|
||||||
|
<Extensions>h;hh;hpp;hxx;h++;hm;inl;inc;ipp;xsd</Extensions>
|
||||||
|
</Filter>
|
||||||
|
<Filter Include="Resource Files">
|
||||||
|
<UniqueIdentifier>{67DA6AB6-F800-4c08-8B7A-83BB121AAD01}</UniqueIdentifier>
|
||||||
|
<Extensions>rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms</Extensions>
|
||||||
|
</Filter>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClCompile Include="Lab2.cpp">
|
||||||
|
<Filter>Source Files</Filter>
|
||||||
|
</ClCompile>
|
||||||
|
</ItemGroup>
|
||||||
|
<ItemGroup>
|
||||||
|
<ClInclude Include="Set1.h">
|
||||||
|
<Filter>Header Files</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="Set2.h">
|
||||||
|
<Filter>Header Files</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="Set3.h">
|
||||||
|
<Filter>Header Files</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
<ClInclude Include="Set4.h">
|
||||||
|
<Filter>Header Files</Filter>
|
||||||
|
</ClInclude>
|
||||||
|
</ItemGroup>
|
||||||
|
</Project>
|
||||||
4
Part1/Lab2/Lab2.vcxproj.user
Normal file
4
Part1/Lab2/Lab2.vcxproj.user
Normal file
@@ -0,0 +1,4 @@
|
|||||||
|
<?xml version="1.0" encoding="utf-8"?>
|
||||||
|
<Project ToolsVersion="Current" xmlns="http://schemas.microsoft.com/developer/msbuild/2003">
|
||||||
|
<PropertyGroup />
|
||||||
|
</Project>
|
||||||
118
Part1/Lab2/Set1.h
Normal file
118
Part1/Lab2/Set1.h
Normal file
@@ -0,0 +1,118 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
class Set {
|
||||||
|
private:
|
||||||
|
static int N, cnt; // ìîùíîñòü óíèâåðñóìà è ñ÷åò÷èê ìíîæåñòâ
|
||||||
|
int n; // ìîùíîñòü ìíîæåñòâà
|
||||||
|
char S, * A; // òåã è ïàìÿòü äëÿ ìíîæåñòâà
|
||||||
|
public:
|
||||||
|
Set operator | (const Set&) const; // îáúåäèíåíèå
|
||||||
|
Set& operator |= (const Set&);
|
||||||
|
Set operator & (const Set&) const; // ïåðåñå÷åíèå
|
||||||
|
Set& operator &= (const Set&);
|
||||||
|
Set operator ~ () const; // äîïîëíåíèå äî óíèâåðñóìà
|
||||||
|
void Show(); // âûâîä ìíîæåñòâà íà ýêðàí
|
||||||
|
int power() { return n; } // ïîëó÷åíèå ìîùíîñòè
|
||||||
|
Set(char);
|
||||||
|
// êîíñòðóêòîð ìíîæåñòâà
|
||||||
|
Set(); // åùå êîíñòðóêòîð — ïî óìîë÷àíèþ
|
||||||
|
Set(const Set&); // êîíñòðóêòîð êîïèè
|
||||||
|
Set(Set&&); // ïåðåìåùàþùèé êîíñòðóêòîð (C++11)
|
||||||
|
Set operator = (const Set&); // îïåðàòîð ïðèñâàèâàíèÿ
|
||||||
|
Set operator = (Set&&); //ïðèñâàèâàíèå ñ ïåðåìåùåíèåì (C++11)
|
||||||
|
~Set() { delete[] A; } // äåñòðóêòîð
|
||||||
|
};
|
||||||
|
|
||||||
|
Set::Set() : n(0), S('A' + cnt++), A(new char[N + 1]) { A[0] = 0; }
|
||||||
|
|
||||||
|
Set::Set(char) : S('A' + cnt++), n(0), A(new char[N + 1]) {
|
||||||
|
for (int i = 0; i < N; i++)
|
||||||
|
if (rand() % 2) A[n++] = i + 'A';
|
||||||
|
A[n] = 0;
|
||||||
|
cout << '\n' << S << " = [" << A << "]";
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(const Set& B) : S('A' + cnt++), n(B.n), A(new char[N + 1]) {
|
||||||
|
char* dst(A), * src(B.A); // Èíèöèàëèçàöèÿ àäðåñîâ/ñ÷åò÷èêîâ
|
||||||
|
while (*dst++ = *src++); // Êîïèðîâàíèå ñèìâîëîâ äî îáíàðóæåíèÿ 0
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set:: operator= (const Set& B) {
|
||||||
|
if (this != &B) {
|
||||||
|
char* dst(A), * src(B.A); n = B.n;
|
||||||
|
|
||||||
|
while (*dst++ = *src++); S = 'A' + cnt++;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator &= (const Set& B)
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
n = 0;
|
||||||
|
for (int i = 0; i < C.n; ++i) {
|
||||||
|
for (int j = 0; j < B.n; ++j)
|
||||||
|
if (C.A[i] == B.A[j]) A[n++] = C.A[i];
|
||||||
|
}
|
||||||
|
A[n] = 0; // Îãðàíè÷èòåëü ñòðîêè
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator & (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C &= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator |= (const Set& B)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < B.n; ++i) {
|
||||||
|
bool f = true;
|
||||||
|
for (int j = 0; j < n; ++j)
|
||||||
|
if (B.A[i] == A[j]) f = false;
|
||||||
|
if (f) A[n++] = B.A[i];
|
||||||
|
}
|
||||||
|
A[n] = 0; return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator | (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C |= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator ~ () const
|
||||||
|
{
|
||||||
|
Set C;
|
||||||
|
for (char c = 'A'; c <= 'Z'; ++c) { // Öèêë ïî óíèâåðñóìó
|
||||||
|
bool f = true;
|
||||||
|
for (int j = 0; j < n; ++j)
|
||||||
|
if (c == A[j]) { f = false; break; }
|
||||||
|
if (f) C.A[C.n++] = c;
|
||||||
|
}
|
||||||
|
C.A[C.n] = 0;
|
||||||
|
return std::move(C);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(Set&& B) : S('A' + cnt++), n(B.n), A(B.A)
|
||||||
|
{
|
||||||
|
B.A = nullptr;
|
||||||
|
} // Êîïèðîâàíèå ñ ïåðåíîñîì
|
||||||
|
|
||||||
|
Set Set:: operator = (Set&& B) // Ïðèñâàèâàíèå ñ ïåðåíîñîì
|
||||||
|
{
|
||||||
|
if (this != &B)
|
||||||
|
{
|
||||||
|
n = B.n; A = B.A; S = 'A' + cnt++; B.A = nullptr;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
void Set::Show() { cout << '\n' << S << " = [" << A << "]"; }
|
||||||
122
Part1/Lab2/Set2.h
Normal file
122
Part1/Lab2/Set2.h
Normal file
@@ -0,0 +1,122 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
|
||||||
|
class Set {
|
||||||
|
private:
|
||||||
|
static int N, cnt; // ìîùíîñòü óíèâåðñóìà è ñ÷åò÷èê ìíîæåñòâ
|
||||||
|
int n; // ìîùíîñòü ìíîæåñòâà
|
||||||
|
char S; // òåã è ïàìÿòü äëÿ ìíîæåñòâà
|
||||||
|
bool* A;
|
||||||
|
public:
|
||||||
|
Set operator | (const Set&) const; // îáúåäèíåíèå
|
||||||
|
Set& operator |= (const Set&);
|
||||||
|
Set operator & (const Set&) const; // ïåðåñå÷åíèå
|
||||||
|
Set& operator &= (const Set&);
|
||||||
|
Set operator ~ () const; // äîïîëíåíèå äî óíèâåðñóìà
|
||||||
|
void Show(); // âûâîä ìíîæåñòâà íà ýêðàí
|
||||||
|
int power() { return n; } // ïîëó÷åíèå ìîùíîñòè
|
||||||
|
Set(char);// êîíñòðóêòîð ìíîæåñòâà
|
||||||
|
Set(); // åùå êîíñòðóêòîð — ïî óìîë÷àíèþ
|
||||||
|
Set(const Set&); // êîíñòðóêòîð êîïèè
|
||||||
|
Set(Set&&); // ïåðåìåùàþùèé êîíñòðóêòîð (C++11)
|
||||||
|
Set operator = (const Set&); // îïåðàòîð ïðèñâàèâàíèÿ
|
||||||
|
Set operator = (Set&&); //ïðèñâàèâàíèå ñ ïåðåìåùåíèåì (C++11)
|
||||||
|
~Set() { delete[] A; } // äåñòðóêòîð
|
||||||
|
};
|
||||||
|
|
||||||
|
Set::Set() : n(0), S('A' + cnt++), A(new bool[N] {0}) {};
|
||||||
|
|
||||||
|
Set::Set(char) : S('A' + cnt++), n(0), A(new bool[N] {0}) {
|
||||||
|
for (int i = 0; i < N; i++)
|
||||||
|
if (rand() % 2) {
|
||||||
|
A[i] = true;
|
||||||
|
n++;
|
||||||
|
}
|
||||||
|
cout << '\n' << S << " = [";
|
||||||
|
for (int i = 0; i < N; i++)
|
||||||
|
if (A[i]) cout << char(i + 'A');
|
||||||
|
cout << "]";
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(const Set& B) : S('A' + cnt++), n(B.n), A(new bool[N] {0}) {
|
||||||
|
bool* dst(A), * src(B.A); // Èíèöèàëèçàöèÿ àäðåñîâ/ñ÷åò÷èêîâ
|
||||||
|
for (int i = 0; i < N; i++) *dst++ = *src++;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set:: operator= (const Set& B) {
|
||||||
|
if (this != &B) {
|
||||||
|
bool* dst(A), * src(B.A); n = B.n;
|
||||||
|
for (int i = 0; i < N; i++) *dst++ = *src++;
|
||||||
|
S = 'A' + cnt++;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator &= (const Set& B)
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
n = 0;
|
||||||
|
for (int i = 0; i < N; ++i) {
|
||||||
|
if (C.A[i] && B.A[i]) { A[i] = true; n++; }
|
||||||
|
else A[i] = false;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator & (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C &= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator |= (const Set& B)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < N; ++i)
|
||||||
|
if (B.A[i]) {
|
||||||
|
A[i] = true;
|
||||||
|
n++;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator | (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C |= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator ~ () const
|
||||||
|
{
|
||||||
|
Set C;
|
||||||
|
for (int i = 0; i < N; ++i) { // Öèêë ïî óíèâåðñóìó
|
||||||
|
C.A[i] = !A[i];
|
||||||
|
}
|
||||||
|
return std::move(C);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(Set&& B) : S('A' + cnt++), n(B.n), A(B.A)
|
||||||
|
{
|
||||||
|
B.A = nullptr;
|
||||||
|
} // Êîïèðîâàíèå ñ ïåðåíîñîì
|
||||||
|
|
||||||
|
Set Set:: operator = (Set&& B) // Ïðèñâàèâàíèå ñ ïåðåíîñîì
|
||||||
|
{
|
||||||
|
if (this != &B)
|
||||||
|
{
|
||||||
|
n = B.n; A = B.A; S = 'A' + cnt++; B.A = nullptr;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
void Set::Show() {
|
||||||
|
cout << '\n' << S << " = [";
|
||||||
|
for (int i = 0; i < N; i++) if(A[i]) cout << char(i + 'A');
|
||||||
|
cout << "]";
|
||||||
|
}
|
||||||
114
Part1/Lab2/Set3.h
Normal file
114
Part1/Lab2/Set3.h
Normal file
@@ -0,0 +1,114 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
|
||||||
|
class Set {
|
||||||
|
private:
|
||||||
|
static int N, cnt; // ìîùíîñòü óíèâåðñóìà è ñ÷åò÷èê ìíîæåñòâ
|
||||||
|
int n; // ìîùíîñòü ìíîæåñòâà
|
||||||
|
char S; // òåã è ïàìÿòü äëÿ ìíîæåñòâà
|
||||||
|
int A;
|
||||||
|
public:
|
||||||
|
Set operator | (const Set&) const; // îáúåäèíåíèå
|
||||||
|
Set& operator |= (const Set&);
|
||||||
|
Set operator & (const Set&) const; // ïåðåñå÷åíèå
|
||||||
|
Set& operator &= (const Set&);
|
||||||
|
Set operator ~ () const; // äîïîëíåíèå äî óíèâåðñóìà
|
||||||
|
void Show(); // âûâîä ìíîæåñòâà íà ýêðàí
|
||||||
|
int power() { return n; } // ïîëó÷åíèå ìîùíîñòè
|
||||||
|
Set(char);// êîíñòðóêòîð ìíîæåñòâà
|
||||||
|
Set(); // åùå êîíñòðóêòîð — ïî óìîë÷àíèþ
|
||||||
|
Set(const Set&); // êîíñòðóêòîð êîïèè
|
||||||
|
Set(Set&&); // ïåðåìåùàþùèé êîíñòðóêòîð (C++11)
|
||||||
|
Set operator = (const Set&); // îïåðàòîð ïðèñâàèâàíèÿ
|
||||||
|
Set operator = (Set&&); //ïðèñâàèâàíèå ñ ïåðåìåùåíèåì (C++11)
|
||||||
|
~Set() {} // äåñòðóêòîð
|
||||||
|
};
|
||||||
|
|
||||||
|
Set::Set() : n(0), S('A' + cnt++), A(0) {};
|
||||||
|
|
||||||
|
Set::Set(char) : S('A' + cnt++), n(0), A(0) {
|
||||||
|
for (int i = 0; i < N; i++)
|
||||||
|
if (rand() % 2) {
|
||||||
|
A |= (1 << i);
|
||||||
|
n++;
|
||||||
|
}
|
||||||
|
cout << '\n' << S << " = [";
|
||||||
|
for (int i = 0; i < N; i++)
|
||||||
|
if ((A >> i) & 1)
|
||||||
|
cout << char(i + 'A');
|
||||||
|
cout << "]";
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(const Set& B) : S('A' + cnt++), n(B.n), A(B.A) { }
|
||||||
|
|
||||||
|
Set Set:: operator= (const Set& B) {
|
||||||
|
if (this != &B) {
|
||||||
|
n = B.n;
|
||||||
|
A = B.A;
|
||||||
|
S = 'A' + cnt++;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator &= (const Set& B)
|
||||||
|
{
|
||||||
|
n = 0;
|
||||||
|
A = A & B.A;
|
||||||
|
for (int i = 0; i < N; i++) if ((A >> i) & 1) n++;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator & (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C &= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator |= (const Set& B)
|
||||||
|
{
|
||||||
|
n = 0;
|
||||||
|
A = A | B.A;
|
||||||
|
for (int i = 0; i < N; i++) if ((A >> i) & 1) n++;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator | (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C |= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator ~ () const
|
||||||
|
{
|
||||||
|
Set C;
|
||||||
|
C.A = ~A;
|
||||||
|
return std::move(C);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(Set&& B) : S('A' + cnt++), n(B.n), A(B.A)
|
||||||
|
{
|
||||||
|
B.A = 0;
|
||||||
|
} // Êîïèðîâàíèå ñ ïåðåíîñîì
|
||||||
|
|
||||||
|
Set Set:: operator = (Set&& B) // Ïðèñâàèâàíèå ñ ïåðåíîñîì
|
||||||
|
{
|
||||||
|
if (this != &B)
|
||||||
|
{
|
||||||
|
n = B.n; A = B.A; S = 'A' + cnt++; B.A = 0;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
void Set::Show() {
|
||||||
|
cout << '\n' << S << " = [";
|
||||||
|
for (int i = 0; i < N; i++) if ((A >> i) & 1)
|
||||||
|
cout << char(i + 'A');
|
||||||
|
cout << "]";
|
||||||
|
}
|
||||||
208
Part1/Lab2/Set4.h
Normal file
208
Part1/Lab2/Set4.h
Normal file
@@ -0,0 +1,208 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
#include <string>
|
||||||
|
#include <Windows.h>
|
||||||
|
#include <cstdio>
|
||||||
|
#include <time.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
class SetElem {
|
||||||
|
public:
|
||||||
|
char el;
|
||||||
|
SetElem* next;
|
||||||
|
SetElem(char e, SetElem* n = nullptr) : el(e), next(n) { }
|
||||||
|
~SetElem() { delete next; }
|
||||||
|
};
|
||||||
|
|
||||||
|
class Set {
|
||||||
|
private:
|
||||||
|
static int N, cnt; // ìîùíîñòü óíèâåðñóìà è ñ÷åò÷èê ìíîæåñòâ
|
||||||
|
int n; // ìîùíîñòü ìíîæåñòâà
|
||||||
|
char S; // òåã è ïàìÿòü äëÿ ìíîæåñòâà
|
||||||
|
SetElem* A;
|
||||||
|
public:
|
||||||
|
Set operator | (const Set&) const; // îáúåäèíåíèå
|
||||||
|
Set& operator |= (const Set&);
|
||||||
|
Set operator & (const Set&) const; // ïåðåñå÷åíèå
|
||||||
|
Set& operator &= (const Set&);
|
||||||
|
Set operator ~ () const; // äîïîëíåíèå äî óíèâåðñóìà
|
||||||
|
void Show(); // âûâîä ìíîæåñòâà íà ýêðàí
|
||||||
|
int power() { return n; } // ïîëó÷åíèå ìîùíîñòè
|
||||||
|
Set(char);// êîíñòðóêòîð ìíîæåñòâà
|
||||||
|
Set(); // åùå êîíñòðóêòîð — ïî óìîë÷àíèþ
|
||||||
|
Set(const Set&); // êîíñòðóêòîð êîïèè
|
||||||
|
Set(Set&&); // ïåðåìåùàþùèé êîíñòðóêòîð (C++11)
|
||||||
|
Set operator = (const Set&); // îïåðàòîð ïðèñâàèâàíèÿ
|
||||||
|
Set operator = (Set&&); //ïðèñâàèâàíèå ñ ïåðåìåùåíèåì (C++11)
|
||||||
|
~Set() {} // äåñòðóêòîð
|
||||||
|
};
|
||||||
|
|
||||||
|
Set::Set() : n(0), S('A' + cnt++), A(nullptr) {};
|
||||||
|
|
||||||
|
Set::Set(char) : S('A' + cnt++), n(0), A(nullptr) {
|
||||||
|
SetElem* pA = A;
|
||||||
|
for (int i = 0; i < N; i++)
|
||||||
|
if (rand() % 2) {
|
||||||
|
if (A) {
|
||||||
|
pA->next = new SetElem(char(i + 'A'));
|
||||||
|
pA = pA->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
A = new SetElem(char(i + 'A'));
|
||||||
|
pA = A;
|
||||||
|
}
|
||||||
|
n++;
|
||||||
|
}
|
||||||
|
cout << '\n' << S << " = [";
|
||||||
|
for (SetElem* p = A; p; p = p->next)
|
||||||
|
cout << p->el;
|
||||||
|
cout << "]";
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(const Set& B) : S('A' + cnt++), n(B.n), A(nullptr) {
|
||||||
|
SetElem* pA = A, * pB = B.A;
|
||||||
|
while (pB) {
|
||||||
|
if (pA) {
|
||||||
|
pA->next = new SetElem(pB->el);
|
||||||
|
pA = pA->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
A = new SetElem(B.A->el);
|
||||||
|
pA = A;
|
||||||
|
}
|
||||||
|
pB = pB->next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set:: operator= (const Set& B) {
|
||||||
|
if (this != &B) {
|
||||||
|
n = B.n;
|
||||||
|
A = nullptr;
|
||||||
|
SetElem* pA = A, *pB = B.A;
|
||||||
|
while (pB) {
|
||||||
|
if (pA) {
|
||||||
|
pA->next = new SetElem(B.A->el);
|
||||||
|
pA = pA->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
A = new SetElem(B.A->el);
|
||||||
|
pA = A;
|
||||||
|
}
|
||||||
|
pB = pB->next;
|
||||||
|
}
|
||||||
|
S = 'A' + cnt++;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator &= (const Set& B)
|
||||||
|
{
|
||||||
|
n = 0;
|
||||||
|
SetElem* last = nullptr, * pA = A;
|
||||||
|
for (SetElem* pB = B.A; pB; pB = pB->next) {
|
||||||
|
while (pA && pA->el < pB->el) pA = pA->next;
|
||||||
|
if (pA && pA->el == pB->el) {
|
||||||
|
if (last == nullptr) {
|
||||||
|
last = pA;
|
||||||
|
A = pA;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
last->next = pA;
|
||||||
|
last = pA;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (pA) last->next = nullptr;
|
||||||
|
for (pA = A; pA; pA = pA->next) n++;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator & (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C &= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set& Set :: operator |= (const Set& B)
|
||||||
|
{
|
||||||
|
n = 0;
|
||||||
|
SetElem* pA = A;
|
||||||
|
for (SetElem* pB = B.A; pB; pB = pB->next) {
|
||||||
|
if (pA) {
|
||||||
|
while (pA->next && pA->next->el - 'A' < pB->el - 'A') pA = pA->next;
|
||||||
|
if (!pA->next || pA->next->el - 'A' != pB->el - 'A') {
|
||||||
|
if (pA == A) {
|
||||||
|
if (pB->el - 'A' <= pA->el - 'A') {
|
||||||
|
pA = new SetElem(pB->el, A);
|
||||||
|
A = pA;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pA->next = new SetElem(pB->el, pA->next);
|
||||||
|
pA = pA->next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pA = new SetElem(pB->el);
|
||||||
|
A = pA;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for (pA = A; pA; pA = pA->next) n++;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator | (const Set& B) const
|
||||||
|
{
|
||||||
|
Set C(*this);
|
||||||
|
return std::move(C |= B);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set Set :: operator ~ () const
|
||||||
|
{
|
||||||
|
Set C;
|
||||||
|
C.n = N - n;
|
||||||
|
SetElem* pC = C.A, *pA = A;
|
||||||
|
for (char c = 'A'; c <= 'Z'; ++c) { // Öèêë ïî óíèâåðñóìó
|
||||||
|
if (pA && pA->el > c) {
|
||||||
|
if (pC) {
|
||||||
|
pC->next = new SetElem(c);
|
||||||
|
pC = pC->next;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
C.A = new SetElem(c);
|
||||||
|
pC = C.A;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
if(pA) pA = pA->next;
|
||||||
|
else {
|
||||||
|
pC->next = new SetElem(c);
|
||||||
|
pC = pC->next;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return std::move(C);
|
||||||
|
}
|
||||||
|
|
||||||
|
Set::Set(Set&& B) : S('A' + cnt++), n(B.n), A(B.A)
|
||||||
|
{
|
||||||
|
B.A = 0;
|
||||||
|
} // Êîïèðîâàíèå ñ ïåðåíîñîì
|
||||||
|
|
||||||
|
Set Set:: operator = (Set&& B) // Ïðèñâàèâàíèå ñ ïåðåíîñîì
|
||||||
|
{
|
||||||
|
if (this != &B)
|
||||||
|
{
|
||||||
|
n = B.n; A = B.A; S = 'A' + cnt++; B.A = 0;
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
void Set::Show() {
|
||||||
|
cout << '\n' << S << " = [";
|
||||||
|
for (SetElem* p = A; p; p = p->next)
|
||||||
|
cout << p->el;
|
||||||
|
cout << "]";
|
||||||
|
}
|
||||||
281
Part1/Lab3/main.cpp
Normal file
281
Part1/Lab3/main.cpp
Normal file
@@ -0,0 +1,281 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <fstream>
|
||||||
|
using namespace std;
|
||||||
|
//Êëàññ «óçåë äåðåâà»
|
||||||
|
class Node {
|
||||||
|
char d; //òåã óçëà
|
||||||
|
Node* lft; // ëåâûé ñûí
|
||||||
|
Node* rgt; // ïðàâûé ñûí
|
||||||
|
int count = 0;
|
||||||
|
public:
|
||||||
|
Node() : lft(nullptr), rgt(nullptr) { } // êîíñòðóêòîð óçëà
|
||||||
|
Node(const Node&) = delete;
|
||||||
|
Node& operator = (const Node&) = delete;
|
||||||
|
~Node() {
|
||||||
|
delete lft; // äåñòðóêòîð óçëà (óíè÷òîæàåò âñå ïîääåðåâî
|
||||||
|
delete rgt;
|
||||||
|
} // â ïîðÿäêå, îáðàòíîì åãî ñîçäàíèþ)
|
||||||
|
friend class Tree; // äðóæåñòâåííûé êëàññ «äåðåâî»
|
||||||
|
};
|
||||||
|
// Êëàññ «äåðåâî â öåëîì»
|
||||||
|
class Tree
|
||||||
|
{
|
||||||
|
Node* root; // óêàçàòåëü íà êîðåíü äåðåâà
|
||||||
|
char num, maxnum; // ñ÷åò÷èê òåãîâ è ìàêñèìàëüíûé òåã
|
||||||
|
int maxrow, offset; // ìàêñèìàëüíàÿ ãëóáèíà, ñìåùåíèå êîðíÿ
|
||||||
|
char** SCREEN; // áóôåð äëÿ âûäà÷è íà ýêðàí
|
||||||
|
void clrscr() // î÷èñòêà áóôåðà
|
||||||
|
{
|
||||||
|
for (int i = 0; i < maxrow; i++)
|
||||||
|
memset(SCREEN[i], '.', 80);
|
||||||
|
}
|
||||||
|
|
||||||
|
Node* MakeNode(int depth) // ñîçäàíèå ïîääåðåâà
|
||||||
|
{
|
||||||
|
Node* v = nullptr;
|
||||||
|
int random;
|
||||||
|
random = rand() % 5 + 1;// cout << random << endl;
|
||||||
|
int Y = (depth < random) && (num <= 'ÿ');
|
||||||
|
//Âàðèàíò: cout << "Node (" << num << ',' << depth << ")1/0: "; cin >> Y;
|
||||||
|
if (Y) { // ñîçäàíèå óçëà, åñëè Y = 1
|
||||||
|
v = new Node;
|
||||||
|
v->lft = MakeNode(depth + 1);
|
||||||
|
v->d = num++; // âàðèàíò — âî âíóòðåííåì
|
||||||
|
v->rgt = MakeNode(depth + 1);
|
||||||
|
}
|
||||||
|
return v;
|
||||||
|
}
|
||||||
|
void OutNodes(Node* v, int r, int c) // âûäà÷à ïîääåðåâà // root, 1, 40
|
||||||
|
{
|
||||||
|
if (r && c && (c < 80)) SCREEN[r - 1][c - 1] = v->d; // âûâîä ìåòêè
|
||||||
|
if (r < maxrow) {
|
||||||
|
if (v->lft) OutNodes(v->lft, r + 1, c -(offset >> r)); //ëåâûé ñûí
|
||||||
|
if (v->rgt) OutNodes(v->rgt, r + 1, c + (offset >> r)); //ïðàâûé ñûí
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//Tree(const Tree&) = delete; // êîíñòðóêòîð êîïèè
|
||||||
|
//Tree(Tree&&) = delete; // êîïèÿ ñ ïåðåíîñîì (Ñ++11)
|
||||||
|
//Tree& operator = (const Tree&) const = delete; // ïðèñâàèâàíèå
|
||||||
|
//Tree& operator = (Tree&&) const = delete; // òî æå, ñ ïåðåíîñîì
|
||||||
|
//
|
||||||
|
|
||||||
|
|
||||||
|
public:
|
||||||
|
Tree(char nm, char mnm, int mxr) :
|
||||||
|
num(nm), maxnum(mnm), maxrow(mxr), offset(40), root(nullptr),
|
||||||
|
SCREEN(new char* [maxrow])
|
||||||
|
{
|
||||||
|
for (int i = 0; i < maxrow; i++) SCREEN[i] = new char[80];
|
||||||
|
}
|
||||||
|
|
||||||
|
~Tree() {
|
||||||
|
for (int i = 0; i < maxrow; i++) delete[]SCREEN[i];
|
||||||
|
delete[]SCREEN; delete root;
|
||||||
|
}
|
||||||
|
void MakeTree() // ââîä — ãåíåðàöèÿ äåðåâà
|
||||||
|
{
|
||||||
|
root = MakeNode(0);
|
||||||
|
}
|
||||||
|
bool exist() { return root != nullptr; } // ïðîâåðêà «äåðåâî íå ïóñòî»
|
||||||
|
void OutTree() // âûäà÷à íà ýêðàí
|
||||||
|
{
|
||||||
|
clrscr();
|
||||||
|
OutNodes(root, 1, offset);
|
||||||
|
for (int i = 0; i < maxrow; i++)
|
||||||
|
{
|
||||||
|
SCREEN[i][79] = 0;
|
||||||
|
cout << '\n' << SCREEN[i];
|
||||||
|
}
|
||||||
|
cout << '\n';
|
||||||
|
}
|
||||||
|
|
||||||
|
int DFS() // îáõîä äåðåâà «â ãëóáèíó»
|
||||||
|
{
|
||||||
|
const int MaxS = 20; // ìàêñèìàëüíûé ðàçìåð ñòåêà
|
||||||
|
int count = 0;
|
||||||
|
STACK <Node*> S(MaxS); //ñîçäàíèå ñòåêà óêàçàòåëåé íà óçëû
|
||||||
|
S.push(root); // STACK <- root
|
||||||
|
while (!S.empty()) // Ïîêà ñòåê íå ïóñò…
|
||||||
|
{
|
||||||
|
Node* v = S.pop(); // ïîäíÿòü óçåë èç ñòåêà
|
||||||
|
cout << v->d << '_'; count++; // âûäàòü òåã, ñ÷åò óçëîâ
|
||||||
|
if (v->rgt) S.push(v->rgt); // STACK <- (ïðàâûé ñûí)
|
||||||
|
if (v->lft) S.push(v->lft); // STACK <- (ëåâûé ñûí)
|
||||||
|
}
|
||||||
|
return count;
|
||||||
|
}
|
||||||
|
|
||||||
|
template <class Item>
|
||||||
|
class STACK
|
||||||
|
{
|
||||||
|
Item* S;
|
||||||
|
int t;
|
||||||
|
public:
|
||||||
|
STACK(int maxt)
|
||||||
|
{
|
||||||
|
S = new Item[maxt];
|
||||||
|
t = 0;
|
||||||
|
}
|
||||||
|
int empty() const
|
||||||
|
{
|
||||||
|
return t == 0;
|
||||||
|
}
|
||||||
|
void push(Item item)
|
||||||
|
{
|
||||||
|
S[t++] = item;
|
||||||
|
}
|
||||||
|
Item pop()
|
||||||
|
{
|
||||||
|
return (t ? S[--t] : 0);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
int result()
|
||||||
|
{
|
||||||
|
int rezult = 0;
|
||||||
|
search_1(root, 1);
|
||||||
|
search_2(root, 1);
|
||||||
|
return counter(root, 1, &rezult);
|
||||||
|
}
|
||||||
|
void search_1(Node* v, int x) // ïðîñòàâëÿåì êîëè÷åñòâî ñûíîâåé â êàæäîé âåðøèíå
|
||||||
|
{
|
||||||
|
while (x)
|
||||||
|
{
|
||||||
|
if (v->lft != nullptr)
|
||||||
|
{
|
||||||
|
v->count++;
|
||||||
|
search_1(v->lft,1);
|
||||||
|
if (v->rgt != nullptr)
|
||||||
|
{
|
||||||
|
v->count++;
|
||||||
|
search_1(v->rgt, 1);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
if ((v->rgt == nullptr && v->lft == nullptr) || (v->count > 1))
|
||||||
|
{
|
||||||
|
x = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (v->rgt != nullptr)
|
||||||
|
{
|
||||||
|
v->count++;
|
||||||
|
search_1(v->rgt, 1);
|
||||||
|
if (v->lft != nullptr)
|
||||||
|
{
|
||||||
|
v->count++;
|
||||||
|
search_1(v->lft, 1);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (v->rgt == nullptr && v->lft == nullptr) x = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
void search_2(Node* v, int x) // ê êîëè÷åñòâó óæå èìåþùèõñÿ ñûíîâåé ó êàæäîé âåðøèíû ïðèáàâëÿåì êîëè÷åñâòî ñûíîâåé ó êàæäîãîãî ñûíà î÷åðåäíîé âåðøèíû
|
||||||
|
{
|
||||||
|
while (x)// //////
|
||||||
|
{
|
||||||
|
if (v->lft != nullptr)
|
||||||
|
{
|
||||||
|
v->count = v->count + v->lft->count;
|
||||||
|
search_2(v->lft, 1);
|
||||||
|
if (v->rgt != nullptr)
|
||||||
|
{
|
||||||
|
v->count = v->count + v->rgt->count;
|
||||||
|
search_2(v->rgt, 1);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
if ((v->rgt == nullptr && v->lft == nullptr) || (v->count > 3))
|
||||||
|
{
|
||||||
|
x = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (v->rgt != nullptr)
|
||||||
|
{
|
||||||
|
v->count = v->count + v->rgt->count;
|
||||||
|
search_2(v->rgt, 1);
|
||||||
|
if (v->lft != nullptr)
|
||||||
|
{
|
||||||
|
v->count = v->count + v->lft->count;
|
||||||
|
search_2(v->lft, 1);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (v->rgt == nullptr && v->lft == nullptr) x = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int counter(Node* v, int x, int* rezult)
|
||||||
|
{// â ðåçóëüòàò èäóò âåðøèíû â êîòîðûõ îäèí èëè 0 ñûíîâåé* (*íå ñûíîâåé à òî ÷òî ìû ñ÷èòàëè â ïðîøëûõ äâóõ ôóíêöèÿõ)
|
||||||
|
while (x)
|
||||||
|
{
|
||||||
|
if (v->count < 2)
|
||||||
|
{
|
||||||
|
(*rezult)++;
|
||||||
|
if (v->lft != nullptr)
|
||||||
|
{
|
||||||
|
counter(v->lft, 1, rezult);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
if (v->rgt != nullptr)
|
||||||
|
{
|
||||||
|
counter(v->rgt, 1, rezult);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
if (v->rgt == nullptr && v->lft == nullptr) x = 0;
|
||||||
|
}
|
||||||
|
else
|
||||||
|
{
|
||||||
|
if (v->lft != nullptr)
|
||||||
|
{
|
||||||
|
counter(v->lft, 1, rezult);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
if (v->rgt != nullptr)
|
||||||
|
{
|
||||||
|
counter(v->rgt, 1, rezult);
|
||||||
|
x = 0;
|
||||||
|
}
|
||||||
|
if (v->rgt == nullptr && v->lft == nullptr) x = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return *rezult;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
|
||||||
|
//
|
||||||
|
int main ()
|
||||||
|
{
|
||||||
|
int n = 0, rezult;
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
srand(time(0));
|
||||||
|
|
||||||
|
Tree tr('à','ÿ',5);
|
||||||
|
tr.MakeTree();
|
||||||
|
if (tr.exist())
|
||||||
|
{
|
||||||
|
tr.OutTree();
|
||||||
|
cout << '\n' << "Îáõîä â ãëóáèíó: ";
|
||||||
|
n = tr.DFS();
|
||||||
|
cout << " Ïðîéäåíî óçëîâ = " << n << '\n';
|
||||||
|
rezult = tr.result();
|
||||||
|
cout << "Êîëè÷åñòâî âåðøèí, èìåþùèõ íå áîëåå îäíîãî ïîòîìêà: " << rezult << '\n';
|
||||||
|
}
|
||||||
|
else
|
||||||
|
cout << "Error." << '\n';
|
||||||
|
|
||||||
|
}
|
||||||
514
Part2/3Lab/3Lab.cpp
Normal file
514
Part2/3Lab/3Lab.cpp
Normal file
@@ -0,0 +1,514 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <string>
|
||||||
|
#include <clocale>
|
||||||
|
#include <list>
|
||||||
|
#include <time.h>
|
||||||
|
#include <vector>
|
||||||
|
#include <stack>
|
||||||
|
#include <iterator>
|
||||||
|
#include <algorithm>
|
||||||
|
#include <exception>
|
||||||
|
#include <locale>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
struct Node {
|
||||||
|
int key, h;
|
||||||
|
Node* L[2];
|
||||||
|
Node(int k) : key(k), h(1) { L[0] = L[1] = nullptr; }
|
||||||
|
~Node() { delete L[1]; delete L[0]; }
|
||||||
|
void Display(int, int, int);
|
||||||
|
Node(const Node&) = delete;
|
||||||
|
Node& operator = (const Node&) = delete;
|
||||||
|
|
||||||
|
friend int height(Node*& p)
|
||||||
|
{
|
||||||
|
return p ? p->h : 0;
|
||||||
|
}
|
||||||
|
int balancefactor()
|
||||||
|
{
|
||||||
|
return height(L[1]) - height(L[0]);
|
||||||
|
}
|
||||||
|
|
||||||
|
int fixheight()
|
||||||
|
{
|
||||||
|
auto hl = height(L[0]);
|
||||||
|
auto hr = height(L[1]);
|
||||||
|
h = (hl > hr ? hl : hr) + 1;
|
||||||
|
return h;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
// friend class Tree;
|
||||||
|
};
|
||||||
|
|
||||||
|
using MyStack = stack<pair<Node*, int>>;
|
||||||
|
|
||||||
|
struct myiter : public iterator<forward_iterator_tag, int>
|
||||||
|
{
|
||||||
|
Node* Ptr;
|
||||||
|
MyStack St;
|
||||||
|
myiter(Node* p = nullptr) : Ptr(p) {}
|
||||||
|
myiter(Node* p, const MyStack&& St) : Ptr(p), St(move(St)) {}
|
||||||
|
bool operator == (const myiter& Other) const { return Ptr == Other.Ptr; }
|
||||||
|
bool operator != (const myiter& Other) const { return !(*this == Other); }
|
||||||
|
myiter& operator++();
|
||||||
|
myiter operator++(int) { myiter temp(*this); ++* this; return temp; }
|
||||||
|
pointer operator->() { return &Ptr->key; }
|
||||||
|
reference operator*() { return Ptr->key; }
|
||||||
|
};
|
||||||
|
|
||||||
|
template <typename Container, typename Iter = myiter>
|
||||||
|
class outiter : public iterator<output_iterator_tag, typename Container::value_type>
|
||||||
|
{
|
||||||
|
protected:
|
||||||
|
Container& container;
|
||||||
|
Iter iter;
|
||||||
|
public:
|
||||||
|
explicit outiter(Container& c, Iter it) : container(c), iter(it) { }
|
||||||
|
const outiter<Container>&
|
||||||
|
operator = (const typename Container::value_type& value) {
|
||||||
|
iter = container.insert(value, iter).first;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
const outiter<Container>&
|
||||||
|
operator = (const outiter<Container>&) { return *this; }
|
||||||
|
outiter<Container>& operator* () { return *this; }
|
||||||
|
outiter<Container>& operator++ () { return *this; }
|
||||||
|
outiter<Container>& operator++ (int) { return *this; }
|
||||||
|
};
|
||||||
|
|
||||||
|
template <typename Container, typename Iter>
|
||||||
|
inline outiter<Container, Iter> outinserter(Container& c, Iter it)
|
||||||
|
{
|
||||||
|
return outiter<Container, Iter>(c, it);
|
||||||
|
}
|
||||||
|
|
||||||
|
class Tree {
|
||||||
|
static size_t tags;
|
||||||
|
char tag;
|
||||||
|
Node* root;
|
||||||
|
size_t n;
|
||||||
|
public:
|
||||||
|
using key_type = int;
|
||||||
|
using value_type = int;
|
||||||
|
using key_compare = less<int>;
|
||||||
|
void swap(Tree& rgt)
|
||||||
|
{
|
||||||
|
using std::swap;
|
||||||
|
swap(tag, rgt.tag);
|
||||||
|
swap(root, rgt.root);
|
||||||
|
swap(n, rgt.n);
|
||||||
|
}
|
||||||
|
static int Count;
|
||||||
|
myiter Insert(const int& k, myiter where) {
|
||||||
|
return insert(k, where).first;
|
||||||
|
}
|
||||||
|
size_t H() { return (root ? root->h : 0); }
|
||||||
|
void Display(int = 1);
|
||||||
|
myiter begin()const;
|
||||||
|
myiter end()const { return myiter(nullptr); }
|
||||||
|
void clear() { n = 0; delete root; root = nullptr; }
|
||||||
|
pair<myiter, bool> insert(int, myiter = myiter(nullptr));
|
||||||
|
Tree() : tag(static_cast<char>('A' + tags++)), root(nullptr), n(0) { }
|
||||||
|
Tree(int N) : tag(static_cast<char>('A' + tags++)), root(nullptr), n(0) {
|
||||||
|
clear();
|
||||||
|
Count = 0;
|
||||||
|
for (int i = 0; i < N; ++i) {
|
||||||
|
int num = rand() % 16;
|
||||||
|
Tree::Count += insert(num).second;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
int size() { return n; }
|
||||||
|
~Tree() { delete root; }
|
||||||
|
myiter find(int)const;
|
||||||
|
Tree(const Tree& rgt) : Tree() {
|
||||||
|
for (auto x = rgt.begin(); x != rgt.end(); ++x) insert(*x);
|
||||||
|
}
|
||||||
|
Tree(Tree&& rgt) : Tree() { swap(rgt); }
|
||||||
|
template<class MyIt>
|
||||||
|
Tree(MyIt first, MyIt last) : Tree() {
|
||||||
|
for (; first != last; ++first) insert(*first);
|
||||||
|
}
|
||||||
|
Tree(list<int> data) : Tree() {
|
||||||
|
for (auto x = data.begin(); x != data.end(); ++x) {
|
||||||
|
insert(*x);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
Tree& operator=(const Tree& rgt)
|
||||||
|
{
|
||||||
|
Tree temp;
|
||||||
|
for (auto x : rgt) temp.insert(x);
|
||||||
|
swap(temp);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
Tree& operator=(Tree&& rgt)
|
||||||
|
{
|
||||||
|
swap(rgt); return *this;
|
||||||
|
}
|
||||||
|
Tree& operator |= (const Tree&);
|
||||||
|
Tree operator | (const Tree& rgt) const
|
||||||
|
{
|
||||||
|
Tree result(*this); return (result |= rgt);
|
||||||
|
}
|
||||||
|
Tree& operator &= (const Tree&);
|
||||||
|
Tree operator & (const Tree& rgt) const
|
||||||
|
{
|
||||||
|
Tree result(*this); return (result &= rgt);
|
||||||
|
}
|
||||||
|
Tree& operator -= (const Tree&);
|
||||||
|
Tree operator - (const Tree& rgt) const
|
||||||
|
{
|
||||||
|
Tree result(*this); return (result -= rgt);
|
||||||
|
}
|
||||||
|
Tree& operator ^= (const Tree&);
|
||||||
|
Tree operator ^ (const Tree& rgt) const
|
||||||
|
{
|
||||||
|
Tree result(*this); return (result ^= rgt);
|
||||||
|
}
|
||||||
|
void showme() {
|
||||||
|
cout << tag << ": { ";
|
||||||
|
|
||||||
|
if (root) {
|
||||||
|
cout << root->key << ' ';
|
||||||
|
outnode(root);
|
||||||
|
}
|
||||||
|
|
||||||
|
cout << '}' << endl;
|
||||||
|
}
|
||||||
|
void outnode(Node* root) {
|
||||||
|
if (root->L[0]) {
|
||||||
|
cout << root->L[0]->key << ' ';
|
||||||
|
outnode(root->L[0]);
|
||||||
|
}
|
||||||
|
if (root->L[1]) {
|
||||||
|
cout << root->L[1]->key << ' ';
|
||||||
|
outnode(root->L[1]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
void Merge(Tree last, Tree& res) {
|
||||||
|
res.clear();
|
||||||
|
merge(begin(), end(), last.begin(), last.end(), outinserter(res, myiter(nullptr)));
|
||||||
|
}
|
||||||
|
void subst(int p, Tree last, Tree& res) {
|
||||||
|
res.clear();
|
||||||
|
auto qt = begin();
|
||||||
|
int i = 0;
|
||||||
|
|
||||||
|
while (i < p && qt != end()) {
|
||||||
|
res.insert(*qt);
|
||||||
|
++qt;
|
||||||
|
++i;
|
||||||
|
}
|
||||||
|
for (auto st = last.begin(); st != last.end(); ++st) {
|
||||||
|
res.insert(*st);
|
||||||
|
}
|
||||||
|
for (auto st = qt; st != end(); ++st) {
|
||||||
|
res.insert(*st);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
void change(int p, Tree last, Tree& res) {
|
||||||
|
res.clear();
|
||||||
|
auto qt = begin();
|
||||||
|
int i = 0;
|
||||||
|
|
||||||
|
while (i < p && qt != end()) {
|
||||||
|
res.insert(*qt);
|
||||||
|
++qt;
|
||||||
|
++i;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (auto st = last.begin(); st != last.end(); ++st) {
|
||||||
|
res.insert(*st);
|
||||||
|
++qt;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (auto st = qt; st != end(); ++st) {
|
||||||
|
res.insert(*st);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
int Tree::Count;
|
||||||
|
|
||||||
|
myiter Tree::begin()const {
|
||||||
|
MyStack St;
|
||||||
|
Node* p(root);
|
||||||
|
if (p) {
|
||||||
|
while (p->L[0]) {
|
||||||
|
St.push(make_pair(p, 0));
|
||||||
|
p = p->L[0];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return myiter(p, move(St));
|
||||||
|
}
|
||||||
|
|
||||||
|
myiter& myiter::operator++()
|
||||||
|
{
|
||||||
|
if (!Ptr) {
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
if (Ptr->L[1]) {
|
||||||
|
St.push(make_pair(Ptr, 1));
|
||||||
|
Ptr = Ptr->L[1];
|
||||||
|
while (Ptr->L[0]) {
|
||||||
|
St.push(make_pair(Ptr, 0));
|
||||||
|
Ptr = Ptr->L[0];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
pair<Node*, int> pp(Ptr, 1);
|
||||||
|
while (!St.empty() && pp.second) { pp = St.top(); St.pop(); }
|
||||||
|
if (pp.second) {
|
||||||
|
Ptr = nullptr;
|
||||||
|
}
|
||||||
|
else Ptr = pp.first;
|
||||||
|
}
|
||||||
|
return (*this);
|
||||||
|
}
|
||||||
|
|
||||||
|
const int FIRSTROW = 0,
|
||||||
|
FIRSTCOL = 60,
|
||||||
|
MAXCOL = 120,
|
||||||
|
OFFSET[] = { 60, 23, 12, 6, 3, 2, 1 },
|
||||||
|
MAXROW = FIRSTROW + 9,
|
||||||
|
MAXOUT = FIRSTROW + 6,
|
||||||
|
SHIFT = 2;
|
||||||
|
string SCREEN[MAXROW];
|
||||||
|
|
||||||
|
void clrscr(int f = 1)
|
||||||
|
{
|
||||||
|
for (auto i = 0; i < MAXROW; ++i) {
|
||||||
|
|
||||||
|
SCREEN[i] = "";
|
||||||
|
SCREEN[i].resize(MAXCOL + 20, '.');
|
||||||
|
}
|
||||||
|
if (f) system("cls");
|
||||||
|
}
|
||||||
|
|
||||||
|
void showscr()
|
||||||
|
{
|
||||||
|
for (auto i = 0; i < MAXROW; ++i) {
|
||||||
|
SCREEN[i].resize(MAXCOL, '.');
|
||||||
|
cout << SCREEN[i] << '\n';
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int setval(string& s, int pos, int val) {
|
||||||
|
string t(to_string(val));
|
||||||
|
for (auto p : t) s[pos++] = p;
|
||||||
|
return t.size();
|
||||||
|
}
|
||||||
|
|
||||||
|
void Tree::Display(int first)
|
||||||
|
{
|
||||||
|
clrscr(first);
|
||||||
|
SCREEN[0] = "BSTh (H=" + to_string(H()) + " n=" + to_string(n) + ") --------->";
|
||||||
|
if (root) {
|
||||||
|
SCREEN[0].resize(MAXCOL, '.');
|
||||||
|
root->Display(0, FIRSTCOL, 1);
|
||||||
|
}
|
||||||
|
else SCREEN[0] += "<Empty!>";
|
||||||
|
showscr();
|
||||||
|
}
|
||||||
|
|
||||||
|
void Node::Display(int row, int col, int depth)
|
||||||
|
{
|
||||||
|
if ((row > MAXROW) || (col < 0) || (col > MAXCOL)) return;
|
||||||
|
if (row > MAXOUT) {
|
||||||
|
SCREEN[row].replace(col, 3, "+++");
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
try {
|
||||||
|
setval(SCREEN[row], col, key);
|
||||||
|
setval(SCREEN[row + 1], col, h);
|
||||||
|
}
|
||||||
|
catch (exception& e) {
|
||||||
|
cout << e.what() << key << ' ' << row << ' ' << col << endl;
|
||||||
|
cin.get();
|
||||||
|
}
|
||||||
|
catch (...) { cout << "Unknown error\n"; cin.get(); }
|
||||||
|
|
||||||
|
if (L[0]) L[0]->Display(row + 1, col - OFFSET[depth], depth + 1);
|
||||||
|
if (L[1]) L[1]->Display(row + 1, col + OFFSET[depth], depth + 1);
|
||||||
|
}
|
||||||
|
myiter Tree::find(int k)const
|
||||||
|
{
|
||||||
|
Node* p(root);
|
||||||
|
while (p && p->key != k) p = p->L[p->key > k];
|
||||||
|
return myiter(p);
|
||||||
|
}
|
||||||
|
|
||||||
|
pair<myiter, bool> Tree::insert(int k, myiter where)
|
||||||
|
{
|
||||||
|
Node* p(root), * q(nullptr);
|
||||||
|
int a{ 0 };
|
||||||
|
MyStack St;
|
||||||
|
//===== Инициализация =====
|
||||||
|
if (!where.Ptr) {
|
||||||
|
if (!root) {
|
||||||
|
root = new Node(k);
|
||||||
|
n = 1;
|
||||||
|
return make_pair(myiter(root, move(St)), true);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
p = where.Ptr;
|
||||||
|
St = move(where.St);
|
||||||
|
}
|
||||||
|
|
||||||
|
//===== Поиск места вставки ===== //
|
||||||
|
while (p) {
|
||||||
|
a = k > p->key ? 1 : 0;
|
||||||
|
St.push(make_pair(p, a));
|
||||||
|
q = p->L[a];
|
||||||
|
if (q) {
|
||||||
|
p = q;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
p->L[a] = q = new Node(k);
|
||||||
|
++n;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int b_old{ 0 };
|
||||||
|
while (!St.empty())
|
||||||
|
{
|
||||||
|
auto pa = St.top(); St.pop();
|
||||||
|
p = pa.first; a = pa.second;
|
||||||
|
int b(p->balancefactor());
|
||||||
|
if (b) {
|
||||||
|
if ((b == 2) || (b == -2))
|
||||||
|
{
|
||||||
|
--p->h;
|
||||||
|
b /= 2;
|
||||||
|
if (b == b_old) {
|
||||||
|
p->L[a] = q->L[1 - a];
|
||||||
|
q->L[1 - a] = p;
|
||||||
|
if (p == root)p = root = q;
|
||||||
|
else St.top().first->L[St.top().second] = p = q;
|
||||||
|
p->fixheight();
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
Node* r(q->L[1 - a]);
|
||||||
|
p->L[a] = r->L[1 - a];
|
||||||
|
q->L[1 - a] = r->L[a];
|
||||||
|
r->L[1 - a] = p;
|
||||||
|
r->L[a] = q;
|
||||||
|
|
||||||
|
if (p == root) p = root = r;
|
||||||
|
else St.top().first->L[St.top().second] = p = r;
|
||||||
|
p->fixheight();
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
b_old = b;
|
||||||
|
p->fixheight();
|
||||||
|
q = p;
|
||||||
|
}
|
||||||
|
else break;
|
||||||
|
}
|
||||||
|
return make_pair(myiter(p, move(St)), true);
|
||||||
|
}
|
||||||
|
|
||||||
|
Tree& Tree::operator |= (const Tree& rgt) {
|
||||||
|
Tree temp;
|
||||||
|
set_union(begin(), end(), rgt.begin(), rgt.end(), outinserter(temp, myiter(nullptr)));
|
||||||
|
swap(temp);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Tree& Tree::operator &= (const Tree& rgt) {
|
||||||
|
Tree temp;
|
||||||
|
set_intersection(begin(), end(), rgt.begin(), rgt.end(), outinserter(temp, myiter(nullptr)));
|
||||||
|
swap(temp);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
|
||||||
|
Tree& Tree::operator -= (const Tree& rgt) {
|
||||||
|
Tree temp;
|
||||||
|
set_difference(begin(), end(), rgt.begin(), rgt.end(), outinserter(temp, myiter(nullptr)));
|
||||||
|
swap(temp);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
Tree& Tree::operator ^= (const Tree& rgt) {
|
||||||
|
Tree temp;
|
||||||
|
set_symmetric_difference(begin(), end(), rgt.begin(), rgt.end(), outinserter(temp, myiter(nullptr)));
|
||||||
|
swap(temp);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
size_t Tree::tags = 0;
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int main()
|
||||||
|
{
|
||||||
|
setlocale(LC_ALL, "Russian");
|
||||||
|
system("chcp 1251");
|
||||||
|
srand(time(nullptr));
|
||||||
|
|
||||||
|
int N = 16;
|
||||||
|
Tree home(rand()%N+1),
|
||||||
|
second(rand()%N+1),
|
||||||
|
third(rand()%N+1),
|
||||||
|
fourth(rand()%N+1),
|
||||||
|
fifth(rand()%N+1),
|
||||||
|
res1, res2, res3, res;
|
||||||
|
|
||||||
|
home.Display();
|
||||||
|
cout << "\nSequence in the form of a tree (further will be in the form of a sequence) ... ";
|
||||||
|
home.showme();
|
||||||
|
cin.get();
|
||||||
|
system("cls");
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
home.showme();
|
||||||
|
second.showme();
|
||||||
|
third.showme();
|
||||||
|
fourth.showme();
|
||||||
|
fifth.showme(); cout << endl;
|
||||||
|
|
||||||
|
res1 = home | second;
|
||||||
|
cout << "A | B = "; res1.showme();
|
||||||
|
res2 = third | fourth;
|
||||||
|
cout << "C | D = "; res2.showme();
|
||||||
|
res3 = res1 - res2;
|
||||||
|
cout << "(A | B) - (C | D) = "; res3.showme();
|
||||||
|
res = res3 ^ fifth;
|
||||||
|
cout << "(A | B) - (C | D) ^ E = "; res.showme();
|
||||||
|
|
||||||
|
cout << "\nGraphical representation in progress... ";
|
||||||
|
cin.get();
|
||||||
|
res.Display();
|
||||||
|
cout << "Result: "; res.showme();
|
||||||
|
cin.get();
|
||||||
|
|
||||||
|
list<int> test = {6, 7, 9, 2, 3};
|
||||||
|
Tree merge_tree(test), resx;
|
||||||
|
home.Merge(merge_tree, resx);
|
||||||
|
resx.Display();
|
||||||
|
cout << "Operation Merge\n";
|
||||||
|
resx.showme();
|
||||||
|
cin.get();
|
||||||
|
|
||||||
|
Tree subst_tree({3, 4, 0}), res4;
|
||||||
|
home.subst(2, subst_tree, res4);
|
||||||
|
res4.Display();
|
||||||
|
cout << "Operation Subst\n";
|
||||||
|
res4.showme();
|
||||||
|
cin.get();
|
||||||
|
|
||||||
|
Tree change_tree({2, 8, 7}), res5;
|
||||||
|
home.change(3, change_tree, res5);
|
||||||
|
res5.Display();
|
||||||
|
cout << "Operation Change\n";
|
||||||
|
res5.showme();
|
||||||
|
|
||||||
|
cout << "\n ==== The end ====\n";
|
||||||
|
cin.get();
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
23
Part2/3Lab/README.md
Normal file
23
Part2/3Lab/README.md
Normal file
@@ -0,0 +1,23 @@
|
|||||||
|
# AiSD
|
||||||
|
## Тема: Комбинированные структуры данных и стандартная библиотека шаблонов
|
||||||
|
##### Вариант 35
|
||||||
|
|
||||||
|
|
||||||
|
### Цель работы
|
||||||
|
Получение практических знаний по созданию собственного контейнера для работы с множествами и последовательностями
|
||||||
|
### Задание
|
||||||
|
Реализовать индивидуальное задание темы «Множества + последовательности» в виде программы, используя свой контейнер для дерева двоичного поиска с хранением высоты дерева в каждом узле и доработать его для поддержки операций с последовательностями.
|
||||||
|
#### 1. Описание созданного контейнера
|
||||||
|
Для реализации поставленной задачи было решено использовать контейнер Container, на который ссылаются итераторы разного типа: он используется для хранения элементов множества. В основе реализации этого контейнера лежит дерево двоичного поиска, что обеспечивает оптимальное время выполнения операций: поиск, вставка, удаление за O(log n), где n – мощность множества
|
||||||
|
Но при всех плюсах есть существенный недостаток – при работе с элементами множества теряется информация о порядке добавления элемента и возможных повторах элементов
|
||||||
|
Для генерации множества используется генератор псевдослучайных чисел, из-за чего элементы множества могут повторяться. Также для генерации дерева была использована автобалансировка, поэтому элементы располагаются в том порядке, в котором они были разложены при автобалансировке, поэтому порядок элементов отличается от теоретического
|
||||||
|
Использованы две функции вывода дерева: та, которая выводит их в том порядке, в каком они были заложены в контейнер, и та, которая выводит значения узлов дерева, переходя от родителей к сыновьям
|
||||||
|
|
||||||
|
#### 2. Реализованные функции для операций над последовательностями
|
||||||
|
Т.к. в библиотеки algorithm отсутствуют операции CHANGE и SUBST, они были реализованы самостоятельно
|
||||||
|
Функция subst вставляет последовательность B в последовательность А в заданное место. Сложность реализованной функции O(n log n)
|
||||||
|
Функция change заменяет последовательность элементами второй последовательности, начиная с позиции p. Сложность реализованной функции O(n)
|
||||||
|
|
||||||
|
### Вывод
|
||||||
|
Стандартные контейнеры подходят для работы с множествами, однако для работы с последовательностями, где важен порядок добавления элементов в множество, стандартные контейнеры нужно дорабатывать.
|
||||||
|
В результате выполнения лабораторной работы был создан пользовательский контейнер на основе деревьев двоичного поиска
|
||||||
Reference in New Issue
Block a user