2014年2月24日
HDUOJ---1879 继续畅通工程
摘要： 继续畅通工程Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11473Accepted Submission(s): 5026Problem Des... 阅读全文
posted @ 2014-02-24 21:56 龚细军 阅读(215) 评论(0) 推荐(0)
HDUOJ---1102Constructing Roads
摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12173Accepted Submission(s): 4627Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文
posted @ 2014-02-24 19:10 龚细军 阅读(188) 评论(0) 推荐(0)
HDUOJ---1102Constructing Roads
摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12173Accepted Submission(s): 4627Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文
posted @ 2014-02-24 19:09 龚细军 阅读(195) 评论(0) 推荐(0)
hdu--DFS
摘要： DFSTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4422Accepted Submission(s): 2728Problem DescriptionA DFS(digital factorial sum) number is found by summing the factorial of every digit of a positive integer.For example ,consider the positive inte 阅读全文
posted @ 2014-02-24 14:30 龚细军 阅读(287) 评论(0) 推荐(0)