-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBisection Method Example 1 [Shafaet's Planet].cpp
132 lines (127 loc) · 3.91 KB
/
Bisection Method Example 1 [Shafaet's Planet].cpp
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
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
#include <list>
#include <map>
#include <utility>
using namespace std;
typedef long long int ll;
typedef int _i;
typedef vector<int> vi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef priority_queue<int> pqi;
typedef priority_queue<long long int> pql;
typedef priority_queue<string> pqs;
typedef map<int, int> mii;
typedef map<long long int, long long int> mll;
typedef map<int, string> mis;
typedef map<long long int, string> mls;
typedef map<string, int> msi;
typedef map<string, long long int> msl;
typedef pair<int, int> pii;
typedef pair<long long int, long long int> pll;
typedef pair<int, string> pis;
typedef pair<string, int> psi;
typedef pair<long long int, string> pls;
typedef pair<string, long long int> psl;
typedef queue<int> qi;
typedef queue<long long int> ql;
typedef queue<string> qs;
#define IMAX 2147483647
#define IMIN -2147483646
#define fr(x) freopen(x, "r", stdin)
#define fo(x) freopen(x, "w", stdout)
#define pfi(x) printf("%d", x)
#define pfin(x) printf("%d\n", x)
#define pfl(x) printf("%lld", x)
#define pfln(x) printf("%lld\n", x)
#define pff(x) printf("%f", x)
#define pffn(x) printf("%f\n", x)
#define pfd(x) printf("%lf", x)
#define pfdn(x) printf("%lf\n", x)
#define pfc(x) printf("%c", x)
#define pfcn(x) printf("%c\n", x)
#define pfcs(x) printf("%s", x)
#define pfcsn(x) printf("%s\n", x)
#define pfs(x) printf("%s", x.c_str())
#define pfsn(x) printf("%s\n", x.c_str())
#define pfn() printf("\n")
#define pfsp() printf(" ")
#define sci(x) scanf("%d", &x)
#define scii(x, y) scanf("%d %d", &x, &y)
#define scl(x) scanf("%lld", &x)
#define scll(x, y) scanf("%lld %lld", &x, &y)
#define sclll(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define scf(x) scanf("%f", &x)
#define scff(x, y) scanf("%f %f", &x, &y)
#define scd(x) scanf("%lf", &x)
#define scdd(x, y) scanf("%lf %lf", &x, &y)
#define scc(x) scanf(" %c", &x)
#define sccs(x) scanf("%s", x)
#define scss(x, y) scanf("%s %s", x, y)
#define scs(x) getline(cin, x)
#define gt() getchar()
#define pb(x, y) x.push_back(y)
#define pu(x, y) x.push(y)
#define mp(a, b) make_pair(a, b)
#define mset(x, y) memset(x, y, sizeof(x))
#define pcase(x) printf("Case %d: ", x)
#define lp(a, x, n, y) for(a=x; a<n; a+=y)
#define lpe(a, x, n, y) for(a=x; a<=n; a+=y)
#define sln(x) x.size()
#define acl(x) x.clear()
#define qcl(x) {while(!x.empty()) x.pop(); }
double square_root(double n) { /// calculatin square root of n using bisection method
double low, high, mid, x;
low = x = 0.0;
high = n;
while(n-x>0.000000001) {
mid = (low+high)/2;
x = mid*mid;
if(x>=n) {
high = mid;
}else {
low = mid;
}
}
return mid;
}
double calculate(double ab, double ac, double bc, double r) { /// calculating the value of ad by bisection method when ab, ac, bc and the ratio of ade / bdec is given
double ad, de, ae, bd, ce, x, ade, bdec, low, high, s, h, r1;
low = r1 = 0.0;
high = ab;
while(r-r1>0.000000001) {
ad = (low+high)/2;
x = ad/ab;
de = bc*x;
ae = x*ac;
bd = ab-ad;
ce = ac-ae;
s = (ad+de+ae)/2;
ade = square_root(s*(s-ad)*(s-de)*(s-ae));
h = square_root(((bc+bd+ce-de)*(bd+de+ce-bc)*(bc+ce-bd-de)*(bc+bd-ce-de))/(4*(bc-de)*(bc-de)));
bdec = ((bc+de)/2)*h;
r1 = ade/bdec;
if(r1>=r) high = ad;
else if(r1<r) low = ad;
}
return ad;
}
int main()
{
int i;
double a, b, c, r;
pfcsn("AB, AC, BC, R"); /// here r = ade / bdec
while(scanf("%lf %lf %lf %lf", &a, &b, &c, &r)==4) {
printf("AD = %0.18lf", calculate(a, b, c, r));
pfn();
}
}