摘要：
区间覆盖问题Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description 用i来表示x坐标轴上坐标为[i-1，i]的长度为1的区间，并给出n（1≤n≤200）个不... 阅读全文
posted @ 2017-08-30 19:22
WangMeow
阅读(343)
评论(0)
推荐(0)
摘要：
Cyclic NacklaceProblem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday,... 阅读全文
posted @ 2017-08-29 14:34
WangMeow
阅读(141)
评论(0)
推荐(0)
摘要：
OulipoProblem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was... 阅读全文
posted @ 2017-08-24 17:05
WangMeow
阅读(133)
评论(0)
推荐(0)
摘要：
Number SequenceProblem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 #includ... 阅读全文
posted @ 2017-08-24 16:04
WangMeow
阅读(133)
评论(0)
推荐(0)
摘要：
数据结构实验之串三：KMP应用Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description有n个小朋友，每个小朋友手里有一些糖块，现在这些小朋友排成一排，编号是由... 阅读全文
posted @ 2017-08-24 10:34
WangMeow
阅读(227)
评论(0)
推荐(0)
摘要：
数据结构实验之串一：KMP简单应用Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description给定两个字符串string1和string2，判断string2是否... 阅读全文
posted @ 2017-08-23 19:02
WangMeow
阅读(248)
评论(0)
推荐(0)
摘要：
2278: 判断是否是子串（串）Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 30 Solved: 15[Submit][Status][Web Board]Description设s、t为两个字符串，分别放在两个一维... 阅读全文
posted @ 2017-08-23 09:45
WangMeow
阅读(595)
评论(0)
推荐(0)
摘要：
数据结构实验之串二：字符串匹配Time Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem Description 给定两个字符串string1和string2，判断string2是否... 阅读全文
posted @ 2017-08-22 20:49
WangMeow
阅读(177)
评论(0)
推荐(0)
摘要：
All in AllTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 33567 Accepted: 14013DescriptionYou have devised a new encryption ... 阅读全文
posted @ 2017-08-22 19:44
WangMeow
阅读(187)
评论(0)
推荐(0)
摘要：
pairsProblem DescriptionJohn has n points on the X axis, and their coordinates are (x[i],0),(i=0,1,2,…,n−1). He wants to know how many... 阅读全文
posted @ 2017-08-22 19:18
WangMeow
阅读(169)
评论(0)
推荐(0)
浙公网安备 33010602011771号