OJ Board

Just forget it. I just make a silly mistake in initialization.
Thanks

Thanks. I have modified my code.
However, I still get a WA.
Can anyone help me again?

[pascal]--Cut--[/pascal]

Since I get WA in 485, which is also a BigInt problem.
I wonder if my BigInt code is correct.
Can anyone please check my code?
[pascal --Cut--[/pascal]

No, I hardcode the answer to be 1.

I use the formula " --removed-- " but get WA.
Can anyone help me?

The formula is removed to save the interest of the problem.

I get wrong answer for many times, but I still can't find my bug.
Can anyone tell me what is wrong?

[pascal]--Cut--[/pascal]
The number that is greater than 10^60 should have 61 diigts, I think.

Thanks, Overlord. I've got accepted.

But somebody can get AC with Pascal.
What's the problem of my program?

Isn't it just calculate the last digit of M and last two digit of N and find the last sigit of the answer?
But I get Wrong Answer. Can anyone help me?
[pascal]Code is deleted[/pascal]

Can anyone tell me what is the difference between Double and Extended?
I get WA with Extended in p10509 but Accepted with Double.

Do you mean that if we must have beer, we only need to minimize the time for beer but don't need to maximize the number of burger?

For p10490, your perfect number for 31 is wrong.

Turuthok, you are right. But I don't think this kind of input is present in the judge input.
Because my accepted program gives 2 as the answer.

Pier, try this input:
2
1
2
1
2147483647 (MaxInt)
0
The output should be trivial.

Oh...I misunderstand the input as 9 7 6 2 (four numbers).
My program passes these cases, however it still gets WA

I don't understand your input.
Why the input
9 7 6 2
gives
8
Why there are four integers in the input? And what do they represent?