-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtriangle.h
90 lines (79 loc) · 1.52 KB
/
triangle.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
#pragma once
#include "figures.h"
//using namespace std;
class triangle :public figures
{
public:
triangle();
triangle(point vert[]);
~triangle();
bool isRightTriangle(); //ïðÿìîóãîëüíûé
bool isIsoscelesTriange(); //ðàâíîáåäðåííûé
bool isEquilateral(); //ðàâíîáåäðåííûé
double area();
void formEdges();
};
void triangle::formEdges()
{
e[0] = length(v[0], v[1]);
e[1] = length(v[1], v[2]);
e[2] = length(v[2], v[0]);
}
triangle::triangle()
{
n = 3;
e = new double[n];
v = new point[n];
for (int i = 0; i < n; ++i)
{
srand(i + time(NULL));
v[i].x = rand() % 10;
srand(time(NULL) + i + 10);
v[i].y = rand() % 10;
}
formEdges();
}
triangle::triangle(point vert[])
{
n = 3;
e = new double[n];
v = new point[n];
for (int i = 0; i < n; ++i)
{
v[i] = vert[i];
}
formEdges();
}
bool triangle::isRightTriangle()
{
if (TriangleInequality())
{
if (isRightAngle(v[0], v[1], v[2])) return true;
else if (isRightAngle(v[2], v[0], v[1])) return true;
else if (isRightAngle(v[1], v[2], v[0])) return true;
}
return false;
}
bool triangle::isIsoscelesTriange()
{
if (TriangleInequality())
{
if (abs(e[0] - e[1]) <= eps || abs(e[0] - e[2]) <= eps || abs(e[1] - e[2]) <= eps) return true;
}
return false;
}
bool triangle::isEquilateral()
{
if (TriangleInequality() && abs(e[0] - e[1]) <= eps && abs(e[0] - e[2]) <= eps) return true;
return false;
}
double triangle::area()
{
double p = perimeter() / 2;
return sqrt(p*(p - e[0]) * (p - e[1]) * (p - e[2]));
}
triangle::~triangle()
{
delete[]e;
delete[]v;
}