Page 3 of 3
Posted: Sat Jun 10, 2006 7:34 pm
Julien Cornebise wrote:
I'll try this as soon as I'll have recuperated from SWERC (it was today, and I'm a bit dead)...
I would recommend reading this http://online-judge.uva.es/board/viewto ... 7371#47371
this is far more understandable then all IDA thing in vague terms.
529 - too slow
Posted: Fri Feb 23, 2007 3:50 pm
hello everyone . i have tried to solve this problem using dfs method. but it becomes extremely slow after input is >= 25. how do i make it faster. can u give me hints......
Code: Select all
# include <iostream>
# include <vector>
using namespace std;
void dfs(int sum,int s)
for(int j=0;j<s;j++) p[j]=a[j];
Posted: Fri Feb 23, 2007 7:16 pm
You can use IDA* search.