Devo is learning Combinatorics in his college. He finds it very interesting to calculate number of ways of going to point (c, d) from point (a, b) in co-ordinate plane. We can take horizontal and vertical steps only and cannot visit at a point twice. In a step, you can move one unit only. We have to reach to the point (c, d) from the point (a, b) using abs(a-c) + abs(b-d) steps only. Devo has two sets of points. Set A contains points having X co-ordinate 0 and Y co- ordinates varying from 1 to N (both inclusive). Set B contains points having X co- ordinate K and Y co-ordinates varying from 1 to N (both inclusive). Both sets contain N number of integral points. He wants to calculate the sum of number of ways to going to each point of set B from each point of set A. As the answer can be large, print it modulo 1000000007.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Please Answer this in C++ only
Devo is learning Combinatorics in his college. He finds it very interesting to calculate
number of ways of going to point (c, d) from point (a, b) in co-ordinate plane. We can
take horizontal and vertical steps only and cannot visit at a point twice. In a step, you
can move one unit only. We have to reach to the point (c, d) from the point (a,
b) using abs(a-c) + abs(b-d) steps only.
Devo has two sets of points. Set A contains points having X co-ordinate 0 and Y co-
ordinates varying from 1 to N (both inclusive). Set B contains points having X co-
ordinate K and Y co-ordinates varying from 1 to N (both inclusive). Both sets
contain N number of integral points. He wants to calculate the sum of number of ways
to going to each point of set B from each point of set A.
As the answer can be large, print it modulo 1000000007.
Input
2
22
45
Output
8
236
Transcribed Image Text:Please Answer this in C++ only Devo is learning Combinatorics in his college. He finds it very interesting to calculate number of ways of going to point (c, d) from point (a, b) in co-ordinate plane. We can take horizontal and vertical steps only and cannot visit at a point twice. In a step, you can move one unit only. We have to reach to the point (c, d) from the point (a, b) using abs(a-c) + abs(b-d) steps only. Devo has two sets of points. Set A contains points having X co-ordinate 0 and Y co- ordinates varying from 1 to N (both inclusive). Set B contains points having X co- ordinate K and Y co-ordinates varying from 1 to N (both inclusive). Both sets contain N number of integral points. He wants to calculate the sum of number of ways to going to each point of set B from each point of set A. As the answer can be large, print it modulo 1000000007. Input 2 22 45 Output 8 236
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY