OJ Board

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 ...

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 ...

btw if u know how to solve this share it

: 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 ...

@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 ...