![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM-HDU step
文章平均质量分 78
free-dancer
i am growing~!
展开
-
HDU Text Reverse/1.2
1.12字符反转:Sample Input3olleh !dlrowm’I morf .udhI ekil .mcaSample Outputhello world!I’m from hdu.I like acm.好久没有用 STL ,于是想到了string 数组的使用 ,还有reverse(s.begin(),s.end()),发现不行 , 在这个题里原创 2017-05-22 19:31:52 · 335 阅读 · 0 评论 -
HDU Quicksum
题意:ACM: 1*1 + 2*3 + 3*13 = 46MID CENTRAL: 1*13 + 2*9 + 3*4 + 4*0 + 5*3 + 6*5 + 7*14 + 8*20 + 9*18 + 10*1 + 11*12 = 650ACMMID CENTRALREGIONAL PROGRAMMING CONTESTACNA C MABCBBC#原创 2017-05-22 19:39:32 · 379 阅读 · 0 评论 -
数学1(n^n)Leftmost Digit
Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3677 Accepted Submission(s): 1631 Problem DescriptionGi原创 2017-05-29 19:04:46 · 331 阅读 · 0 评论 -
数学2 约瑟夫环问题 + 环的遍历问题
Problem DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is原创 2017-06-14 18:37:41 · 508 阅读 · 0 评论 -
knight moves经典广搜(bfs)
Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n原创 2017-06-15 09:58:14 · 554 阅读 · 0 评论