OJ Board

Thanks guys, that theorem and the general approach have proven to be very useful.

Hi.

What about if we are asked the number of different MST ?

Thanks in advance.

Hi all.

How can we apply the modular multiplicative inverse when calculating

(n choose k) mod p, where 'p' is a prime number.

If you could suggest some related problems, it would be very helpful.

Thanks in advance.

Hi.

I got AC in problem 11436 Cubes Extreme, the i tried to solve problem
11428 using the same code i used for 11436 but i got WA. Can anybody provide
some I/O sets ?

Thanks in advance.

Hi, i've also used the greedy choice as previous posts suggested, but i keep getting WA. Pls need some critical I/O. (Note: For the frist input case of the problem, my code outputs: 3 this thing thin which also leads to only 6 presses, and the problem says: "If there are several solutions, you ...

Well i changed the line: to but this still gives WA. dont know why.

Thanks.

Hi, i'm trying to solve this problem. I do the following: - Precompute all fibonacci numbers up to fib(46). - For each character of cypher, if is apha, then look for its correct position in the output string. - Output string. But i am getting WA. Thanks in advance. ACC

Thanks Rio.

Hi, i'm wondering how would be the graph you're working with, how to construct it. It would be very helpful.
Also please post some I/O cases.

Thanks for replies.