ZOJ 3437 Very Hard Problem
2013-05-20 13:12
357 查看
错了不下5次,如果不看报告估计很难想到这错误.
LLONG_MIN的相反数超过了LLONG_MAX所以就错了.
学了strtoll这个函数.
LLONG_MIN的相反数超过了LLONG_MAX所以就错了.
学了strtoll这个函数.
#include <iostream> #include <cstdio> #include <memory.h> #include <cstdlib> #include <limits.h> #include <cstring> using namespace std; const int maxn = 100; int main(){ char str[maxn]; long long base, sign; char opt, trash; while(cin >> opt >> base >> str){ long long ans = strtoll(str, NULL, base); if(opt == '-'){ if(ans == LLONG_MIN)printf("%llu\n", (unsigned long long)ans); else printf("%lld\n", -ans); continue; }else if(opt == '~'){ ans = ~ans; }else{ ans = !ans; } printf("%lld\n", ans); } return 0; }
相关文章推荐
- zoj 3437 Very Hard Problem( = = )
- hdu 4282 A very hard mathematic problem
- hdu 4282 A very hard mathematic problem
- HDU4282 A very hard mathematic problem(枚举+二分)
- hdu4282 A very hard mathematic problem(二分)
- HDU 4403 A very hard Aoshu problem
- HDU 4282 A very hard mathematic problem [枚举]
- hdu4282 A very hard mathematic problem
- A very hard Aoshu problem
- 杭电4403 A very hard Aoshu problem DFS
- A very hard Aoshu problem
- HDU 4282 A very hard mathematic problem
- HDU 4282 A very hard mathematic problem(解方程 天津网络赛)
- HDU-4282 A very hard mathematic problem 技巧枚举+二分
- 【暴力搜索】-HDU-4282-a very hard mathematic problem
- CSU 1325 A very hard problem (莫比乌斯反演+分块求和优化)
- hdu4282 A very hard mathematic problem
- HDU4576 A very hard mathematic problem(很好的搜索)
- A very hard Aoshu problem
- HDU 4403 A very hard Aoshu problem