上一页 1 ··· 47 48 49 50 51 52 53 54 55 ··· 57 下一页
摘要: A|B 题意: 给出一个整数n(1<=n<=10100),求Σd(d满足d可以整除n),同时保证不存在x^2有x^2可以整除n。 另外,n的质因子满足小于等于1000。 题解: 这题是我第一道用python做的题...毕竟大数C写起来还是挺麻烦的。 根据唯一分解定理我们知道n=p1^a1*p2^a2 阅读全文
posted @ 2018-12-10 21:40 heyuhhh 阅读(152) 评论(0) 推荐(0) 编辑
摘要: Food Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8185 Accepted Submission(s): 2702 题目链接:http: 阅读全文
posted @ 2018-12-10 21:21 heyuhhh 阅读(219) 评论(0) 推荐(0) 编辑
摘要: Island Transport Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 13187 Accepted Submission(s): 阅读全文
posted @ 2018-12-10 21:15 heyuhhh 阅读(199) 评论(0) 推荐(0) 编辑
摘要: Power Network 题目链接:http://poj.org/problem?id=1459 Description: A power network consists of nodes (power stations, consumers and dispatchers) connected 阅读全文
posted @ 2018-12-10 19:11 heyuhhh 阅读(801) 评论(0) 推荐(0) 编辑
摘要: Minimum Cost 题目链接:http://poj.org/problem?id=2516 Description: Dearboy, a goods victualer, now comes to a big problem, and he needs your help. In his s 阅读全文
posted @ 2018-12-10 19:01 heyuhhh 阅读(190) 评论(0) 推荐(0) 编辑
摘要: Going Home 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4289 Description:On a grid map there are n little men and n houses. In each unit time, every 阅读全文
posted @ 2018-12-10 18:48 heyuhhh 阅读(262) 评论(0) 推荐(0) 编辑
摘要: A Plug for UNIX 题目链接:https://vjudge.net/problem/POJ-1087 Description: You are in charge of setting up the press room for the inaugural meeting of the 阅读全文
posted @ 2018-12-07 22:08 heyuhhh 阅读(227) 评论(0) 推荐(0) 编辑
摘要: Dining 题目链接:https://vjudge.net/problem/POJ-3281 Description: Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and 阅读全文
posted @ 2018-12-07 21:55 heyuhhh 阅读(155) 评论(0) 推荐(0) 编辑
摘要: F. Ehab and a weird weight formula 题目链接:https://codeforces.com/contest/1088/problem/F 题意: 给出一颗点有权值的树,满足只有一个点的权值最小,然后除开这个点,每个点都有一个权值比它更小的点与之相邻。 然后要求你重构 阅读全文
posted @ 2018-12-07 21:45 heyuhhh 阅读(143) 评论(0) 推荐(0) 编辑
摘要: E. Ehab and a component choosing problem 题目链接:https://codeforces.com/contest/1088/problem/E 题意: 给出一个数,找出k个连通块,使得连通块里面点的和除以k最大。当选择不同数量的连通块有相同的最大值时,要求输出 阅读全文
posted @ 2018-12-06 22:01 heyuhhh 阅读(154) 评论(0) 推荐(0) 编辑
上一页 1 ··· 47 48 49 50 51 52 53 54 55 ··· 57 下一页