Mine is here - http://www.codechef.com/viewsolution/3815607
combination of statements
char* a; // ... a[m][j]
is strange isn’t it?
i used to work on Turbo c++ and it used to work on it.
and also i am new to codeshef.
But Yes It seems strange,
its working now but ,
time limit exceed,
but i m trying to develop better logic.
You was kind of lucky, your code is not working on ideone I had to change
Scanner s = new Scanner(System.in); String str = s.nextLine();
//Scanner s = new Scanner(System.in); String str = rea.nextLine();
and the code returns 0 4 0 for input from problem statement http://ideone.com/UyDMNu , can you fork it and fix it on ideone?
Your code is not working on ideone, can you fix it? http://ideone.com/1AnFUY I used your last submission in practice…
try this test case <<>.The answer should be 0 , but ur code gives 2.
why so coz <<> last two brackets are matching which is the case with the official test case of <>>> which gives 2 as output.
plz clarify it
you should output the length of the longest prefix
thanku got it
ad hoc means something that is not known in advance
ANswer for ><<>> should be 0
Why so ?? I can see that I have valid string of length 4 here
Read the problem statement carefully it has asked for length of longest valid ‘prefix’ , so the expression must start with ‘<’. Hope it helps!
They have asked “Prefix”. Read question again. Even first ‘>’ gives answer 0 as there is no valid prefix. There is no need to check further.
is my code, please let me know where’s the mistake.
I tried various test cases and they display correct output. I used pair parentheses algorithm to solve it and have then multiplied the count object by 2 to get the output.
Can someone plz point out the mistake here… i do not understand y this is giving WA.