OJ Board

# include<iostream>
# include<string>
# include<vector>
bool find_(vector<char> &A,int i,char s)
{
for(int j = 0;j <= i;j++)
if(A[j] == s)
return true;
return false;
}
int main()
{
vector<char> A,B;
char c;
int count = 1;
while(cin.get(c))
{
if(c == '#')
break;
while(c != '\n')
{
A ...

if A is the adjacency matrix



summation from i = 1 to n-1(A ^ i) gives me the no of walk bet any two vert of len <= n-1



similarly i do upto 2(n-1) and see if the no has increased if it has then the no of paths is inf else the no of paths bet x and y is the entry[x][y] in the summed matrix ...

I got the following code with all test cases i got my hands on to
it seems to work fine but WA
can anyone please help
BTW i dont know how to add my code to this page[/cpp]

i dont clearly understand the qn
say that a cyle 1 2 1 gives .04% profit
the is cycle 12112121 also valid arbitage seq (the length of cycle is less than the no of countries)