Hust oj 1196 Marshal's confusion II（公式）

Marshal's confusion II

Time Limit: 1000 MS Memory Limit: 65536 K Total Submit: 258(95 users) Total Accepted: 84(76 users) Rating:  Special Judge: No

Description

one day, Marshal want to show the answer :Calculate S(n). S(n)=1^3+2^3 +3^3 +......+n^3 .

Input

Each line will contain one integer N(1 < n < 1000000000). Process to end of file.

Output

For each case, output the last four dights of S(N) in one line.

Sample Input

1 2

Sample Output

0001 0009 公式：S(n)=1^3+2^3 +3^3 +......+n^3=[n(n+1)/2]^2 #include<cstdio> #include<iostream> #include<cmath> using namespace std; typedef long long int ll; ll n; int main() { while(~scanf("%lld",&n)) { n %= 10000; ll a = (n + 1)*n/2; printf("%04lld\n",a*a%10000); } }