2015年11月23日
How many integers can you find(容斥+dfs容斥)
摘要： How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6001 Accepted Sub... 阅读全文
posted @ 2015-11-23 22:50 handsomecui 阅读(251) 评论(0) 推荐(0) 编辑
Buy Tickets(线段树)
摘要： Buy TicketsTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 16607Accepted: 8275DescriptionRailway tickets were difficult to buy around the Lun... 阅读全文
posted @ 2015-11-23 22:22 handsomecui 阅读(842) 评论(0) 推荐(2) 编辑
Co-prime(容斥)
摘要： Co-primeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2786Accepted Submission(s): 1072 Problem ... 阅读全文
posted @ 2015-11-23 15:29 handsomecui 阅读(224) 评论(0) 推荐(0) 编辑
Eddy's爱好（dfs+容斥）
摘要： Eddy's爱好Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2037Accepted Submission(s): 857 Problem D... 阅读全文
posted @ 2015-11-23 14:56 handsomecui 阅读(310) 评论(0) 推荐(0) 编辑
UVA-11806 - Cheerleaders(dp+容斥)
摘要： 11806 - Cheerleaders In most professional sporting events, cheerleaders play a major role in entertaining the spectato... 阅读全文
posted @ 2015-11-23 11:31 handsomecui 阅读(1039) 评论(0) 推荐(0) 编辑