Search found 62 matches

Tue Sep 24, 2002 4:45 pm
Forum: Volume 103 (10300-10399)
Topic: 10363 - Tic Tac Toe
Replies: 54
Views: 24462
.. wrote: If anyone win at 2 different rows(columns) same time
i think we should not worry about that, at least my solution doesn't
Tue Sep 24, 2002 2:23 am
Forum: Volume 102 (10200-10299)
Topic: 10278 - Fire Station
Replies: 59
Views: 20961
hi guys,
i'm in the middle of testing my solution. could you tell me what is the output for the following input?

Code: Select all

``````2

3 6
2
5
4
1 2 20
2 3 10
3 4 15
4 5 20
5 6 10
6 1 10

4 6
2
3
4
5
1 2 20
2 3 10
3 4 15
4 5 20
5 6 10
6 1 10
``````
thank you
Tue Sep 24, 2002 1:41 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 184482
the only mistake i can find is for n = 55. Your output is 113 and the correct output is 114. Since f(2n) = f(n)+1, it will affects the result of 110,220,440,etc as well. you should try to debug your program using those input and find your mistake.
good luck
Mon Sep 23, 2002 3:01 am
Forum: Volume 1 (100-199)
Topic: 100 - The 3n + 1 problem
Replies: 1394
Views: 184482

Code: Select all

``````The integers i and j must appear in the output in the same order in which they appeared in the input and should be followed by the maximum cycle length (on the same line).
``````
if input: 10 1, then output should 10 1 20
Sat Sep 21, 2002 5:33 am
Forum: Volume 100 (10000-10099)
Topic: 10058 - Jimmi's Riddles
Replies: 22
Views: 6417
hi, yes, there might be LOT OF whitespace, including before eol. so there would be something like: ___tom__hatess___jerry___,_____mickey loves goofy______ '_' is whitespace In the WON'T, it's ascii #39. you could also try this: mickey lovess goofy and jerry , tom loves goofy and mickey and jerry,the...
Sat Sep 21, 2002 5:06 am
Forum: Volume 103 (10300-10399)
Topic: 10342 - Always Late
Replies: 25
Views: 11027
i'm using floydd to calculate the shortest path. On each node, if there exist a shorter path, i put the previous shortest path into another matrix. Therefore, the 2nd matrix always hold the 2nd shortest path. However, i can't get it AC :cry: Is my algorithm correct? are there any case that will fail...
Fri Sep 20, 2002 9:11 pm
Forum: Other words
Topic: compile error
Replies: 10
Views: 3479
this happened when using iostream, don't know why though...
change:

Code: Select all

``````#include <iostream.h>
``````
into:

Code: Select all

``````#include <iostream>
``````
and submit as C++
and like picard said.. you got wrong answer
Thu Sep 19, 2002 1:25 am
Forum: Volume 102 (10200-10299)
Topic: 10290 - {Sum+=i++} to Reach N
Replies: 27
Views: 12708
so now i only have to find how to handle those e14 input in pascal...
i have tried int64, cardinal, qword, etc (from FPC), but i keep geting compile error. Anyone know the reason ? (before i switch to c++)
Wed Sep 18, 2002 7:01 pm
Forum: Volume 102 (10200-10299)
Topic: 10290 - {Sum+=i++} to Reach N
Replies: 27
Views: 12708
if i understand correctly from the url you mentioned, the answer is just the number of odd factor of the input. Is it right?
what if input is 0? is the output 1?
thank you
Wed Sep 18, 2002 6:06 pm
Forum: Volume 103 (10300-10399)
Topic: 10353 - Circles in Hexagon :-)
Replies: 12
Views: 4846
for the 1st output i multiply the input with 3.00 and the 2nd with 3.71. I think it's right, isn't it? If so, why do i get WA?
Wed Sep 18, 2002 12:27 pm
Forum: Volume 103 (10300-10399)
Topic: 10361 - Automatic Poetry
Replies: 25
Views: 12509
so we only have to care about the _last_ 3 dots, is it right?
Wed Sep 18, 2002 4:03 am
Forum: Volume 100 (10000-10099)
Topic: 10006 - Carmichael Numbers
Replies: 66
Views: 20706
yes, it's correct. about WA, i'm not really sure, but _i think_ there may be more than one number in a single line, lot of leading blanks, and so on. Maybe you could try that. 20934 234 21 19238 1203 123 21903 6601 10585 313 41 5 52633 0
Wed Sep 18, 2002 3:58 am
Forum: Volume 103 (10300-10399)
Topic: 10361 - Automatic Poetry
Replies: 25
Views: 12509

10361 - Automatic Poetry

It seems easy.. but i can't get it AC. What's the trick?
In the test case, will there be something like:

Code: Select all

``````asdma ... asdaskdj<...>...<...>...
qwe.......qweqe ...
``````
if so, what is the output?

thank you
Mon Sep 16, 2002 12:34 am
Forum: Volume 3 (300-399)
Topic: 373 - Romulan Spelling
Replies: 10
Views: 3256

Re: 373 Romulan Spelling

For each line: (ignoring case) 1. Replace every occurence of "pg" with "gp" 2. Replace every occurence of "egp" with "epg" 3. Replace every occurence of "gpuk" with "pguk" But I realize this will not work too well if the strange rule is supposed to be applied recursively as well. Could someone tell...
Sat Sep 14, 2002 6:13 am
Forum: Volume 1 (100-199)
Topic: 116 - Unidirectional TSP
Replies: 226
Views: 36487