USACO 2.3
2017-03-03 11:11
246 查看
直接dfs
要注意的一点是输出的顺序。
/*
ID: me
PROG: zerosum
LANG: C++
*/
#include
#include
#include
using namespace std;
int n;
int f1[30];
int fun(){
int i,j;
int sum1=1;
int t1;
for(i=1;i<=n-1;
要注意的一点是输出的顺序。
/*
ID: me
PROG: zerosum
LANG: C++
*/
#include
#include
#include
using namespace std;
int n;
int f1[30];
int fun(){
int i,j;
int sum1=1;
int t1;
for(i=1;i<=n-1;
相关文章推荐
- USACO 2.3 Controlling Companies
- usaco 2.3 concom...
- USACO-Section2.3 Controlling Companies
- [USACO Training] Section 2.3
- USACO2.3 最长前缀 Longest Prefix(trie)
- USACO section2.3 Longest Prefix题解&代码
- usaco 2.3 money--强悍题解2008.6.21
- USACO 2.3 Zero Sum 题解
- USACO-Section2.3 Money Systems
- usaco-2.3-nocows-passed
- 【USACO 2.3】Cow Pedigrees(DP)
- 【USACO 2.3】Controlling Companies (递推)
- USACO section2.3 Cow Pedigrees题解&代码
- USACO 2.3 货币系统(背包/生成函数)
- USACO 2.3 Longest Prefix
- USACO-Section 2.3 Longest Prefix (DP)
- [USACO2.3]控制公司 Controlling Companies
- USACO-Section2.3 Longest Prefix【动态规划】
- USACO-Section2.3 Cow Pedigrees【动态规划】
- USACO-Section2.3 Money Systems【动态规划】