OJ Board

Thanks for your reply. I understand the problem. But how can i solve this problem efficiently.

I am trying to understand this problem but failed. Can anyone explain how to solve this problem ?

I am getting wrong answer. help me.
here is my code:

I am getting wa. Help me Here is my code #include<stdio.h> #include<stdlib.h> #define size 1010 char maze[size][size]; int r1[4]={-1,1,0,0}; int c1[4]={0,0,1,-1}; int impossible,min,r,c; void dfs(char maze[size][size], int row, int col,int count); int main() { int t,row,col,i,j,f; scanf("%d&quo...

Thanks for your reply. My approach of coding is wrong. Will you explain how to solve this problem? I read all the posts in this thread. But the coding procedure is not clear to me. If you explain i will be glad.

I am getting TLE.help me. #include<stdio.h> #include<string.h> void found(int id1, int *p,int N); int main() { int id,N,i,right,center,left,sum,len; char A[34],source[34],destination[34]; int identi[10]; while(scanf("%d%d%s",&id,&N,A)==3) { A[N]='\0'; len = strlen(A); found(id,iden...

After removing that line i am still getting wrong answer.

Help me. I am getting wrong answer for this problem. here is my code #include<stdio.h> #include<math.h> #include<string.h> #include<vector> #define N 1000000 using namespace std; bool a[N]; vector<int> primelist; void seive() { int i,j,k; memset(a,true,sizeof(a)); a[0]=a[1]=false; for(i=4; i<N; i+=2...

I used prim's algorithm.

I am getting wrong answer for a long time. if any one help me to find out the problem. #include<stdio.h> #include<math.h> #include<stdlib.h> double distance(int x1,int y1,int x2,int y2); struct node{ int x; int y; }V[510]; double w[510][510]; double dis[510],k[510]; int h[510],p[510]; int compare (c...

Thank you for your reply. I got accepted.

Getting wrong answer for this problem. If any one help to find out the error i will be glad . #include<stdio.h> #include<math.h> void cloud(int oldvalue,int newvalue,int N); double distance(int x1,int x2,int y1,int y2); void heapsort(long int count); void Build_Max_Heap(long int count); void Max_Hea...

Thank you for your reply. I got accepted.

I am getting run time error. but i am unable to find out the error. if anyone help i will be glad. here is my code #include<stdio.h> #include<string.h> void BFS(int i); int dequeue(); void enqueue(int k); struct node { int node_value; char color[7]; } V[21]; int a[21][21]; int s[110][2]; int main() ...

Thank you for your reply.