Search found 9 matches

by joshi13
Mon Apr 20, 2009 5:59 am
Forum: Algorithms
Topic: Computing n choose k mod p
Replies: 3
Views: 8268

Re: Computing n choose k mod p

Thanks guys, that theorem and the general approach have proven to be very useful.
by joshi13
Tue Apr 14, 2009 7:00 am
Forum: Algorithms
Topic: Minimum spanning tree
Replies: 9
Views: 4098

Re: Minimum spanning tree

Hi.

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

Thanks in advance.
by joshi13
Tue Apr 14, 2009 4:49 am
Forum: Algorithms
Topic: Computing n choose k mod p
Replies: 3
Views: 8268

Computing n choose k mod p

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.
by joshi13
Sun Jul 13, 2008 7:56 pm
Forum: Volume 114 (11400-11499)
Topic: 11428 - Cubes
Replies: 64
Views: 17449

Re: 11428 - Cubes

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.
by joshi13
Wed Jan 23, 2008 5:14 pm
Forum: Volume 106 (10600-10699)
Topic: 10602 - Editor Nottoobad
Replies: 19
Views: 11342

WA in 10602

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 can o...
by joshi13
Mon Jan 14, 2008 5:36 am
Forum: Volume 113 (11300-11399)
Topic: 11385 - Da Vinci Code
Replies: 70
Views: 23670

Well i changed the line:

Code: Select all

if(isalpha(line[k])
to

Code: Select all

if(isupper(line[k]))
but this still gives WA. dont know why.

Thanks.
by joshi13
Mon Jan 14, 2008 5:21 am
Forum: Volume 113 (11300-11399)
Topic: 11385 - Da Vinci Code
Replies: 70
Views: 23670

11385 - Da Vinci Code

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
by joshi13
Sun Jan 13, 2008 3:41 am
Forum: Volume 113 (11300-11399)
Topic: 11386 - Triples
Replies: 23
Views: 8593

Thanks.

Thanks Rio.
by joshi13
Sun Jan 06, 2008 3:23 am
Forum: Volume 113 (11300-11399)
Topic: 11377 - Airport Setup
Replies: 24
Views: 11907

Graph

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.

Go to advanced search