CSHOWE - Sir and the Cooks
Mr. Ronaldo, Jadeja's best friend wants to visit the Jadeja's Restaurant. So Sir wants to make sure that he serves him his favourite dish.
Fortunately Sir Jadeja knows that Mr. Ronaldo likes Indian dishes. So Sir wants to select his best Indian cook. But he's not sure whom to select. So he decides to examine them. Sir told the cook's that 'n' rounds will be conducted in the test and a minimum mark in each round is required to pass the test and he needs to clear all the rounds. Each cook will take part in every round. When Sir returned home, he told Jags (his daughter) about the plan and since her daughter is good at maths, he asked her to tell in how many ways the cooks can fail. Considering yourself as Jags solver Sir Jadeja’s problem.
"Jags always gives right answers".
Input
The first line consist of a integer 'T', denoting the number of test cases. The next t lines each consists of a single integer n.
1 <= n <= 2000000000
1 <= T <= 5000
Output
Output Jags's answer. Since the answer can be quite large, give the answer modulo 1000000007.
Example
Input: 2 1 2 Output: 1 3
hide comments
Mitch Schwartz:
2013-11-01 17:50:44
Moved to tutorial. |
|
Raushan Kumar:
2013-11-01 16:36:25
easy one :P |
|
Martijn Muijsers:
2013-11-01 14:34:34
Basic problem, requires reading though. Test cases don't reveal answer, good :) |
|
રચિત (Rachit):
2013-10-31 22:36:25
Tutorial! |
Added by: | Aradhya |
Date: | 2013-10-25 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | CodeShow IIIT Allahabad |