摘要:
题意:传送门 题目描述 As you know, shadow95 is pretty good at maths, especially combinatorial mathematics. Now, he has made a problem for you. We call a subset 阅读全文
摘要:
题目:传送门 题目描述 You are given an integer array s[] and are asked to count how many positions a, b, c and d satisfy the condition: s[a] + s[b] + s[c] == s[ 阅读全文
摘要:
题目描述 给定n组整数(a,b),计算组合数C(a,b)的值。如C(3,1)=3,C(4,2)=6。 输入 第一行为一个整数n,表示有多少组测试数据。(n <= 100000) 第2-n+1行,每行两个整数分别代表a,b;中间用空格隔开。(a,b <= 40) 第一行为一个整数n,表示有多少组测试数 阅读全文
摘要:
题目:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1607 题目描述 A number sequence is defined as follows: f(1) = 1, f(2) = 1, f(n) 阅读全文