OJ Board

serur wrote:You can dispense with edit distance altogether - just try to modify each word and see what comes of it. I'm the first in the ranklist.

i am not sure abt the algo u r using to get the word changed.. can u plz xplain the same un little more detail..

/*Sushil Kumar Singh */
#include <cassert>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <cstdarg>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include ...

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<sstream>
#include<queue>

using namespace std;
struct point
{
double x,y;
};
int main()
{
double speed, tim;
cin>>speed>>tim;
while(speed!=0 && tim!=0)
{
tim*=60.0000000;
vector<point>v;
double maxi=tim*speed ...

here is the source code
#include<iostream>
#include<fstream>
#include<cmath>
#include<algorithm>
#include<iterator>
#include<stack>
#include<list>
#include<queue>
#include<set>
#include<string>
#include<map>
#include<functional>
#include<utility>
#include<vector>
#include<deque>
#include<iomanip ...

can ny1 xplain me plz...
how cum the output of 1 2 3 0 0 0 be 1

i think i din't get the question well
reply urgently needed folks
i have already so many WA's
plz

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
//#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
//#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath ...

#include<iostream>
#include<fstream>
#include<cmath>
#include<algorithm>
#include<iterator>
#include<stack>
#include<list>
#include<queue>
#include<set>
#include<string>
#include<map>
#include<functional>
#include<utility>
#include<vector>
#include<deque>
#include<iomanip>
typedef long long LL ...