10055 - Hashmat the Brave Warrior
2014-07-22 21:38
316 查看
#include<stdio.h> #include<string.h> #include<math.h> #include<algorithm> using namespace std; //typedef __int64 lld; typedef long long lld; int main() { lld n,m,ans; //while(scanf("%I64d%I64d",&n,&m)!=EOF) while(scanf("%lld%lld",&n,&m)!=EOF) { if(m>n) ans=m-n; else ans=n-m; //printf("%I64d\n",ans); printf("%lld\n",ans); } return 0; }
题意是32位整数,所以要使用64位整数表示。
相关文章推荐
- UVA 10055 - Hashmat the Brave Warrior
- 10055 - Hashmat the Brave Warrior
- UVa 10055 - Hashmat the Brave Warrior
- UVa OJ 10055-Hashmat the Brave Warrior
- 10055 - Hashmat the Brave Warrior
- 10055 - Hashmat the Brave Warrior
- UVa 10055 Hashmat the brave warrior
- uva 10055 - Hashmat the Brave Warrior
- UVA 10055 Hashmat the Brave Warrior
- Hashmat the brave warrior(UVa10055)简单题
- UVA OJ: 10055 - Hashmat the Brave Warrior
- UVA 10055 -Hashmat the Brave Warrior
- Problem A Hashmat the brave warrior Form VUAoJ 10055
- 10055 - Hashmat the Brave Warrior
- UvaOJ10055 hashmat the brave warrior
- UVa10055 - Hashmat the Brave Warrior - 难度1
- UVa 10055 Hashmat the brave warrior
- 10055 - Hashmat the Brave Warrior
- UVA-10055 - Hashmat the Brave Warrior
- UVa10055 Hashmat the Brave Warrior