## Search found 32 matches

Tue Feb 15, 2005 3:30 am
Forum: Volume 108 (10800-10899)
Topic: 10819 - Trouble of 13-Dots
Replies: 67
Views: 37522
You are right!
I don't know why I didn't remember that :-|

Anyway, my submission still received WA
So, I must have other problems...
Can you give more input, please ?

Regards,

Jose Santos
Tue Feb 15, 2005 1:06 am
Forum: Volume 108 (10800-10899)
Topic: 10819 - Trouble of 13-Dots
Replies: 67
Views: 37522

Hi,

Could you please post more sample input with output ?
I had a WA and my solutions give correct output for some examples I created.
With the question of the bonus..
Is there any problem doing this

if(m>2000)
m+=BONUS;

(It's > and not >=, right?)

Regards,

Jose Santos
Mon Dec 13, 2004 12:23 am
Forum: Volume 107 (10700-10799)
Topic: 10791 - Minimum Sum LCM
Replies: 46
Views: 22543
A multiset is a set where elements can be repeated ?
If so the algorithm to solve would be different. (would be trivial, that way)

The problem makes sense as it is. (with a set...but without 1 as a valid input I think
Sun Dec 12, 2004 11:23 pm
Forum: Volume 107 (10700-10799)
Topic: 10791 - Minimum Sum LCM
Replies: 46
Views: 22543
Precisely because {1,1} is no set I can not see the logic of 2 being the answer. The problem description requires the numbers to sum to be different. What arguments do you have for 2 being a better answer than 0 ? 0 seems the best answer since there's no solution. (no set, so the sum is 0) Anyway, I...
Sun Dec 12, 2004 9:52 pm
Forum: Volume 107 (10700-10799)
Topic: 10791 - Minimum Sum LCM
Replies: 46
Views: 22543

### Output when N=1

I got lots of wrong answers in this problem when n=1. (I was answering 0 and in a later submission 1) I think n=1 shouldn't be a valid input. (altough in description it's stated as that). When n=1 there aren't 2 integers which lcm gives 1. I just saw in this board that when n=1, output should be 2. ...
Tue Jun 29, 2004 3:12 am
Forum: Volume 106 (10600-10699)
Topic: 10679 - I Love Strings!!
Replies: 101
Views: 49279

### 10679 - I Love Strings!!

I was trying to solve this problem with the naive solution (using strstr). It gives TLE. I've created a huge test file and the naive solution solves that huge test file very fast. So... has the judge a lot of test files ? I've few motivation to implement a better algorithm when I can't see the naive...
Tue May 04, 2004 10:19 pm
Forum: Volume 106 (10600-10699)
Topic: 10650 - Determinate Prime
Replies: 67
Views: 25157

### 10650 - Determinate Prime

Hi, I was solving this problem and I don't understand the sample output for the sample input. When input is: "1 100" the sample output is: 3 5 7 47 53 59 My program gives: 3 5 7 31 37 43 47 53 59 61 67 73 79 and I don't see how it may be wrong. Can somebody explain me why 31 37 43 61 67 73 79 aren't...
Sun Aug 10, 2003 2:45 am
Forum: Volume 8 (800-899)
Topic: 835 - Square of Primes
Replies: 22
Views: 11738

### Output example

Sample output for such input
11351
14033
30323
53201
13313

11351
33203
30323
14033
33311

13313
13043
32303
50231
13331

11351
14033
30323
53201
13313

11351
33203
30323
14033
33311

13313
13043
32303
50231
13331
Tue Feb 04, 2003 2:22 am
Forum: Volume 8 (800-899)
Topic: 853 - DVD Subtitles
Replies: 6
Views: 3605

### 853 - DVD Subtitles

Hi, I just want to warn people who may be doing this problem that the input file does NOT have blank lines after each sentence as it may look from the html. That was a presentation problem. Hope this helps people avoiding wrong answers. Regards, Jose Santos
Tue Feb 04, 2003 2:07 am
Forum: Volume 8 (800-899)
Topic: 830 - Shark
Replies: 7
Views: 6132

### Bug in shark last test case input

Hi, There's a reason for so much errors while submiting Shark. There's a bug in the last test case input. The first line of each test tell us the number of lines and number of columns, unfortunately for last test case the input says there are 38 columns but in fact there are 39, that's why who's rea...
Wed Sep 04, 2002 2:17 pm
Forum: Volume 103 (10300-10399)
Topic: 10349 - Antenna Placement
Replies: 16
Views: 7649
Yes, it can.It gives 3 that's the optimal solution. (What i do is to try to see if it's first on next row and then if it's on next column, I said the opposite in the first post) However, if I changed the ordered of placement the solution would be 4. I can now think what's wrong, the problem is harde...
Wed Sep 04, 2002 1:38 pm
Forum: Volume 103 (10300-10399)
Topic: 10349 - Antenna Placement
Replies: 16
Views: 7649

### 10349 - Antenna Placement

Hi, I was trying to solve this problem but it seems by algorithm has some flaw. My idea was to go thru the map from left to right and top to bottom (as usually) when we find and '*', increment antennaCount, signal this place (i, j) as covered.If there's another antenna at right signal it as covered ...
Sun Jul 28, 2002 11:21 am
Forum: Other words
Topic: New: Submit-o-matic
Replies: 23
Views: 6019

### Comment field

Hi, I think comment field is very useful, altough some people indeed use it improperly.Reading the comment field can give us a quick hint of something. (Like some special cases, it has helped me some times). You may argue the forum is here to help about that but many problems don't yet have a thread...
Sat Jul 27, 2002 2:00 am
Forum: Pascal
Topic: Unsigned 32 bit integer in Pascal
Replies: 1
Views: 2455

### Unsigned 32 bit integer in Pascal

Hi, Does anyone know how to use a unsigned 32 bit integer in Pascal (in GPC). Just like Cardinal in Delphi Object Pascal. That's useful for some problems which are in the range 0..2^32 -1 (thinking on C programmers I guess) and not in the signed integer range. Regards, Jose Santos
Sun Jul 07, 2002 1:32 pm
Forum: C
Topic: Compiler flags within source code
Replies: 11
Views: 4332
At home I can use the command line options, of course.(And I can even set them in the source if if compile the source with Delphi or C++ Builder). Does the register keyword do such miracles ? Also for input/output, what's the fastest ? puts and scanf ? You did an amazing time in 10282! Why was your ...