Search found 33 matches

by ditrix
Wed Oct 01, 2003 1:05 am
Forum: Volume 105 (10500-10599)
Topic: 10555 - Dead Fraction
Replies: 35
Views: 15616

can anybody post a correct output for this input ? 0.8... 0.508466572... 0.74998... 0.2112327... 0.70... 0.15021608... 0.4811... 0.023... 0.4189... 0.6338... 0.469161... 0.53317... 0.2095... 0.25... 0.867725163... 0.218500053... 0.6308... 0.958... 0.0... 0.1748121... 0.5097959... 0.7... 0.6129... 0....
by ditrix
Wed Mar 26, 2003 1:58 am
Forum: Volume 103 (10300-10399)
Topic: 10359 - Tiling
Replies: 12
Views: 5611

10359 - Tiling

Can anyone tell me why the right answer for input "0" is "1" and not "0"?
Does it mean, that exists exactly one way to tile nothing by anything?
And if the answer is positf, what is this way?
by ditrix
Tue Mar 25, 2003 1:44 pm
Forum: Volume 104 (10400-10499)
Topic: 10459 - The Tree Root
Replies: 30
Views: 10073

Code: Select all

                     1
                    / \
                  2     3
                 / \   / \
                4   5 6   7
               / \
             8    9
For this exemple the right answer is:
best: 1 2
worst: 6 7 8 9

And your algo should add 5 as worst root.
by ditrix
Tue Mar 25, 2003 1:35 am
Forum: Volume 104 (10400-10499)
Topic: 10459 - The Tree Root
Replies: 30
Views: 10073

I have the same problem. I didn't understand your code clearly, so I explain my algo: 1. Do DFS from vertex 0 and add to the list of worst roots each vertex maximizing a distance from 0 2. With each vertex N from the list of worst roots do DFS from it and add to the list of worst roots each vertex m...
by ditrix
Fri Mar 21, 2003 2:27 am
Forum: Volume 104 (10400-10499)
Topic: 10422 - Knights in FEN
Replies: 49
Views: 17503

10422 - Knights in FEN

What is the best algorithm for this problem? I tried a backtracking and it ran for 2 seconds, but there are more rapid solutions, say instant...
by ditrix
Tue Mar 18, 2003 2:02 am
Forum: Volume 1 (100-199)
Topic: 101 - The Blocks Problem
Replies: 635
Views: 37230

A lot of my programs in C++, that received a Runtime Error "Invalid memory reference" were accepted after I have rewrited them without an operator "delete". (nothing other changed).

Can anybody tell me what is the problem?
by ditrix
Mon Mar 17, 2003 3:01 am
Forum: Volume 104 (10400-10499)
Topic: 10462 - Is There A Second Way Left?
Replies: 29
Views: 14461

Yes, this case is ok, and all that concern the multiple connections seems to be all right.
I tested my program with many possible cases (v=1 or e=0 included), but I havn't fixed an error.

Am I right to suppose that if v=1 and for all e the answer is "No second way"?
by ditrix
Sun Mar 16, 2003 4:44 pm
Forum: Volume 104 (10400-10499)
Topic: 10462 - Is There A Second Way Left?
Replies: 29
Views: 14461

10462 - Is There A Second Way Left?

I don't know where I have a mistake... :( I use the next algorithm: 0. Make a graph with the vertex - neighbors and the edges - direct conections. 1. Launch DFS and calculate the number of visited vertex. If this number is different from number total of vertex: print "No way", return 2. If number of...
by ditrix
Sun Mar 16, 2003 3:57 pm
Forum: Volume 104 (10400-10499)
Topic: 10472 - Fastest Vs Cheapest
Replies: 17
Views: 7813

All costs are itegers in this problem. It means, that, for ex., if you get a bus for 1km you must pay a minimum fare of 2Tk.
On the contrary the travel time can be fractional.
by ditrix
Sun Mar 16, 2003 12:34 pm
Forum: Volume 104 (10400-10499)
Topic: 10456 - Intelligent Cats
Replies: 4
Views: 2016

are there a tricky cases for this problem? It seems that my program gives the right answer for all tests that i have made, but I am not still accepted. :(
And are the coordinates of the fixed points presented as integers in the input?
by ditrix
Thu Mar 13, 2003 4:22 pm
Forum: Volume 104 (10400-10499)
Topic: 10481 - The Gift Wrappers of Hollywood
Replies: 14
Views: 4004

Snicky trick! It was a good lesson for me, cause I always forget to read the text. But this time I have read the problem statement specialy for find the trick, but it was made for nobody understand it! Snicky...
by ditrix
Thu Mar 13, 2003 11:03 am
Forum: Volume 104 (10400-10499)
Topic: 10467 - Parse Tree
Replies: 4
Views: 1964

Thank you. now it's more clear for me.
by ditrix
Wed Mar 12, 2003 5:52 pm
Forum: Volume 104 (10400-10499)
Topic: 10467 - Parse Tree
Replies: 4
Views: 1964

so, the right way is to print the '='s over the all subtree of "F->(E)", isn't it? And in worst case when F->(E) is the root of the tree, '='s will fill the width of picture?

And why in your exemple the root is "E->T" and not "F->(E)"? Is it the rule, that the root must be "E->"?
by ditrix
Wed Mar 12, 2003 5:41 pm
Forum: Volume 104 (10400-10499)
Topic: 10481 - The Gift Wrappers of Hollywood
Replies: 14
Views: 4004

10481 - The Gift Wrappers of Hollywood

Hi!
I haven't got AC, so wether you have or not I would like to see your factors.
My computations gives such values:

Code: Select all

0.9805979290912715916
1.4845015099848237750
by ditrix
Tue Mar 11, 2003 4:26 am
Forum: Volume 104 (10400-10499)
Topic: 10467 - Parse Tree
Replies: 4
Views: 1964

10467 - Parse Tree

What about the case F->(E)?
What means "A string of

Go to advanced search