分治
齐豪
...
展开
-
格雷码(分治)
#include #include #include using namespace std; char a[20]; //保存每个格雷码串 int n; //每个格雷码串的长度 void dfs(int k) { if (k == n) { printf("%s\n", a); return ; } dfs(k+1)原创 2016-09-19 22:19:18 · 1546 阅读 · 1 评论 -
POJ_2456
Aggressive cows Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11623 Accepted: 5693 Description Farmer John has built a new long barn, with N (2 His C (原创 2016-10-16 10:40:38 · 210 阅读 · 0 评论 -
Drying
It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has decided to use a radiator to make drying faster. But原创 2017-01-18 18:49:53 · 236 阅读 · 0 评论 -
Maximum sum
DescriptionGiven a set of n integers: A={a1, a2,…, an}, we define a function d(A) as below:Your task is to calculate d(A).InputThe input consists of T(<=30) test cases. The number of test cases (T) is原创 2017-10-23 22:13:42 · 323 阅读 · 0 评论