Search found 192 matches

by Red Scorpion
Sat Apr 26, 2003 9:15 am
Forum: Volume 4 (400-499)
Topic: 498 - Polly the Polynomial
Replies: 73
Views: 13350

Hi!

Please post your code, again, I'll try to check what's wrong with your code!
by Red Scorpion
Sat Apr 26, 2003 3:56 am
Forum: Volume 104 (10400-10499)
Topic: 10466 - How Far?
Replies: 25
Views: 8302

Hi, I always got WA.
Is my algo correct ?

Code: Select all

cut.. 
Can someone said my algo correct / wrong ?

Thanks.
by Red Scorpion
Fri Apr 25, 2003 7:09 am
Forum: Volume 4 (400-499)
Topic: 498 - Polly the Polynomial
Replies: 73
Views: 13350

Hi!

I have solved this problem using integer, not double.

Your output is wrong:
input:
10002 1001 102
3 0 1 0 -1

Output:
93123 102 11105 102 9103

Good Luck!
by Red Scorpion
Thu Apr 24, 2003 5:47 am
Forum: Volume 2 (200-299)
Topic: 280 - Vertex
Replies: 95
Views: 21556

P-280-Can anyone helped me ?

Can anyone tell me what output for this test case:

input:
100
1 2 3 4 5 6 7 8 9 10 11 100 14 44 25 28 0
2 1 4 6 8 9 10 44 25 0
3 2 1 4 6 8 9 33 11 100 0
4 2 1 0
0
10 1 2 3 4 5 6 7 8 9 10
10
1 10 0
0
2 1 2
0

Thanks. :lol: :lol:
by Red Scorpion
Tue Apr 22, 2003 10:02 am
Forum: Volume 2 (200-299)
Topic: 268 - Double Trouble
Replies: 4
Views: 1595

I don't really grasp your code. But my main idea to solve this Problem is like this: 1. scan the base number. 2. try to generate all the last digit of double trouble number from 1 to base-1, and output the smallest double trouble number. 3. to find the double trouble number start from last digit(we ...
by Red Scorpion
Tue Apr 15, 2003 7:28 am
Forum: Volume 104 (10400-10499)
Topic: 10450 - World Cup Noise
Replies: 42
Views: 19762

Thanks, Turuthok.
Got AC now. :lol: :lol:
by Red Scorpion
Tue Apr 15, 2003 6:29 am
Forum: Volume 104 (10400-10499)
Topic: 10474 - Where is the Marble?
Replies: 50
Views: 19099

Hehehe..
Thanks, Kmhasan.
I Got AC in less than 1 S. :-? :-?
by Red Scorpion
Mon Apr 14, 2003 12:06 pm
Forum: Volume 104 (10400-10499)
Topic: 10474 - Where is the Marble?
Replies: 50
Views: 19099

10474 - Where is the Marble?

:cry: :cry: :cry:

I got AC for this problem in 2.107 S. I saw the others got AC in less than 1 second. Could someone tell me how to make this problem faster ?

First I sort the marbles using quicksort, and search that with binary search.
by Red Scorpion
Mon Apr 14, 2003 11:57 am
Forum: Volume 100 (10000-10099)
Topic: 10090 - Marbles
Replies: 43
Views: 22124

Still no reply ...
Can anyone help me ....
by Red Scorpion
Mon Apr 14, 2003 11:39 am
Forum: Volume 101 (10100-10199)
Topic: 10131 - Is Bigger Smarter?
Replies: 93
Views: 64152

Whats your output for your sample input?

My output for your second input is:
6
6
3
5
4
1
2
:lol:
by Red Scorpion
Mon Apr 14, 2003 11:24 am
Forum: Volume 104 (10400-10499)
Topic: 10450 - World Cup Noise
Replies: 42
Views: 19762

10450

Hi,
I always got WA.

Is my output right?

Input:
9
0
2
10
9
13
50
51
47
49

Output:
0
3
81
60
175
10151
10777
8420
9550

Thanks.
by Red Scorpion
Thu Apr 10, 2003 4:35 am
Forum: Volume 3 (300-399)
Topic: 320 - Border
Replies: 24
Views: 2256

Hi,
No Trick at all. Just do what they want.
by Red Scorpion
Wed Apr 09, 2003 11:13 am
Forum: Volume 104 (10400-10499)
Topic: 10459 - The Tree Root
Replies: 30
Views: 10068

Finally I've found my bug, :D
And got AC.
Thanks everyone for helping me out.
RS :lol: :lol:
by Red Scorpion
Tue Apr 01, 2003 9:29 am
Forum: Volume 104 (10400-10499)
Topic: 10459 - The Tree Root
Replies: 30
Views: 10068

Hi! I have changed my algorithms to this: 1. Find the best roots used the above methods (1/2 best roots). 2. Find The worst roots : -> find the longest path from all of the best roots. Example : 1 / \ 2 3 / \ / \ 4 5 6 7 / \ 8 9 Best Roots : 1,2 Worst roots from node 1 : 8, 9 2 / | \ 4 5 1 / \ | 8 9...
by Red Scorpion
Mon Mar 31, 2003 5:50 am
Forum: Volume 100 (10000-10099)
Topic: 10090 - Marbles
Replies: 43
Views: 22124

10090 - Marbles

Haiii.. :cry: :cry: I've stuck in this problem. Input (n, n1, n2); n = x*n1 + y*n2; aim :to find the minimum(x,y) -> minimum cost. But how can we find the minimum x and y? n = x*n1 + y*n2; n = (x+a) * n1 + (y+b) * n2, with : a*n1 + b*n2 = 0. Example : n = 43, n1 = 3, n2 = 4; c1 = 1, c2 = 2. (sample ...

Go to advanced search