Search found 5 matches

by RehabReda
Sat Aug 28, 2010 6:47 pm
Forum: Volume 113 (11300-11399)
Topic: 11385 - Da Vinci Code
Replies: 70
Views: 23484

Re: 11385 - Da Vinci Code

hi all i get wrong answer and don't know why ? is there any test cases ? #include<iostream> using namespace std; char output[101]; int inputPositions[100]; char inputCharacters[101]; int main() { freopen("acm.txt","r",stdin); int noOfTestCases; cin>>noOfTestCases; for(int i=0;i<noOfTestCases;i++) { ...
by RehabReda
Fri Dec 04, 2009 11:35 am
Forum: Volume 1 (100-199)
Topic: 164 - String Computer
Replies: 120
Views: 11320

Re: problem 164 .. why WA !! ???

btw if u know how to solve this share it :D finally i get AC e7l :d lol and ur code also get AC your mistake was as i expected !... when you try to find the path .. 1-you must increment number of add or del at the end of each case , i mean after display the index . 2-in the insertion case .. the in...
by RehabReda
Fri Dec 04, 2009 7:46 am
Forum: Volume 1 (100-199)
Topic: 164 - String Computer
Replies: 120
Views: 11320

Re: problem 164 .. why WA !! ???

btw if u know how to solve this share it :D
by RehabReda
Fri Dec 04, 2009 7:41 am
Forum: Volume 1 (100-199)
Topic: 164 - String Computer
Replies: 120
Views: 11320

Re: problem 164 .. why WA !! ???

: D yup , because i was using my previous implementation of the Edit Distance Algorithm (copy and paste ! ):d btw i had tested ur code .. try to test your program with the following test case , i think it give "out of range" exception ! .. input wrrr awwsa output form uvakit Ia01Cw03Cs04Ca05EMans t...
by RehabReda
Thu Dec 03, 2009 8:33 pm
Forum: Volume 1 (100-199)
Topic: 164 - String Computer
Replies: 120
Views: 11320

Re: problem 164 .. why WA !! ???

@Mans why you use this large size in the array? int table[1000][1000]; char instruction[1000][1000]; and i also get wrong answer :D :D this is my code :D :D #include<iostream> using namespace std; #include<string> int EditDistance[30][30]; int Tracing[30][30]; string FirstString,SecondString; int No...

Go to advanced search