Algorithms/Binary_application.cpp at master · asimali246/Algorithms · 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
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<iomanip>
#include<algorithm>
#include<stack>
#include<vector>
#include<fstream>
using namespace std;
typedef vector<int> vi;
double p,q,r,s,t,u;
double rounding(double ans)
{
    ans*=10000000.0;
    ans+=.5;
    int x=floor(ans);
    return (double)x/10000000.0;
}
int check(double val)
{
    double ans=0.0;
    ans=p*exp(-val)+(q*sin(val))+(r*cos(val))+(s*tan(val))+(t*val*val)+u;
    ans=rounding(ans);
    if(ans==0)return 0;
    if(ans<0)
        return -1;
    if(ans>0)return 1;
}
int main()
{
    int flag=0;
    while(scanf("%lf %lf %lf %lf %lf %lf",&p ,&q, &r, &s, &t, &u)!=EOF)
    {
        double x=0.0,y=1.0;
        flag=0;
        int ll=0;
        double mid=0.0;
        if(check(1.0)==0){flag=1;mid=1.0;}
        if(check(0.0)==0){flag=1;mid=0.0;}
        if(flag!=1){
        for(int i=1;i<=35;i++)//log base 2 (1-0)/10**-9;
        {
            mid=(x+y)/2.0;
            int l=check(mid);
            if(l>0)
                {ll=1;x=mid;}
            if(l<0)
                {y=mid;ll=-1;}
            if(l==0)
                {flag=1;break;}
        }}
        if(flag==1)printf("%.4lf\n", mid);
        else printf("No solution\n");
    }
    return 0;
}