摘要: Foj 1106 题目: "Sum of Factorials" 代码: python include include include include int n; int store[11]={1,1,2,6,24,120,720,5040,40320,362880}; bool dfs(int 阅读全文
posted @ 2016-03-24 22:40 Wasdns 阅读(287) 评论(0) 推荐(0) 编辑
摘要: 题目: "Number Sequences" 代码: python include include include include using namespace std; int Ns[100]; int main() { int n,a,b,i; while(scanf("%d%d%d",&a, 阅读全文
posted @ 2016-03-24 22:17 Wasdns 阅读(141) 评论(0) 推荐(0) 编辑
摘要: 题目: "粗心的物理学家" 代码: 注意的地方在上述的代码注释处体现了,这里运用for循环可以直接暴力解决问题,不过必须要从1/n到1来遍历,这与最后结果的精度有关。 阅读全文
posted @ 2016-03-24 22:04 Wasdns 阅读(205) 评论(0) 推荐(0) 编辑