OJ Board

Got Accepted in http://www.programming-challenges.com/ but Wrong Answer in UVA , help needed

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility ...

plz somebody help i m keep getting wrong answer , above test cases r running :oops: :oops:

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include ...

Using dfs , i m getting a TLE.Can anybody explain how can i use memorization in this to get rid of TLE !!!!!!!

Thanks in advance !!!!!!!!!!!!

// using the dfs
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm ...

#include<iostream>
#include<cmath>
using namespace std;
int main()
{ double s,d;
while(cin>>s>>d)
{ double t=pow((double)s,(double)2);
double q=(double)2*(double)d;
double re=t+q-s;
re=((double)4*(double)re)+(double)1;
double pe=sqrt(re);
pe=(double)pe-(double)1;
pe=(double)pe/(double)2 ...