bzoj1621 / P2907 [USACO08OPEN]农场周围的道路Roads Around The Farm

P2907 [USACO08OPEN]农场周围的道路Roads Around The Farm

基础dfs，按题意递归即可。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #define re register
 using namespace std;
 int n,k,ans;
 void dfs(int x){
     if(x<=k||((x-k)&)){//不能有半只奶牛（大雾）
         ++ans; return;
     }dfs((x-k)/); dfs((x-k)/+k);//分成2群
 }
 int main(){
     scanf("%d%d",&n,&k);dfs(n);
     printf("%d",ans);
     return ;
 }