OJ Board

hey that's rite...

then rio means

0 1
1 0

if the ans is 2
then
are two different undirected edges.....
that means there can many edges b/w the same two nodes....
so that resulting in first bactracking b/w the nodes...

i have modified the code a bit i guess...
plz tell me why wa....

hell guys ..
can anybody tell why wa.. i know backtrackin is quite okay....
here's my code....

both of problems 524 & 539 are just workin fine g++ compiler of mine after a while i m solving in acm .... its changed now i guess.... here's my code for 524 .. plz tell me guys why compile error.... # include <iostream> # include <vector> # include <string> # include <cstring> # include <algorithm>...

this problem i know it is bactrackinh but still modulo it in circular way is bit
difficult for me so plz some body tell me how to go about it
here is the link

http://www.amrita.edu/icpc/2006/Problems-Onsite.pdf

hi sohel
i hav sem v exam write after the regionals so many people dont want
take chance since it is on 18th ...
regionals is on 16 17 hence none of people are agreeing for the regionals
ie reason why coach is not commin...
see u coimbatore..

hi sohel
the team name is 2greedy
is mandatory to hav a 3 team members..
is there any instance where there r 2 members allowed on request...
hi wat is ur team name...

so i write to the contest director..

according icpc rules r we supposed hav 3 mandatory members of team or is two member is suffient .. could u plz let us no on that.. since we hav ur VTU exams in the same week its very tough for the coach to come... since we may hav ur lab exams in same week..plz let me no this brother// thanks in adv...

i think we made it in to regionals at coimbatore india.. if we dont get selected to world finals .. would we get atleast a certificate for travelling so far..or a T-shirt.. while we hav our graduate exams in the same week.. just out of curiosity could some previous regional finalist tell me about th...

hi i think this is bytecode 06 problem..
i getting sol for this O(n^3),i heard that we hav sol in method called
suffix array ,i didn't understand how to get O(n^2) using this method
could somebody plz tell me how..

hi guys i hav been getting wa , for this problem for quite some time its just a simple bfss.. but in problem there is no mention of number of cities(nodes) could some body tell me wat's wrong in code.. plx x give me some test cases...... :-? #include <iostream> #include <string> #include <vector> #i...

hi thanks ..
could u help me with a link on the web which deals with this case..

hi guys.. could any body tell me about how generate all possible LCS b/w two strings ..i hav tried backtrack sol which didnt work ..probably wasted around 3 days trying to find the alll possible lcs b/w string ... (Firstly is it possible without trying all possible brute approach..i think not..)(i s...

i guess u should refer some algo standard text ....

hi guys i m getting wa for 147...
i just dont no whether the formatting of o/p is proper or not....
here's my code ...