Round Table

Asked in:
TCS

Problem Description

There is a party at Ram's house, he will be inviting A friends to his party.
There is round table at his house which has A+1 seats.
Among all those friends Shyam is Ram's best friend and Ram wants to sit with him.
Find the number of ways to sit such that Ram and Shayam will sit together.
Since this number can be very large take modulo 10⁹ + 7.

Problem Constraints

1 <= A <= 10⁵

Input Format

Given an integer A.

Output Format

Return an integer.

Example Input

Input 1:

A = 1

Input 2:

A = 2

Example Output

Output 1:

Output 2:

Example Explanation

Explanation 1:

Let the two people be
1 -> Ram
2 -> Shyam
Then the possible arrangements are {1, 2}, {2, 1}

Explanation 2:

Let the three people be
1 -> Ram
2 -> Shyam
3 -> Third friend
Then the possible arrangements are {1, 2, 3}, {3, 1, 2}, {2, 1, 3}, {3, 2, 1}

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Round Table on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Round Table

Discussion