Search found 80 matches

by Quantris
Tue Jan 24, 2006 2:55 am
Forum: Volume 109 (10900-10999)
Topic: 10982 - Troublemakers
Replies: 17
Views: 6379

Yes, plus it is easy to see why: Every "troublesome" pair will be considered exactly once (namely, when you have placed one of the members and are deciding where to put the other). At every decision, you "enable" at most half of the pairs that you are considering. Therefore, at the end, you will hav...
by Quantris
Wed Nov 02, 2005 4:14 am
Forum: C++
Topic: Plz help me to "BigIntegers"
Replies: 7
Views: 2939

I'm aware that you don't know me, but I can assure you that I never have "frauded" with my homework.

I realise that he wrote "help" but it certainly seemed to me that he was wanting more than that. Of course my mistrust is possibly erroneous, in which case I apologise.
by Quantris
Wed Nov 02, 2005 1:28 am
Forum: C++
Topic: Plz help me to "BigIntegers"
Replies: 7
Views: 2939

If I understand your post correctly (Abar_Sabel), then I've got no sympathy...just because you feel you can't handle all your homework doesn't at all justify asking others to do it. BTW, it would be totally different (at least, in my opinion) if you had tried to do your assignment, gotten stuck on s...
by Quantris
Tue Nov 01, 2005 6:03 am
Forum: C++
Topic: Plz help me to "BigIntegers"
Replies: 7
Views: 2939

Looks a lot like homework to me...
by Quantris
Sun Oct 23, 2005 2:05 am
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13460

how else does one think of a DP problem? :)
by Quantris
Sat Oct 22, 2005 6:30 am
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13460

yes, kind of

try to work out the recursion, then dp-ize it (this one is pretty straightforward in that regard)

one important thing is that sums such as 0+0+1 and 0+1+0 are counted separately (as in the sample, where 0+20 and 20+0 are both counted).
by Quantris
Sat Oct 22, 2005 5:36 am
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13460

never mind, I got AC, I think there are either 0 x or x 0 in the data.
by Quantris
Sat Oct 22, 2005 4:54 am
Forum: Volume 109 (10900-10999)
Topic: 10943 - How do you add?
Replies: 38
Views: 13460

10943 - How do you add?

I'm getting WA on this, but I fail to see why. Rather than ask for a hint, could someone with an AC just say if there was anything special you had to assume about the input that wasn't in the problem statement? As well, what is your output for 100 100? (By special, I mean did you handle cases like 0...
by Quantris
Mon Oct 10, 2005 8:38 pm
Forum: Algorithms
Topic: Min-Max Search
Replies: 7
Views: 1698

just do the "parity" technique at each step.

Maybe that is DP after all.
by Quantris
Sun Oct 09, 2005 11:55 pm
Forum: Algorithms
Topic: Min-Max Search
Replies: 7
Views: 1698

It's actually way way simpler than DP

think about parity.
by Quantris
Fri Sep 30, 2005 5:06 am
Forum: Other words
Topic: Which problem is the easiest problem of this site?
Replies: 27
Views: 24168

This is true indeed. Actually Sahriar Manzoor, wanted people to derive the formula, requires half page of analysis, but most newcomers spot the pattern from sample input/output, or knows from their friends that the problem has a simple formula. There are several other problems, which can be coded i...
by Quantris
Sat Sep 24, 2005 3:59 am
Forum: Volume 109 (10900-10999)
Topic: 10902 - Pick-up Sticks
Replies: 24
Views: 13543

Read it more carefully, the worst case is actually (n+k)log n (page 8 ) - there is also a reference to an algorithm that is k + n log n. These are both *worse* in the worst case than n^2 (k is already in n^2), furthermore for this problem it seems that the algorithm needs to be chosen according to t...
by Quantris
Mon Sep 19, 2005 1:45 am
Forum: Volume 108 (10800-10899)
Topic: 10840 - Multi-stage Compressor
Replies: 4
Views: 6664

10840 - Multi-stage Compressor

Just wondering if anyone has a hint about this one (I realise only two people have it AC anyway).

It seems like a pretty simple problem if I'm reading it right.

Perhaps something is off with the judge's data?
by Quantris
Sun Sep 18, 2005 10:05 pm
Forum: Algorithms
Topic: Problem A from Waterloo ACM Sept 17/2005
Replies: 2
Views: 1041

Just to add on to what gvcormac said, if you read the statement carefully you will see that the player knows the probability p of answering a question correctly after seeing the question - therefore his optimal strategy can use the specific value of p (comparing to the threshold for positive expecta...
by Quantris
Mon May 16, 2005 3:05 am
Forum: Volume 1 (100-199)
Topic: 187 - Transaction Processing
Replies: 18
Views: 4795

From the problem statement: Each of these records is one entry of a transaction. A transaction consists of between two and ten entries with identical sequence numbers. Each transaction will be contiguous within the input data. I don't think that it is "badly worded" at all - it might be a bit confus...

Go to advanced search