OJ Board

I can't find what's wrong with this code. Getting repeatedly WA. Please Help someone...


#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<string>
using namespace std;

struct Point{
long long x;
long long y;
}pnt;

class Comparator
{
public:
bool operator()(Point ...

#include<iostream>
#include<cstdio>
#include<map>
#include<string>
#include<vector>
#include<queue>
#define sz 10005
#define inf 999999
using namespace std;

int main()
{
string str, S;
bool flag, vs[sz];
long f, id, ind, ln, P, N, T, erdos[sz];

scanf("%d", &T);

for(long i=1;i<=T;i ...

#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;

int main()
{
vector<long long>v;
long long n, nxt, fst, T, d, result, last, val;

cin>>T;

for(long long i=1;i<=T;i++)
{
cin>>n;

fst = 0;
for(long long j=1;j<=n;j++)
{
cin>>nxt;

d = nxt ...

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
#include<set>
#define sz 100
using namespace std;

struct PrDes
{
int cnt;
string name;

bool operator < (const PrDes& p)const
{
if(cnt > p.cnt)
return true;

else
if(cnt == p.cnt ...

#include<iostream>
#include<cstdio>
#define sz 105
#define inf 99999
using namespace std;

long pr[sz], matrix[sz][sz];

long path(long r, long n)
{
for(long i=1;i<=n;i++)
matrix[i][r] = matrix[r][i] = inf;

if(pr[r] == r)
return r;

else
return path(pr[r], n);
}

long shortestPath(long n ...

#include<iostream>
#include<cstdio>
#include<vector>
#include<cmath>
#define sz 205
#define inf 9999
using namespace std;

vector<long long>myVec[sz];
vector<double>dst[sz];

double findPath(long long r, long long pr[], double st[][sz], double mn)
{

if(pr[r] == r)
{
printf("Frog Distance ...

It's showing RE. But why???

thnx brianfry713...

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
using namespace std;

string sortedString(string ch)
{
int len = ch.length();

for(int i=0;i<len-1;i++)
{
for(int j=i+1;j<len;j++)
{
if(ch[i]>ch[j])
{
char t = ch[i];
ch[i] = ch[j];
ch[j] = t;
}
}
}
return ch;
}

int ...

thnx brianfry713
finally got AC...

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
using namespace std;

map<string, int>myMap;

int permutation(string prefix, string ch)
{
int n = ch.length();
for(int i=0;i<n;i++)
{
char tmp = ch[0];
ch[0] = ch[i];
ch[i] = tmp;

if(n==1)
{
if(myMap[prefix+ch]==0 ...