CF 277 div2 A. Calculating Function
2014-11-12 17:30
344 查看
A. Calculating Function
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
For a positive integer n let's define a function f:
f(n) = - 1 + 2 - 3 + .. + ( - 1)nn
Your task is to calculate f(n) for a given integer n.
Input
The single line contains the positive integer n (1 ≤ n ≤ 1015).
Output
Print f(n) in a single line.
Sample test(s)
input
output
input
output
Note
f(4) = - 1 + 2 - 3 + 4 = 2
f(5) = - 1 + 2 - 3 + 4 - 5 = - 3
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
For a positive integer n let's define a function f:
f(n) = - 1 + 2 - 3 + .. + ( - 1)nn
Your task is to calculate f(n) for a given integer n.
Input
The single line contains the positive integer n (1 ≤ n ≤ 1015).
Output
Print f(n) in a single line.
Sample test(s)
input
4
output
2
input
5
output
-3
Note
f(4) = - 1 + 2 - 3 + 4 = 2
f(5) = - 1 + 2 - 3 + 4 - 5 = - 3
# include<cstdio> # include<iostream> using namespace std; int main(void) { long long n; while(scanf("%lld",&n)!=EOF) { if ( n%2 == 0 ) printf("%lld\n",n/2); else printf("%lld\n",n/2-n); } return 0; }
相关文章推荐
- CF round 277 (div2) D题 树形dp
- CF 277 Div2 E LIS of Sequence
- CF-Codeforces Round #392 (Div. 2)-B-Blown Garland
- CF 460 div2 D 题 Substring 【拓扑序 + dp】
- cf 267 div2 E Alex and Complicated Task
- CF 209 Div2 (C) 快速幂 取分子最小的公约数
- CF 172(div2) D(单调队列)
- CF 355 div2 C, D 题解 【很好的两道脑洞题】
- cf-#189-div 2
- CF——Codeforces Round #432 (Div. 2, based on IndiaHacks Final Round 2017)
- CF 191 div2
- CF #192(div2)
- CF 369 div 2 —D 搜索+组合数
- CF 287 div2 A
- cf 442 div2 D bfs最短路
- Anton and Letters - CF#253 (Div. 2)A (443A) 大水
- 【CF】323 Div2. D. Once Again...
- cf 208 div2 C
- cf-213-div1-A. Matrix
- cf-Round #214 (Div. 2)-D-Dima and Trap Graph-dfs+二分