Search found 12 matches

by Lord Nemrod
Mon May 02, 2005 10:20 am
Forum: Volume 3 (300-399)
Topic: 383 - Shipping Routes
Replies: 27
Views: 5869

Thanks a lot~!
by Lord Nemrod
Sun May 01, 2005 8:06 pm
Forum: Volume 3 (300-399)
Topic: 383 - Shipping Routes
Replies: 27
Views: 5869

thanks!!!

Thanks very much. I got AC. I had a very small mistake(result of poor attention), so my code is almost AC and I'd like to remove it as I have seen many have done. How can I do it? Thanks again
by Lord Nemrod
Fri Apr 29, 2005 12:02 pm
Forum: Volume 3 (300-399)
Topic: 383 - Shipping Routes
Replies: 27
Views: 5869

383 - I BEG(!) you to hepl me!!!!!!

Hi. I have solved a couple of problems just like this one with BFS, but this one gives me WA. The only thing I ask for is to get a single test case this prog fails on!
Here's the code...



Got AC - no code sorry...
by Lord Nemrod
Wed Apr 20, 2005 8:53 am
Forum: Volume 6 (600-699)
Topic: 640 - Self Numbers
Replies: 47
Views: 18141

Well, in fact I DO need details:) if you would be so kind to provide any...
Thx
by Lord Nemrod
Sun Apr 17, 2005 9:24 am
Forum: Volume 100 (10000-10099)
Topic: 10017 - The Never Ending Towers of Hanoi
Replies: 19
Views: 5449

10017 - Isn't the output wrong?

Hi!
I think that the sample output for problem#1 is wrong. It seems that on the first move it just removes a disk from A and doesn't put it anywhere. Am I right?
by Lord Nemrod
Wed Apr 06, 2005 1:41 pm
Forum: Volume 3 (300-399)
Topic: 378 - Intersecting Lines
Replies: 48
Views: 15300

Try considering lines that are vertical i.e x=a. You can't make this line as y = kx+b
by Lord Nemrod
Wed Apr 06, 2005 1:34 pm
Forum: Volume 3 (300-399)
Topic: 369 - Combinations
Replies: 101
Views: 17316

Guys,
Try to use the following formula and unsignel long will be enough.
C(N, M) = C(N-1, M-1)+C(N-1, M). Take a matrix and systematiccaly calculate all values of C for all M and N. Then for every input output MATRIX(N, M). No need to use Factorial at all. Hope this helps
by Lord Nemrod
Wed Apr 06, 2005 1:28 pm
Forum: Volume 3 (300-399)
Topic: 369 - Combinations
Replies: 101
Views: 17316

I haven't read your code, but there is a formula that can help. Precalculate everything first using the formula
C(N, M) = C(N-1, M-1)+C(N-1, M). Use DP. Hope this helps
by Lord Nemrod
Wed Apr 06, 2005 1:27 pm
Forum: Volume 3 (300-399)
Topic: 369 - Combinations
Replies: 101
Views: 17316

I haven't read your code, but there is a formula that can help. Precalculate everything first using the formula
C(N, M) = C(N-1, M-1)+C(N-1, M). Use DP. Hope this helps
by Lord Nemrod
Tue Mar 29, 2005 9:47 pm
Forum: Volume 6 (600-699)
Topic: 640 - Self Numbers
Replies: 47
Views: 18141

Dear Cyfra.
I have actually solved the problem the way you are advising to do, and it does generate all self numbers, but it takes around 5 minutes to do it? Any better suggesstions? :-?
by Lord Nemrod
Mon Mar 28, 2005 8:10 pm
Forum: Volume 1 (100-199)
Topic: 190 - Circle Through Three Points
Replies: 126
Views: 19938

Too hard

I think you've done it too complicatedly. Try to solve the eqations for thee points - you will need only basic mathemathic operations +-* and/. That'd be more precise.
by Lord Nemrod
Mon Mar 28, 2005 8:02 pm
Forum: Volume 5 (500-599)
Topic: 579 - Clock Hands
Replies: 44
Views: 14020

579 - WHAT"S WRONG???!!!!

I've been trying to sord out what's wrong with this problem for two weeks, but in vain - WA:( . Can you please help me? Here's the code: #include "iostream.h" #include "stdio.h" #include "iomanip.h" double GetAngle(int Hour, int Min); int main(int argc, char* argv[]) { int i=0; int Hour = 0; int Min...

Go to advanced search