TopCoder SRM 633 Div 2 500

#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;


class Jumping {
public:
  string ableToGet(int x, int y, vector <int> jumpLengths) {
    int sum=0;
    for(int j=0;j<jumpLengths.size();j++)
            sum+=jumpLengths[j];
    double distance = sqrt (x*x+y*y);
    if(sum<distance)
        return "Not able";
    else if(abs((double)sum-distance)<0.00001) // This is to check if they are equal.
        return "Able";
    else
    {
        double temp=sum+distance;
        for(int j=0;j<jumpLengths.size();j++)
            if(temp-jumpLengths[j]<jumpLengths[j])
                return "Not able";
    }
    return "Able";
  }
};


//Powered by KawigiEdit 2.1.4 (beta) modified by pivanof!