Utkarsh and his employees.[Easy-Medium]
Practice
5 (1 votes)
Easy
Problem
77% Success 788 Attempts 20 Points 1s Time Limit 256MB Memory 1024 KB Max Code
Utkarsh as the HR of Apple Inc. has to select candidates for hiring. He has been given N candidates and he can only select candidates that are adjacent to each other. You have to tell that in how how many ways he can select employees.
He has to select at least two candidates.
Standard input
The first line contains a single integer T the number of test cases.
Than for every test case there is the n the number of candidates
Standard output
For each test case there is single output number as said in the above question.
Constraints
1<t<10^5
2<n<10^9
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Results
Custom Input
Run your code to see the output
Submissions
Please login to view your submissions
Editorial
No editorial available for this problem.