![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDOJ基础题
sthahahaa
55
展开
-
HDOJ1104Let the Balloon Rise
Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 63467 Accepted Submission(s): 23440Problem DescriptionContest原创 2014-01-12 12:40:02 · 529 阅读 · 0 评论 -
HDOJ1002大数相加
#include#includeint main(void){ int cass; int cc = 0; char a[1005], b[1005]; while(~scanf("%d", &cass)){ int count = 1; while(cc++ < cass){ scanf("%s%s",原创 2014-01-12 12:41:43 · 661 阅读 · 0 评论 -
hdu_moving tables 区间重叠
#includeint space[200];int main(){ int a, b, i; int from, to; while(~scanf("%d", &a)){ while(a--){ memset(space, 0, sizeof(space)); scanf("%d", &b); while(b--){ scanf("%d%d", &from, &to); if(from > to原创 2014-10-08 21:42:53 · 426 阅读 · 0 评论 -
快速计算(a^b)%C
#include#define C 10// a^b%10int main(){ int a, n; int res, tool;//工具变量 while(~scanf("%d", &n)){ while(n--){ scanf("%d", &a);//计算a^a,这里 a<=int_max res=1; tool = a%C; while(a){原创 2014-10-09 21:34:56 · 602 阅读 · 0 评论