OJ Board

I solved it using both DP and greedy. Greedy is as follows: 1. Take one guy with maximum value 2. Take two appropriate guys with minimum sum of values However, I have not proved it. This greedy should not pass the judge, as it does not work for the following input: 9 8 8 7 7 7 7 6 6 4 0 In the firs...

Disatoba wrote:HI I got WA in problem 120, i dont know why? would someone help me with any test cases or ideas for to get AC?
Thanks!

Post your question to the forum about problems from the set I. This forum is about problems with java.

i cant understand the problem.. can any one explain it with i/o ... plssss it will help mee I can give you an example of few first composite primes: 4 , 6 , 9 , 10 , 14 , ... The numbers 1 , 2 , 3 , 5 , 7 , 11 , 13 are not composite, therefore they are not composite primes. The numbers 8 and 12 hav...

little joey wrote:Al three are different, and the last one is not the number of input values per case, but the input value itself.
At least that is how I interpret it, and I got AC with it....

Despite I've interpreted it in the same way finally, imho the problem statement says something different

daveon wrote:For some problems (11078), the title tag is showing the title of another problem.

Well... there are a lot of problems with their title tags showing titles of other problems...

Hisoka wrote:Ouu, ic ... You can doing 2 N + K algo without sorting before ...

Thanks

My algo sorts the numbers at the beginning and runs in about 8.7s.

sclo wrote:I have a question, how many equations do we need to solve?

My solution solves n equations with n unknowns.

It seems there is no input where the output doesn't fit in a 32 bit integer. At least under the assumption that you got accepted with long long. I got accepted with int. Well, I've corrected both bugs at once, so possibly there are be no such inputs in the judge. Anyway, the constraints allow such ...

Hello everyone! I've tried all the input avaliable in this thread and my code seems to work with them, except for that one from mamud, I think, where there are edges that connect vertexes beyond the limit previously given. Anyway, I just keep getting WA. Here is my code, can anyone tell me where is...

To help people who have troubles with this problem, note, that the answer doesn't have to fit to 32bit integer (as the answer may be as big as 10^5*(10^5-1)/2). My other bug was, that at first I didn't realise that -7%4=-3 a not 1.

By the way I would be blessed to get some useful links on Graphs, speciallly bipartite and its properties. Also some links for maximum matching algorithm... ohh the list is already too long.. :lol: please someone forward it if possible :oops: can anyone give some links please :cry: You can google i...

StatujaLeha wrote:

Vexorian wrote:If I am not mistaken, for the case:
1
aaa e e

The output should be 1, right?

my solution outputs 1.

Yes, the correct answer is 1, as the empty string is also a valid subsequence of the string "aaa".

Ashkankhan wrote:is there any idea about this problem?

First, think what is the statement that b is always a square free number good for. Afterwards... find the formula

I programmed maximum matching and was sure it is correct, but can not get my solution AC. Wish i new what is my problem and why there were so many resubmitions during the contest. Consider the following graph: 0 - 1 , 2 - 1 , 1 - 3 , 3 - 4 and 3 - 5 . It's maximum matching is 2 , but you need 3 gua...

vinay wrote:n/2 ??

Actually not, consider the graph K1,7 (complete bipartite graph with one vertex in the first partition and seven vertices in the second partition). It has 8 vertices, and just one gruard is enough.