OJ Board

i did some problem with grammer(bnf).But i am puzzled with 622.
can anybody give me some idea about how to select appropriate grammer out of the choices?

Waiting for your idea!!

I just used BFS..

I am getting WA..

I generated All possible input and saw that my code goes wrong anser
for 4 inputs. They Are

g2 h1
h1 g2
g7 h8
h8 g7
g8 h7
h7 g8



My code produce 2 moves As result. In fact it needs 4 moves.

I am not getting reason Why my BFS will fail for this inputs only ...

Thanks For your reply..

Actually i think the problem is in Stl Library

The judge does not support some STL function.

How ever i changed All STL and Also the Algol i bit.

Now i got AC.

I got 6 time Compile Error on this probs..

Some one pls help me find out the bug..


#include<iostream>
#include<string>
#include<stdlib.h>
#include<string.h>
#include<stdlib.h>

struct l{

int length;
int start;
int idx;


}list[26];



struct d{
char word[26];
int serial;

}Dict[250001 ...

INPUT::
2
12
10000000
11111111
12345678
98746521
4587754
1
7485874
8888888
9999999
4512454
0

OUTPUT::
2 2
12 8
10000000 113
11111111 41
12345678 68
98746521 41
4587754 5
1 1
7485874 14
8888888 32
9999999 23
4512454 5

Is there any proof that this problem can be solved by greedy strategy?
I got AC. But one thing I don't know why it works. What's the reason behind it?

One more extra thing:

In first attemp I sorted both the Team and Table. But I got WA. I don't know why? Because if in the input set the Tables are ...

Can any body provide me a C/C++ implementation of preflow push algorithm.

or any link.

Thank U . I just forget that on success isupper() returns a non zero value not exactly 1.
Again THank U for posting....and keep dreaming..

pls tell me some input for getting WA or help me to find probs here>>

#include<stdio.h>
#include<ctype.h>
#include<string.h>


struct m{
char ch;
long row;
long col;
};


char stack[1000];


int main()
{

struct m matrix[150],first,second,tmp;
char str[10000];
char ch_index = 'a'-1;
char a ...

Anyone please help me how to start dynamic programming and greedy algorithm.
Pls give tips as well as some good links for solving naive dynamic and greedy problems .. with increasing difficulty level.

THank YOu For visiting this topics.

Zyaad Jaunnoo wrote:Hope that helps..

http://personal.vsnl.com/erwin/recursion.htm

Have fun

Thank u for this.
This is really a good link for the beganner..

Some body plsease tell me how to do well in recursive problems.
Please give also some easy recursive problem no of acm or any other
problem set.

I will be grateful if you give me some nice links about recursive problems.

Can u give me some input for which WA ? or where i am wrong in this code?
[/code]
#include<stdio.h>
#include<string.h>
#include<math.h>

char num1[20],num2[20];

void cancel_leading_zero(char p[],char q[])
{
int i,j,l1;
l1 = strlen(p)-1;
for(i = 0;i<l1;i++)
{
if(p[0]=='0')
p++;
else
break ...

Anyone pls tell me what mistake i did .

//submit today...

#include<stdio.h>


unsigned long store[500100],max = 0,count= 0;

void initialise()

{
unsigned long i,j;
for(i = 0;i<500009;i++)
store[i] = 0;


}


int main()
{
unsigned long in,i;
unsigned long a,b;
//freopen("10763.in","r ...

Sorry, as i did not gave the number. In fact the number is 10719 (Quotient Polynomial). So i am waiting for a reply.