Search found 374 matches

by Sedefcho
Wed Aug 12, 2009 10:47 pm
Forum: Volume 1 (100-199)
Topic: 123 - Searching Quickly
Replies: 55
Views: 4765

Re: 123 Searching Quickly

Here is a wikipedia article which was changed a little bit in order to match this problem's requirements. INPUT the for on in and is it american canadian great lakes :: The Niagara Falls are voluminous waterfalls on the Niagara River straddling the international border between the Canadian province ...
by Sedefcho
Mon Mar 23, 2009 3:20 pm
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 31843

Re: 10032 - Tug of War

Yes, sure, no problem, I just wanted to clarify which outputs are logically
correct. And yes, the inputs I posted are mostly generated by myself, I have
no idea what the I/O on the judge is. But I think the judge data is pretty
strong, it's hard to get ACC on this problem (in my impression).
by Sedefcho
Sat Mar 21, 2009 6:17 pm
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 31843

Re: 10032 - Tug of War

Yes, now I am quite sure my outputs above are correct. I finally got ACC on this problem and I am quite happy now :) due to the unusual approach I used. Actually I wanted to prove to myself that it is possible to get ACC in this way on this hard problem. 1) I run a genetic (heuristics) algorithm (I ...
by Sedefcho
Sat Mar 21, 2009 1:25 pm
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 31843

Re: 10032 - Tug of War

By the way there's one more test case where our outputs differ. And I also cannot agree with your output there. The test case is below. Here we have 91 numbers/weights, one number/weight is 100, 45 of the numbers are 1s. And the others are visible below. So apparently we cannot make the sum in one o...
by Sedefcho
Sat Mar 21, 2009 11:50 am
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 31843

Re: 10032 - Tug of War

Is this from an ACC program ?! Your output for the 5-th test case is wrong, no? 18 1 1 2 2 2 2 3 3 4 4 5 5 6 6 7 7 54 8 Here we need to form 2 groups of 9 people each. And in one of the groups we cannot have total weight which is less than: 70 = 54 + 1 + 1 + 2 + 2 + 2 + 2 + 3 + 3. So the best we can...
by Sedefcho
Fri Mar 20, 2009 3:12 pm
Forum: Volume 100 (10000-10099)
Topic: 10032 - Tug of War
Replies: 91
Views: 31843

Re: 10032 - Tug of War

Could someone having an Accepted program please verify this I/O below? Thanks a lot in advance. ( Additional Note #1 : the question posed above is now obsolete/outdated). Additional Note #2 : This I/O below is from an Accepted program already so I hope it can be useful as a reference from now on. IN...
by Sedefcho
Tue Mar 03, 2009 7:09 pm
Forum: Volume 4 (400-499)
Topic: 452 - Project Scheduling
Replies: 23
Views: 9770

Re: 452, Why WA

Most of the times RE means you are accessing memory
which your program did not acquire first. For example
you may be trying to access element i=1001 of an array
having len=1000 elements.
by Sedefcho
Mon Mar 02, 2009 11:41 pm
Forum: Volume 4 (400-499)
Topic: 468 - Key to Success
Replies: 33
Views: 4113

Re: 468 - WA!

To abid_iut: I don't know if you already solved this problem.

But here is a small remark: the online judge wants a single \n after
the last test case output and two \n\n after each of the previous test cases.
If not printed this way - the judge says WA, if yes - the judge says ACC.
by Sedefcho
Fri Feb 27, 2009 2:05 pm
Forum: Volume 104 (10400-10499)
Topic: 10401 - Injured Queen Problem
Replies: 19
Views: 9691

Re: 10401 - Injured Queen Problem

I just want to confirm what jurajz mentioned above. The input file seems to indeed contain some blank lines. If you don't take this into account you will most probably get WA. To get ACC just skip them (the blank lines). So in C++ we may do something like that. That would be enough (given the curren...
by Sedefcho
Tue Feb 24, 2009 1:19 am
Forum: Volume 115 (11500-11599)
Topic: 11567 - Moliu Number Generator
Replies: 13
Views: 3971

Re: 11567 - Moliu Number Generator

Does anybody have a proof (or reference to a proof) why this greedy
procedure actually works for this problem (proof of correctness)?
by Sedefcho
Mon Feb 23, 2009 8:19 pm
Forum: Volume 114 (11400-11499)
Topic: 11476 - Factorizing Large Integers
Replies: 17
Views: 8086

Re: 11476 - Factorizing Large Integers

[deleted]
by Sedefcho
Mon Feb 23, 2009 2:45 pm
Forum: Volume 115 (11500-11599)
Topic: 11564 - Just A Few More Triangles!
Replies: 2
Views: 1217

Re: 11564 - Just A Few More Triangles!

Oh, okay, thank you. I am going to check them.

Seems I was rather distracted when writing my
previous note on this problem :). For example
apparently I assumed that a<b and not a<=b
(don't know why).
by Sedefcho
Mon Feb 23, 2009 1:15 am
Forum: Volume 110 (11000-11099)
Topic: 11059 - Maximum Product
Replies: 96
Views: 36870

Re: 11059 - Maximum Product

The problem asks for the maximum positive
product involving consecutive terms
. That's
why the answer is 315 in your example.
by Sedefcho
Sun Feb 22, 2009 11:40 pm
Forum: Volume 115 (11500-11599)
Topic: 11564 - Just A Few More Triangles!
Replies: 2
Views: 1217

11564 - Just A Few More Triangles!

Is there something wrong with this problem? 1) Only 13 submissions were made for it 2) Only 2 out of 8 people solved it 3) Also, I cannot yet find out why the answer for 7 is 16. For this simple case (mod 7) I count like this. residues x -> 1,2,3,4,5,6 respective x^2 (mod 7) -> 1,4,2,2,4,1 So all po...
by Sedefcho
Fri Feb 20, 2009 7:01 pm
Forum: Volume 114 (11400-11499)
Topic: 11476 - Factorizing Large Integers
Replies: 17
Views: 8086

Re: 11476 - Factorizing Large Integers

Without any caching (of primes or of divisors already found) I was able to get ACC in 4.750 secs. With some caching my best ACC was in 1.200 secs. So if Robert Gerbitz is not doing any caching (between the different test cases) then for sure his solution is quite better. This problem was a real mons...

Go to advanced search