| Submit | All submissions | Best solutions | Back to list |
NAJSS - Series Sum |
Your given a mathematical series
1^5+2^5+3^5+4^5………………………..N^5
You given the value of N output the sum with Mod 10^9+7
Input:
Input start with an integer T(T≤10000).
Each test case contain a integer N (1≤N≤10^9)
Output
For each test case, print the case no and the Sum of series. Mod 10^9+7
Sample:
|
Input |
Output |
|
2 5 10 |
Case 1: 4425 Case 2: 220825 |
| Added by: | Najmuzzaman |
| Date: | 2017-05-06 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | C C++ 4.3.2 CPP CPP14 CPP14-CLANG COBOL LISP clisp D ERL HASK JAVA OCAML PAS-GPC PAS-FPC PERL PHP PICO PIKE PYTHON PYPY PYTHON3 RUBY |
RSS