URAL 1068. Sum
来源:互联网 发布:开源软件代码 编辑:程序博客网 时间:2024/05/16 10:01
problem url: http://acm.timus.ru/problem.aspx?space=1&num=1068
this is a simple math calculation question:
#some one only use one-line code to compute the result
#include <cstdio>
#include <iostream>
using namespace std;
int N = 0;
void main()
...{
scanf("%d", &N);
int cnt = 0;
if(N>=1)
...{
cnt = N;
}else
...{
cnt = 2-N;
}
if(N%2 ==0)
...{
int ret = 0;
if(N>=1)
...{
ret = (1+ N-1)/2 * (cnt-1) + N;
}else
...{
ret = (N+1 +1)/2 * (cnt-1) + N;
}
printf("%d", ret);
}else
...{
printf("%d", (N+1)/2 * cnt);
}
}
#include <iostream>
using namespace std;
int N = 0;
void main()
...{
scanf("%d", &N);
int cnt = 0;
if(N>=1)
...{
cnt = N;
}else
...{
cnt = 2-N;
}
if(N%2 ==0)
...{
int ret = 0;
if(N>=1)
...{
ret = (1+ N-1)/2 * (cnt-1) + N;
}else
...{
ret = (N+1 +1)/2 * (cnt-1) + N;
}
printf("%d", ret);
}else
...{
printf("%d", (N+1)/2 * cnt);
}
}
- URAL 1068. Sum
- Ural-1068. Sum(水题)
- URAL 1068. Sum (小学数学题)
- Ural 1146. Maximum Sum
- Ural 1068 - Sum
- Ural 1068 sum
- URAL 1146. Maximum Sum
- Ural 1146 Maximum Sum
- Ural 1658 Sum of Digits
- ural 1658. Sum of Digits
- Ural acm 1146. Maximum Sum
- URAL 1658. Sum of Digits
- Ural 1658 Sum of Digits
- ural 1146. Maximum Sum dp
- 1146. Maximum Sum URAL 解题报告
- Ural 1146. Maximum Sum DP经典
- URAL 1658. Sum of Digits(简单dp)
- URAL 1749 Periodic Sum (二分法 + 溢出处理)
- 一个很不错的题目,解决方法很精巧
- Linux内核学习(1)——内存管理
- 加密
- 很愿意做一些力所能及的小东西。
- 现在时间是Sun Nov 04 21:51:46 CST 2007
- URAL 1068. Sum
- 网络检测与诊断
- PC服务器的“虚拟卡”- VMWare ESX Server 3i
- 省内 知名网站检测
- Spring与Struts的整合之一:使用ActionSupport代替Action
- javaScript 简介
- 开卷语
- 数据结构中的maze问题
- [IIS日志分析工具]产品设想