Multithreading-C-11/Calc.cpp at master · serenityFX/Multithreading-C-11 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include "Calc.h"
//-------------------------------------------------------------------------------------------------------------------
int Calc::factorization(size_t value, Map & map, std::string *error)
{
	if (value < MIN_INPUT_VALUE || value > MAX_INPUT_VALUE)
	{
		if (error != nullptr)
		{
			error->clear();
			error->append("Value is invalid");
		}
		return EXECUTE_ERROR;
	}

	// We have simple value
	if (simpleNumbers.count(value))
		add(value,1,map);
	else
	{
		for (auto s : simpleNumbers)
		{
			if (value == 1) break;

			if (value % s == 0)
			{
				int cnt = 1;
				value /= s;

				while (value % s == 0)
				{
					cnt++;
					value /= s;
				}

				add(s, cnt, map);
			}
		}
	}

	return EXECUTE_SUCCESSFULLY;
}
//-------------------------------------------------------------------------------------------------------------------
int Calc::factorizationR(uint64_t value, Map & map, std::string *error)
{
	// We have simple value
	if (simpleNumbers.count(static_cast<size_t>(value)))
		add(static_cast<size_t>(value), 1, map);
	else
	{
		for (auto s : simpleNumbers)
		{
			if (value == 1) break;

			if (value % s == 0)
			{
				int cnt = 1;
				value /= s;

				while (value % s == 0)
				{
					cnt++;
					value /= s;
				}

				add(s, cnt, map);
			}
		}
	}

	return EXECUTE_SUCCESSFULLY;
}
//-------------------------------------------------------------------------------------------------------------------
int Calc::smallMult(size_t max, const Map & map, uint64_t & result, std::string *error)
{
	if (max < MIN_INPUT_VALUE || max > MAX_INPUT_VALUE)
	{
		if (error != nullptr)
		{
			error->clear();
			error->append("max is invalid");
		}
		return EXECUTE_ERROR;
	}

	Map curr;
	std::string err;
	if (factorization(max, curr,&err) == -1)
	{
		if (error != nullptr)
		{
			error->clear();
			error->append("In function smallMult " + err);
		}
		return EXECUTE_ERROR;
	}

	for (auto m : map)
	{
		if (!curr.count(m.first)) curr[m.first] = m.second;
		else
		{
			if (curr[m.first] < m.second)
			{
				curr[m.first] = m.second;
			}
			/*if (m.second == curr[m.first])
				curr.erase(m.first);
				else if (m.second > curr[m.first])
				curr[m.first] = m.second - curr[m.first];
				else
				curr[m.first] -= m.second;*/
		}

		/*result *= static_cast<uint64_t>(pow(m.first, curr[m.first]));*/
	}

	result = 1;
	for (auto c : curr)
		result *= static_cast<uint64_t>(pow(c.first, c.second));

	return EXECUTE_SUCCESSFULLY;
}
//-------------------------------------------------------------------------------------------------------------------
int Calc::add(size_t key, int value, Map & map)
{
	if (!map.count(key) || map[key] < value)
		map[key] = value;

	return EXECUTE_SUCCESSFULLY;
}
//-------------------------------------------------------------------------------------------------------------------