Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int st[100];
- int m[100]={0,4,5,3}, pret[4][13], kcal[4][13], s, c;
- int n,ev,as;
- ifstream f("date.in");
- void init(int k)
- {
- st[k]=0;
- }
- int succesor(int k)
- {
- if(st[k]<m[k])
- {
- st[k]=st[k]+1;
- return 1;
- }
- else
- return 0;
- }
- int valid(int k)
- {
- return 1;
- }
- int solutie(int k)
- {
- int sum, kcalsum;
- sum=0;kcalsum=0;
- for(int i=1;i<n+1;i++)
- {
- sum+=pret[i][st[i]];
- kcalsum+=kcal[i][st[i]];
- }
- if(sum<=s && kcalsum<=c && k==n)
- return 1;
- else
- return 0;
- }
- void tipar()
- {
- for(int i=1;i<=n;i++)
- cout<<st[i]<<" ";
- cout<<endl;
- }
- void bkt(int k)
- {
- init(k);
- while(succesor(k))
- if(valid(k))
- if(solutie(k))
- tipar();
- else
- bkt(k+1);
- }
- int main()
- {
- n=3;
- f>>s>>c;
- for(int i=1;i<n+1;i++)
- for(int j=1;j<m[i]+1;j++)
- f>>pret[i][j];
- for(int i=1;i<n+1;i++)
- for(int j=1;j<m[i]+1;j++)
- f>>kcal[i][j];
- bkt(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement