![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HD_ACM
文章平均质量分 51
agilely
这个作者很懒,什么都没留下…
展开
-
1248
http://acm.hdu.edu.cn/showproblem.php?pid=1248 #includeusing namespace std;int flag[]={150,200,350};bool avi[10001]={false};int main(){ int t,n,i,j,k; for(i=0;i<10001;i+=flag[0])原创 2009-12-13 12:55:00 · 415 阅读 · 0 评论 -
1004
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges favorite time is guessing the most popular problem. When the contest i原创 2009-12-13 15:57:00 · 313 阅读 · 0 评论 -
1009 贪心
Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contain原创 2009-12-13 23:09:00 · 382 阅读 · 0 评论 -
1050
http://acm.hdu.edu.cn/showproblem.php?pid=1050 //维护一张表P[],其值最大的数即为所需的时间数#includeint main(){ int i,j,t,N,P[200],k,s,d,temp,min; scanf("%d",&t); for(i=0;i<t;i++) { for(j=0;j<200;j+原创 2009-12-13 12:42:00 · 201 阅读 · 0 评论 -
★1007 给定一些点求两点之间的最短距离
Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the pos原创 2009-12-13 16:05:00 · 1275 阅读 · 0 评论 -
1008
Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified原创 2009-12-13 21:38:00 · 286 阅读 · 0 评论 -
1002
大数相加 #include using namespace std;int main(){ char a[1000],b[1000],c[1000]; int n,Case = 1; cin>>n; while(n--) { cin>>a>>b; int i = strlen(a);原创 2009-12-13 15:36:00 · 257 阅读 · 0 评论 -
1003 局部最值问题
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +原创 2009-12-13 15:46:00 · 371 阅读 · 0 评论 -
1010 迷宫问题
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He re原创 2009-12-14 11:25:00 · 354 阅读 · 0 评论