hdu 2114(立方和)

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#define LL __int64
#define MAX 0x3f3f3f3f
#define MOD (10000)
#define N (1000000 + 5)
using namespace std;

int a
;

int main()
{
int n;
while (~scanf("%d", &n))
{
LL ans;

n = n % MOD;

if (n & 1)
{
ans = (n + 1) / 2 * n;
}
else
{
ans = n / 2 * (n + 1);
}

ans = ans * ans % MOD;

if (ans < 10)
{
printf("000%I64d\n", ans);
}
else if (ans < 100)
{
printf("00%I64d\n", ans);
}
else if (ans < 1000)
{
printf("0%I64d\n", ans);
}
else
{
printf("%I64d\n", ans);
}
}
}