OJ Board

I got ac... my process is... I find every sub string by using substr() function and use a map to count the frequency of those substring. just like this. map<string,int>mp; string b=input.substr(address,length); mp ++; then I found the max frequncy simply by linear search. But, by this process..... i...

I have got RE.... Please help.


Here is my code.

Thank you. I have got ac now...actually I didn't understand the problem. I thought a player can take only one object. But it is wrong. It is possible to take any number of object. Thanks to maccy who opened my eyes. I was a fool.

got ac......

what's wrong with this problem?? f (n) = a x 2 + b x + c .... here what should I think?? Is it b*x or 'x' is here for multiplication.If so....where is other variable?? Again..... test cases are also confusing. 3rd and 4th test case are same but answer is different. :-? Plz...help. I got WA. I didn't...

@ suneast: I did not solve this problem using greedy method. Actually I have't learn this method yet. Need to study a lot....

I solved this problem using simple brute force considering some test cases.

just got ac....

My code was giving WA for these test case....
input: output:

I tried a lot. but all I got is WA. Should I consider blank line for input??? Plz...give some more inputs.

I have tried all the test cases and got correct answer. but still WA. Althougth my code is not follow greedy stategy, but I cannot find my mistake. I need some more test cases.

Anyone can give some critical test case??? I got continuous WA...plz help....

I get TLE...Help me...I can't understand how can I reduce the time....here is my code.... #include<stdio.h> #include <iostream> #include <queue> using namespace std; int r,s,i,j,k,n,m,cas,l,l1,N,G[10001][10001],co,v[10001],flag,f[10001],lp; queue<int> q; void BFS(int start_v, int n) { v[start_v]=1; ...

The original statement was something like: Given N strings, find two that can give you the largest number of matched characters between them if you write one underneath the another. You can see that there are so many problems with that statement but, in retrospect, it would have been less confusing...

Solved a moment ago ...I used LCS. It takes 0.020 sec.

what is wrong?? I get correct output but still WA. Is there any difficulty in getting input?Here says there is a blank line between two input. But if I get input with scanf("%s %s",a,b)...should I consider the blank line? My output is correct for the given output in the other post. And als...

I cannot find what is wrong. But contiously get WA. Here is my code. #include<stdio.h> #include<math.h> long i,j,k,n,l,m,t1,t2; long a1,b1,a2,b2,a3,b3,a4,b4,flag; float d1,d2,d3,d4,r1,r2; void set(); int main(){ scanf("%ld",&m); for(l=0;l<m;l++){ scanf("%ld %ld %ld %ld %ld %ld %ld...