OJ Board

Hi,

Anyone have test cases of this problem?
What is the output when the line starts with blanks and have a word of size 73?

Bye,
Sebastiao.

Hi,

I have a TLE too, and solve it deleting of my word's list repeated words.
Be careful with blank lines too...

Best regards,

Sebasti

i forget to say too that in the commands L, H and K, x1 may be greater than x2 and y1 greater than y2.

bye

Hi,

There is an error in your output. When you create an empty table or clear the current table, you must fill it with 'O' (capital letter O), not 0 (digit 0).
Furthermore, the other topic about this problem report WA's when they used a recursive function to fill the table with a color...

Best ...

The problem with the input of this problem is in the end of each input. If there are spaces after the letter on the last line of each input and you read a char to skip to the next line, you will read a space, not a '\n'.

Then, to read the character like a string avoid this error.

Bye

Hi htl,

I has the same error because the problem description that is not good.
Change the line:
[cpp]temp[shuffle[k-1][z]-1]=card[z];[/cpp]
by
[cpp]temp[z]=card[shuffle[k-1][z]-1];[/cpp]

Best regards,

Sebasti

Hi,

First, your program is too complex. Look the usage of functions like strtol, atoi and the iosflags of C++, and you will see that the size of your code will decrease. :)

Second, when the input begin with 0 and the other caracter is not x, you must no print 0, because the number could be a ...

Hi,

Change the limits of your while loops to sqrt(in1)+1 and sqrt(in2)+1.

If the TLE still, try precalc the prime numbers and put them on a big array
(sieve of eratostenes).

Bye.

Hi,

i don't know how to do using scanf, but using cin is:

if( cin.get() != '\n' ){
cin.unget();
cin >> number;
}

The standard input has a buffer, where you can go ahead and come back with the functions get and unget.

Bye

Hi,

I've got a WA, and i don't know what's wrong.
Do you have anothers test cases?
What should be the output to this case:

1
3 11 12 13

anyone can help me?