UVA 10055
摘要：
#include <stdio.h> #include <math.h> int main(){ long long left, right; while (scanf("%lld%lld", &left, &right) != EOF) { printf("%lld\n", (right>left)?(right-left):(left-right)); } return 0; } Analysis：这个题特别的奇怪，陷阱有两个，①. 题目中说是Hashmat's soldier number is 阅读全文
posted @ 2012-11-03 19:21 evilying 阅读(252) 评论(0) 推荐(0) 编辑
