OJ Board

I solved it using recursive backtracking with DP memoization (table size 1 << 12 by 1 << 12). At each state, you try all remaining bits. *<<Take the bit that results in the least number of additional questions in the worst case>>*.

hello brianfry713,
please, can u explain why we are considering ...

thanks brianfry713 for your help.
i have found my mistake.

i am getting WA ans for this problem. But it gives the same output as UVA toolkit for random test cases.
Don't know whats wrong with my code.
please some one take a look at my code (specially @brianfry713 :) ).

thanks in advance


#include <iostream>
#include<cstdio>
#include<cstring>
using ...

hello brianfry713,
just got AC .
I don't know how to thank you.
You are just awesome!
can i have your email address? i am new to uva and i need some suggestion from you.

thanks brianfry713 for your reply.
here is my code.
its gives the same output for the test cases you have supplied.

#include <iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
int n;
int flag[20];
double t[150000];
class pr{
public:
int x;
int y;
};
pr a[20 ...

Ya, my things are right. I was Guest up there, and it turns out I forget to declare hypot (otherwise it returns int on the judge). Whoops.

my code gives the same output as yours for the above test cases but still i am getting wrong ans. And i have not declared hypot. i am new to Uva and don't ...

Hi,
I want to solve this problem using DP. But could not find the technique how to solve it using DP. please someone describe the algorithm.
thanks in advance.

hi,
I am new to UVa. i am getting WA for 562-Dividing coins problem. it will be very helpful if someone help me.
thanks


#include<iostream>
using namespace std;

int main()
{
int n,i,j,cases,min;
long long int s,w;
int a[2005];
int m[2005];
cin>>cases;
while(cases--)
{
cin>>n;
s=0;
for(i ...