上一页 1 ··· 3 4 5 6 7 8 9 10 11 ··· 18 下一页

1061 Dating (20 分)

摘要: 1061 Dating (20 分) Sherlock Holmes received a note with some strange strings: Let's date! 3485djDkxh4hhGE 2984akDfkkkkggEdsb s&hgsfdk d&Hyscvnm. It to 阅读全文
posted @ 2019-01-31 15:48 ZhangのBlog 阅读(331) 评论(0) 推荐(0)

1042 Shuffling Machine (20 分)简单模拟

摘要: 1042 Shuffling Machine (20 分) Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as we 阅读全文
posted @ 2019-01-31 13:34 ZhangのBlog 阅读(121) 评论(0) 推荐(0)

1132 Cut Integer (20 分)

摘要: Cutting an integer means to cut a K digits lone integer Z into two integers of (K/2) digits long integers A and B. For example, after cutting Z = 1673 阅读全文
posted @ 2019-01-29 21:24 ZhangのBlog 阅读(152) 评论(0) 推荐(0)

1100 Mars Numbers (20 分)

摘要: 1100 Mars Numbers (20 分) People on Mars count their numbers with base 13: Zero on Earth is called "tret" on Mars. The numbers 1 to 12 on Earch is call 阅读全文
posted @ 2019-01-29 20:53 ZhangのBlog 阅读(138) 评论(0) 推荐(0)

1077 Kuchiguse (20 分)求字符串最长相同后缀

摘要: 1077 Kuchiguse (20 分) The Japanese language is notorious for its sentence ending particles. Personal preference of such particles can be considered as 阅读全文
posted @ 2019-01-29 18:57 ZhangのBlog 阅读(184) 评论(0) 推荐(0)

1065 A+B and C (64bit) (20 分)大数 溢出

摘要: 1065 A+B and C (64bit) (20 分) Given three integers A, B and C in [−2​63​​,2​63​​], you are supposed to tell whether A+B>C. Input Specification: The fi 阅读全文
posted @ 2019-01-29 18:30 ZhangのBlog 阅读(616) 评论(0) 推荐(0)

1107 Social Clusters (30 分)并查集

摘要: 1107 Social Clusters (30 分) When register on a social network, you are always asked to specify your hobbies in order to find some potential friends wi 阅读全文
posted @ 2019-01-29 15:56 ZhangのBlog 阅读(628) 评论(0) 推荐(0)

1079 Total Sales of Supply Chain (25 分)

摘要: 1079 Total Sales of Supply Chain (25 分) A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in mo 阅读全文
posted @ 2019-01-28 13:53 ZhangのBlog 阅读(541) 评论(0) 推荐(0)

1078 Hashing (25 分)

摘要: 1078 Hashing (25 分) The task of this problem is simple: insert a sequence of distinct positive integers into a hash table, and output the positions of 阅读全文
posted @ 2019-01-28 13:04 ZhangのBlog 阅读(152) 评论(0) 推荐(0)

1063 Set Similarity (25 分)

摘要: 1063 Set Similarity (25 分) Given two sets of integers, the similarity of the sets is defined to be N​c​​/N​t​​×100%, where N​c​​ is the number of dist 阅读全文
posted @ 2019-01-27 20:13 ZhangのBlog 阅读(327) 评论(0) 推荐(0)
上一页 1 ··· 3 4 5 6 7 8 9 10 11 ··· 18 下一页