All about problems in Volume 5. If there is a thread about your problem, please use it. If not, create one with its number in the subject.
Moderator: Board moderators
- Learning poster
- Posts: 76
- Joined: Thu Mar 13, 2003 5:12 am
- Location: Russia
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.
it would be great if you replied this post. really.
- New poster
- Posts: 43
- Joined: Sun Sep 24, 2006 2:39 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];
- Posts: 1334
- Joined: Wed Jun 22, 2005 10:58 pm
- Location: Dhaka, Bangladesh