Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <stdlib.h>
- using namespace std;
- int S, tip[100], x[100], n, nrsol, k, s;
- void init(int k)
- {
- x[k]=-1;
- }
- int existaSuccesor(int k)
- {
- return k<=n && x[k]<S/tip[k];
- }
- int cont(int k)
- {
- s=0;
- for(int i=1; i<=k; i++)
- s+=x[i]*tip[i];
- return s<=S;
- }
- int solutie(int k)
- {
- return s==S;
- }
- void tipar()
- {
- nrsol++;
- for(int i=1; i<=n; i++)
- if(x[i])
- cout<<x[i]<<" bancnote de "<<tip[i]<<endl;
- cout<<endl<<endl;
- system("pause");
- }
- void back(int k)
- {
- init(k);
- while(existaSuccesor(k))
- {
- x[k]=x[k]+1;
- if(cont(k))
- if(solutie(k))
- tipar();
- else
- back(k+1);
- }
- }
- int main()
- {
- ifstream f("bac.in");
- cout<<"S="; f>>S;
- cout<<"numarul de tipuri de bancnote: "; f>>n;
- cout<<"valorile bancnotelor: ";
- for(int i=1; i<=n; i++)
- f>>tip[i];
- back(1);
- cout<<"Nr. solutii: "<<nrsol;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement