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.
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...
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb001567f-2f31-4519-b17a-24d3fce24982%2Fab2ff4bf-e984-45be-b516-1db7ee374bea%2Fpoy1d9_processed.jpeg&w=3840&q=75)
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
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
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…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
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)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
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](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY