sicily解题原代码
GuihongMa
这个作者很懒,什么都没留下…
展开
-
1920. Divide The Stones
//a pile of n stones can be divided by n-1 times #include #include using namespace std; int main(){ int t; scanf("%d",&t); while(t--){ int n; int sum = 0; in原创 2013-01-08 23:11:02 · 366 阅读 · 0 评论 -
1874. Three little pigs
这是我在sicily上排名第一的代码 题目很短,看似很简单,实则不然 主要的意思是求将n个元素的集合划分为m个子集的方法总数 找到递推公式 f(n,m)=f(n-1,m-1)+m*f(n-1,m) 但注意0 //希望大家多给点评论或建议的~ #include #include #include #include using namespace std; string p(s原创 2013-01-10 11:00:28 · 283 阅读 · 0 评论 -
1801. Reading books
//use the method of dividing the books into several subsets //color the similar books with the same color unless it has been colored //then read the book with the least time in each subset first原创 2013-01-08 23:26:00 · 327 阅读 · 0 评论