OJ Board

lcp wrote:Hi ,
x , y , m , n all lie in range [-10^4 , 10^4] .

so when i did
if ( (x & y) == 0) cout << "divisa ";

i got wrong answer.

But
if ( x== 0 || y== 0) gave okay .

what am i missing ??

They are not equivalent.
Suppose x = 8 and y = 1, then x&y is equal to 0.

What are the inputs you tried to test the code?

A thread already exists for this topic: http://acm.uva.es/board/viewtopic.php?f=10&t=4055

Search the board first before posting. If one exists, make your post in that one.

http://acm.uva.es/board/viewtopic.php?f=20&t=1353

Search the board first using the search option located at top-right. Don't create a new thread for a problem that already exists. Make your post in an existing thread.

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

Search the board first using the 'search' option located at the top right. Don't create a new thread for a problem that already exists. Make your post in an existing thread.

What is your output for the following input:

2 10


and look for threads related to your problem by using the search option on the top-right. Make your post in an existing thread - don't create a new one!

http://www.indiegogo.com/projects/uva-online-judge-new-platform The current UVa Online Judge platform was written back in 2005, using the technlogies and web concepts available at that time. During the past years the overall online services scenario has changed a lot. The way users interact with in...

No, UVa doesn't allow python. UVa allows the languages that is permitted in the ACM ICPC World Finals and it doesn't include python.

You can try http://codeforces.com/ to solve problems using python.

You are assuming that p is not greater than n.

was the difference significant?

'test' passed

anything special you are testing?

Who said we are sorting each number?

Well, it's kind of straight forward.

The first digit should obviously be the smallest to make the the number minimum. Since we aren't allowing leading zeros, so we must place the smallest non-zero digit. Then simply sort the remaining digits in ascending order.

If the ordering is fixed, then can't the path be found by simply following that order? Say, I have to go from vertex 1 to vertex 5 and the order is (1 3 4 2 5), then the only path is 1->3->4->2->5? Am I missing something here? Could you clarify with an example: what do you mean by "ordering is ...