HDU--2114
2015-06-08 17:04
190 查看
Calculate S(n)
Time Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8905 Accepted Submission(s): 3257
Problem Description
Calculate S(n).
S(n)=13+23 +33 +......+n3 .
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
Author
天邪
#include <iostream> #include <stdio.h> using namespace std; int main() { long long int n; while (cin >> n) { long long int result; result = ((n * (n+1) / 2) %10000) * ((n * (n+1) /2) %10000) %10000; printf("%04lld\n",result); } return 0; }
相关文章推荐
- Spring mvc-异常javax.servlet.ServletException: Could not resolve view with name 'xxx' in servlet with name 'spring'
- 知识收集
- salt openstack生成随机字符串
- (ML foundation)break point & VC bound
- Spring -- AOP 优缺点
- Spring -- AOP 优缺点
- Spring -- AOP 优缺点
- jquery div模态窗口
- pintos操作系统thread部分的实现
- IO-06 输出短句II(5)
- linux程序设计——linux环境(第四章)
- Struts框架学习之拦截器
- spring整合struts2
- Android Bundle类别
- Android性能测试工具 使用方法
- 网络编程释疑之:单台服务器上的并发TCP连接数可以有多少
- ZOJ 3870 Team Formation
- linux shell 字符串操作(长度,查找,替换)详解
- hdu 5264 pog loves szh I 水题
- Infinite size of Hypothesis set and growth funciton