OJ Board

arc16

.. 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

arc16

hi guys,
i'm in the middle of testing my solution. could you tell me what is the output for the following input?

thank you

arc16

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

arc16

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

arc16

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...

arc16

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...

arc16

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

arc16

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++)

arc16

hi adrian,
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

arc16

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?

arc16

so we only have to care about the _last_ 3 dots, is it right?

arc16

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

arc16

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

arc16

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...

arc16

Please help...
I'm getting TLE by using DFS.

Is there any faster method?

OJ Board

Search found 62 matches

10361 - Automatic Poetry

Re: 373 Romulan Spelling