OJ Board

I used 'unsigned long long'

what if i == j ?

minNum != maxNum

should be

minNum <= maxNum

We're not supposed to post a AC code here..
Please remove it..

I can't access to the forum for volume CXXI, CXXII, CXXIII
It gives me this message..

You do not have the required permissions to read topics within this forum

There hasn't been a new thread for a while, maybe other users don't have a permission either..

See this thread

http://acm.uva.es/board/viewtopic.php?f=5&t=10991

Remove your code if you get AC

1 is not a proper divisor of 1

input
My output
My AC code also assume that H is always greater than or equal to L

Try this

char st[300000]

instead of

char *st

Try this case..

My output is..

Try this case..
My output is..

valvooo wrote:What is the answer for:

Code: Select all

1
1 1 0

and

Code: Select all

2
1 1 0
2 2 0

Cause i don't know where is wrong...

My AC code returns..

Yes.. the description is confusing..
The formula is

f(x) = a*x*x + b*x + c

The sample out is also wrong..

Can someone who has solved this problem let me know what answer they get for the following input? 1 4 23 2414 6028 1010 1508 4244 743 9021 2690 1265 5478 2918 5462 3574 8662 7098 5207 4110 2662 2624 748 651 5884 3873 6556 8707 397 7093 3177 5930 1904 2427 3786 5994 7001 1636 5094 7332 5012 6034 125...

Thnx Helloneo... I misunderstood the problem.I was checking from the end of number and repeating the process recursively as Jan explained.For example:For input 323289 at first i found x=289 which results Y=89 and as according to rule 3 it produces 89289 .So number becomes 3289289...recursively agai...