0
votes
3answers
49 views

If there are $N$ people on the positive $x$-axis and one man can send a message to another one only if the distance between them is $\leq k $.

The question is how to determine a function which would decide if a pair of persons can communicate with each other, where communication is possible only if the distance between two individuals are ...
0
votes
0answers
2k views

Minimum moves to reach destination [closed]

Moderator Note: This is a current contest question on codechef.com. Given that a person is standing at $(0,0)$ and initially look in direction of $X$-axis. Now he can walk only at right angle to ...
1
vote
0answers
110 views

Number of classes of K-sets

I am having a plane in N dimension. Th distance between 2 points (a1,a2,...,aN) and (b1,b2,...,bN) is max{|a1-b1|, |a2-b2|, ..., |aN-bN|}. I need to to know how many K-sets exist(here K-set refers to ...
0
votes
1answer
37 views

Counting ways on the coordinate system

What is the number of ways in which you can reach a point (2,2) from the origin, taking unit steps at a time , in not more than 7 steps?
0
votes
2answers
2k views

Number of ways of reaching a point from origin [duplicate]

Possible Duplicate: How can I find the number of the shortest paths between two points on a 2D lattice grid? If we have a point p(x,y) in coordinate system [x>=0, y>=0; i.e 1st quadrant] ...