Search found 163 matches

by Emilio
Mon Oct 16, 2006 3:55 pm
Forum: Off topic (General chit-chat)
Topic: Let's try to keep this forum useful for everyone!
Replies: 13
Views: 22124

I agree with Shahriar. I think the best choice is create automatically the threads, and keep some "free" forums.
by Emilio
Fri Oct 13, 2006 12:56 pm
Forum: Volume 111 (11100-11199)
Topic: 11115 - Uncle Jack
Replies: 25
Views: 15378

Only 13 values overflow, so, you can get this 13 values with a calculator and solve the problem. Well, I haven't in account power of 10 because can be got easily.
by Emilio
Wed Oct 11, 2006 11:56 pm
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 31409

No, you will have n elements O((n)log(n)).
Exactly n-m+1 elements.
Each element can be of m as lenght, or you can solve it with only an array of chars and another array of char pointers.
by Emilio
Mon Oct 09, 2006 2:08 pm
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 31409

It can be solved with a simple qsort.
by Emilio
Mon Sep 25, 2006 10:16 pm
Forum: Volume 111 (11100-11199)
Topic: 11100 - The Trip, 2007
Replies: 18
Views: 13509

I solved using a simple straightforward algorithm. You don't need any special algorithm. Yeah, there are lot of correct outputs. There are no tricks. About your question about the problem statement, you must find wich is the smallest number of outermost bags. But the bag that have more bags inside i...
by Emilio
Mon Jun 12, 2006 6:30 pm
Forum: Volume 110 (11000-11099)
Topic: 11046 - Numbers and operations
Replies: 8
Views: 2729

Hi gines,

you was right. I have got AC with a small change in my code.

Thanks to all for all :)
by Emilio
Sun Jun 11, 2006 11:04 am
Forum: Volume 110 (11000-11099)
Topic: 11046 - Numbers and operations
Replies: 8
Views: 2729

Really my question was stupid!
But I don't know where my code fails. Could anyone take a look?

Code: Select all

Code removed after AC
Thanks in advance!
by Emilio
Sat Jun 10, 2006 8:36 pm
Forum: Volume 110 (11000-11099)
Topic: 11046 - Numbers and operations
Replies: 8
Views: 2729

Thanks firstly! Ah! OK! I put in preference the operators before the operands because they are with a greater priority. Then the first solution of minimum number of operations can be the solution if you do the things in a good manner. But another question, how do you handle cases where multiply oper...
by Emilio
Sat Jun 10, 2006 7:52 pm
Forum: Volume 110 (11000-11099)
Topic: 11046 - Numbers and operations
Replies: 8
Views: 2729

11046 - Numbers and operations

Hi,

one question. Is it not better this solution for the third case of the input/output examples?

25 x 11 = 275
275 + 13 = 288
288 - 17 = 271
271 x 7 = 1897 <-
by Emilio
Sat Jun 10, 2006 7:19 pm
Forum: Volume 8 (800-899)
Topic: 858 - Berry Picking
Replies: 10
Views: 6436

You submitted your last post while I was writting the mine one :). The fact about you are talking can be due that the polygon is not closed, but this issue haven't sense for this problem. Other reasons is not logic to me. As I commented any test cases where I must check this issue don't come to my m...
by Emilio
Sat Jun 10, 2006 7:13 pm
Forum: Volume 8 (800-899)
Topic: 858 - Berry Picking
Replies: 10
Views: 6436

I can't understand how you can get this without sort the intersection points. Really I don't know what is wrong in my code, because the functions to handle the segments works fine in other problems, and I can't figure out any test case where my code fails, altought maybe can be any overflow if the c...
by Emilio
Sat Jun 10, 2006 5:15 pm
Forum: Volume 8 (800-899)
Topic: 858 - Berry Picking
Replies: 10
Views: 6436

Hi daveon,

I think that the lines are always inside the polygon. I can't figure out any case where the vertical lines that I'm adding are outside. Could you put any test case where the vertical lines are outside?

Thanks in advance!
by Emilio
Sat Jun 10, 2006 1:32 am
Forum: Volume 8 (800-899)
Topic: 858 - Berry Picking
Replies: 10
Views: 6436

Hi,

Yeah! I consider that case. Thanks anyway daveon!
I don
by Emilio
Mon Jun 05, 2006 6:09 pm
Forum: Volume 110 (11000-11099)
Topic: 11043 - Fast and Easy Data Compressor
Replies: 5
Views: 2087

The reason is that chars value can be from 0 to 255, if you have a signed char when the value is greater than 127 the last bit will be a 1, and this will be seen as a negative value because this bit is the bit for the sign, thus, with an unsigned char this value is seen as a positive value.
by Emilio
Sun Jun 04, 2006 5:36 pm
Forum: Volume 110 (11000-11099)
Topic: 11043 - Fast and Easy Data Compressor
Replies: 5
Views: 2087

Your runtime error can be due to the fact that you are using char instead of unsigned char.
Btw, Carriage return is '\n' like.

Go to advanced search