Public submissions
Source code of every submission to this problem in this contest
will be visible for everyone since 2014-03-30 20:30:00.
| Submit | All submissions | Best solutions | Back to list |
POWPOW - Power with Combinatorics |
Your task is to find aexpb,
a: Provided in input, 0 ≤ a ≤ 105
b: Provided in Input, 0 ≤ b ≤ 105
exp = (nC0)2 + (nC1)2 + (nC2)2 + ... + (nCn)2,
n: Provided in the input, 0 ≤ n ≤ 105
As the answer can be too large, you need to output modulo 109+7.
nCr denotes n choose r.
Input
The first line of each input file contains number of test cases t (t ≤ 1000).
Then follow a new line.
Then follow t lines, each containing 3 integers, (i.e. a b n in order) each of them separated by a space.
Output
Output Contains t lines, ith line contains the answer of the ith test case .
Example
Input: 1 1 1 1 Output: 1
Explanation
In First test case, the Value of exp is 2, value of 121 is 1, so output is 1.
| Added by: | devu |
| Date: | 2012-07-13 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM32-GCC ASM64 MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY JULIA KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY PYPY3 R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET |
| Resource: | Own |
| Public source code since: | 2014-03-30 20:30:00 |
RSS