Project Euler Problem 31

#include <iostream> using namespace std; int Pound[]={200,100,50,20,10,5,2,1}; int count=0; void Solve(int index, int value) { if(value==0||index==7) { count++; return ; } for(int i=0;i<=value/Pound[index];i++) Solve(index+1,value-i*Pound[index]); } int main() { Solve(0,200); cout<<count<<endl; }

 

---

Answer:

73682