Bzoj1621/p2907 [usaco 08open] roads around the farm round the farm

P2907 [usaco 08open] roads around the farm round the farm

Basic DFS: recursively follow the meaning of the question.

1 # include <iostream> 2 # include <cstdio> 3 # include <cstring> 4 # define re register 5 using namespace STD; 6 int N, K, ans; 7 void DFS (int x) {8 If (x <= k | (X-k) & 1) {// No half of the cows (dense fog) 9 + + ans; return; 10} DFS (X-k)/2); DFS (X-k)/2 + k ); // divided into 2 groups 11} 12 INT main () {13 scanf ("% d", & N, & K); DFS (N ); 14 printf ("% d", ANS); 15 return 0; 16}

View code

 

Bzoj1621/p2907 [usaco 08open] roads around the farm round the farm