-
Notifications
You must be signed in to change notification settings - Fork 0
/
mathutility.h
152 lines (125 loc) · 2.53 KB
/
mathutility.h
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#ifndef MATHUTILITY_H
#define MATHUTILITY_H
#include <iostream>
#include <string>
#include <algorithm>
#include <chrono>
template<typename T>
bool isEven(T Number)
{
return ((Number & 1) == 0);
}
template <typename T>
bool isPrime(T n)
{
for (T i = 2; i <= sqrt(n); i++)
{
if (n % i == 0)
return false;
}
return true;
}
template <typename ull = int long long>
ull sum_pow1(int N)
{
ull sum1 = 0;
for(int i=1; i<=N; ++i)
{
sum1 += i*i;
}
return sum1;
}
template <typename ull = int long long>
ull sum_pow2(int N)
{
ull sum1 = 0;
for(int i=1; i<=N; ++i)
{
sum1 += i;
}
return sum1*sum1;
}
template <typename T>
bool isPalendrom(T number)
{
std::string str1(std::to_string(number));
std::string str2;
str2.resize(str1.size());
std::reverse_copy(str1.begin(), str1.end(), str2.begin());
return str1 == str2;
}
template <typename T>
T getTriangularNumber(T number)
{
return (number*(number + 1))/2;
}
template<typename T>
T divisors(T x)
{
T limit = x;
T numberOfDivisors = 0;
if (x == 1) return 1;
for (T i = 1; i < limit; ++i)
{
if (x % i == 0)
{
limit = x / i;
if (limit != i)
{
numberOfDivisors++;
}
numberOfDivisors++;
}
}
return numberOfDivisors;
}
template <typename T>
void funcCollatz(T number, T &countChain)
{
++countChain;
if(number == 1)
{
return;
}
if(isEven(number))
{
funcCollatz(number/2, countChain);
}
else
{
funcCollatz(3*number + 1, countChain);
}
}
template<typename T>
T factorial(T n)
{
return (n == 0)?(1):(n * factorial(n - 1));
}
inline int charToInt(char ch)
{
return (int)ch - (int)48;
}
using namespace std::chrono;
class Profiler
{
public:
Profiler(bool endPrint = false):
isPrintEnd(endPrint),
start_point(high_resolution_clock::now())
{}
~Profiler();
void start();
void stop();
friend std::ostream& operator << (std::ostream& s, const Profiler &p)
{
s.width(12);
s.precision(7);
s << std::fixed << p.time_span.count() << " sec";
return s;
}
private:
bool isPrintEnd;
high_resolution_clock::time_point start_point;
duration<double> time_span = {};
};
#endif // MATHUTILITY_H