OJ Board

I think that there is a mistake in the second image. The subscript of the last number should be i, x(i-1) and not i, x(i). I hope some admin notices this and fix the mistake. I don't know where else to report this so I am posting this here.

#include<cstdio> #include<map> #include<vector> #include<string> #include<algorithm> #include<iostream> using namespace std; //#include<conio.h> void articulation_point_visit (vector<int> *list, int* d, int* low, int* child_cnt, int n, int& time){ low[n]=d[n]=time++; int l=list[n].size(); for(int v...

here is the code #include<cstdio> #include<cstring> //#include<conio.h> #define MAX 'z' #define MIN 'a' #define INFINITY 20000000000000000LL typedef int vertex; struct edge{ vertex u, v; }; void bellman_ford(vertex source, long long* dist, edge* list, int* wt, int sz){ for(vertex i=MIN; i<=MAX; i++)...

When I tried to find the minimum distance by Bellman Ford it was giving WA. So, I tested if the graph is connected or not and I found that some unconnected graph is there contradicting the problem statement. so, there is a mistake in data set.

thanks

it does pass the input in the board

probably u r right......I will try to implement it in better way

can anybody tell me the problem with my programs? I solve dit by two methods.but both are giving TLE first i jaust implemented the LCS On^2 algo for the string and its reverse to find the palindrome #include<iostream> #include<string> #include<algorithm> using namespace std; string c, rc, a[1024][10...

thanks ..

i will try to implement the idea

thanks...

But this is pathetic that something given in problem description is wrong

can somebody help me out?

thanks in advance

hello

I don't understand why i keep getting TLE

can somebody help

here is my code

thanks...

to see that nobody has been able to do it is disheartening

can anybody give some test cases or an explaination of the problem. Here is my code #include <iostream> using namespace std; int a[128], n; long long m, c[101][101]; void perm(){ int i, j; for(i=0; i<101; i++){ c[i][0]=1; c[i][i]=1;} for(i=1; i<101; i++) for(j=1; j<i; j++) c[i][j]=(c[i-1][j]+c[i-1][...

thanks to all who helped me, i hv now got it ac
there was a bug, logic was fine

thank to all once again

actually in c++ -1%3 is giving -1 and not 2, i wonder why cna smbd tell

but still i fixed this problem and got the correct ans for the sample i/o

but still i am getting wrong ans

anyway thanks to all for the help

i hv already done that and since looping through diagonals but got TLE

i know hw to find no. of 1s in btweem i and j index of binary array with O(1) and O(n) precomputing.

but in this problem there will be a n*n binary array and n*n order precomputing will give TLE

i really don't know what to do