**f0rth3r3c0rd**

Will post my solutions to algorithm problems from uva here so anyone can get hints and figure out their mistakes and of course for the record ðŸ˜‰

Mahmoud Radwan

Advertisements

**f0rth3r3c0rd**

Will post my solutions to algorithm problems from uva here so anyone can get hints and figure out their mistakes and of course for the record ðŸ˜‰

Mahmoud Radwan

Advertisements

%d bloggers like this:

hi , can you please discuss and solve the problem uva 11806 ( cheerleaders )

Am new to algorithms and the pseudo-codes I see in Cormen are easy and understandable but I still find myself dumb-founded when I comes to using these simple algorithms for solving problems. 2 days back I went through BFS, I understood it completely but felt like a idiot when I saw questions like –> UVa : 10067 (Playing with Wheels), UVA â€“ 11405 â€“ Can U Win?, BFS application for solving jar problem, maze problem, cannibals and missionary.

I am extremely grateful to you that now this morning I actually found the concept of BFS actually entering my brain. Keep up with this noble work and Thankyou.

Thank you very much for this great comment, that’s really encouraging me to work on my writing skills and include more explanations rather than just code.

Good luck and keep practicing ðŸ™‚

Thanks a lot for doing this. Keep practicing and the best of luck.

Great job, great web, just one comment: It would be really great if you could use more mnemotechnical variables and comment the code a bit more! Thanks a lot!

SALLAM WAILKUM BROTHER PLEASE POST THE SOLOUTION FOR ACM-ICPC CONTEST PROBLEM MAZE MOVEMENT ITS A MAX FLOW PROBLEM AND SO DIFFICULT THAT DURING THE CONTEST TO NOW NONE HAVE ATTEMPTED THIS PROBLEM. I HAVE NEVER DONE MAX FLOW BEFORE PLEASE POST THIS PROBLEM SO THAT I CAN LEARN MAX FLOW. THE OTHER MAX FLOW PROBLEMS ON THIS SITE CANNOT HELP ME UNDERSTAND WHAT I NEED, BECAUSE THIS IS AM ACM-ICPC CONTEST QUESTION…IT WILL BE A CHALLENGE EVEN FOR THE BEST PROGRAMMER!!!