Submit | All submissions | Best solutions | Back to list |
CTCC - Compute The Computation |
Let P = C(N, 0) - C(N, 1) + C(N, 2) - C(N, 3) + ... C(N, N)
You are given N. You have to find the value of P.
Input
Input starts with an integer T, denoting the number of test cases. Each test case contains an integer N.
Constraints
0 <= N <= 1000000
1 <= T <= 1000000
Output
For each test case, print the value of P.
Example
Input: 1 4 Output: 0
Note: use faster i/o method.
Problem Setter: Md Abdul Alim, Dept. of Computer Science, Bangladesh University of Business & Technology
Added by: | Alim |
Date: | 2016-04-01 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 GOSU JS-MONKEY |
Resource: | Own Problem |
hide comments
2022-04-15 06:41:08 Md Abdul Alim
Sample Input is updated. |
|
2018-11-12 21:41:52
Read input as in description, integer t = number of testcases first, then t integers. Sample is wrong. |