ATM (Basic Recursion)

#include <iostream>
#include <vector>
using namespace std;
vector<int> x={5,10,50,100,200,100};
int y = 250;
int find(int i, int sum){
-if( i == x.size())
--return sum==y ? 0 : 1<<30 ;
-int a = find(i+1 , sum + x[i]) + 1;
-int b = find(i+1 , sum );
-return a < b ? a : b ;
}
int main() {
-cout<< find(0,0) <<endl;
}