2014-11-12 20:24:14
总结：这场前三题比较顺利，D想到是树DP然后就不想搞了，作死搞了一发E....没搞出来orz....
A：简单数学
1 /************************************************************************* 2 > File Name: a.cpp 3 > Author: Nature 4 > Mail: 564374850@qq.com 5 > Created Time: Tue 11 Nov 2014 10:57:58 PM CST 6 ************************************************************************/ 7 8 #include <cstdio> 9 #include <cstring> 10 #include <cstdlib> 11 #include <cmath> 12 #include <vector> 13 #include <map> 14 #include <set> 15 #include <stack> 16 #include <queue> 17 #include <iostream> 18 #include <algorithm> 19 using namespace std; 20 #define lp (p << 1) 21 #define rp (p << 1|1) 22 #define getmid(l,r) (l + (r - l) / 2) 23 #define MP(a,b) make_pair(a,b) 24 typedef long long ll; 25 const int INF = 1 << 30; 26 27 ll n; 28 29 int main(){ 30 scanf("%I64d",&n); 31 ll a = n / 2; 32 if(n % 2){ 33 printf("%I64d\n",a - n); 34 } 35 else printf("%I64d\n",a); 36 return 0; 37 }