Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    Problema 7

    Uploaded by

    Palii Marian
    This C++ program uses backtracking to solve the knapsack problem. It takes input of item names, weights and costs, and finds the combination of items that maximizes total cost without exceeding weight capacity. The main function calls methods to read input, perform backtracking search, find optimal solution, and output results. Backtracking recursively tries including or excluding each item, validates the partial solution weight, and records the best full solution found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Problema 7

    Uploaded by

    Palii Marian
    2 views1 page
    This C++ program uses backtracking to solve the knapsack problem. It takes input of item names, weights and costs, and finds the combination of items that maximizes total cost without exceeding weight capacity. The main function calls methods to read input, perform backtracking search, find optimal solution, and output results. Backtracking recursively tries including or excluding each item, validates the partial solution weight, and records the best full solution found.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ program uses backtracking to solve the knapsack problem. It takes input of item names, weights and costs, and finds the combination of items that maximizes total cost without exceeding weight capacity. The main function calls methods to read input, perform backtracking search, find optimal solution, and output results. Backtracking recursively tries including or excluding each item, validates the partial solution weight, and records the best full solution found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    2 views1 page

    Problema 7

    Uploaded by

    Palii Marian
    This C++ program uses backtracking to solve the knapsack problem. It takes input of item names, weights and costs, and finds the combination of items that maximizes total cost without exceeding weight capacity. The main function calls methods to read input, perform backtracking search, find optimal solution, and output results. Backtracking recursively tries including or excluding each item, validates the partial solution weight, and records the best full solution found.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    #include <stdio.

    h>
    #include <iostream.h>
    #include <fstream.h>
    #define MAX 20
    int n,v[MAX],sol_max[MAX],g[MAX],c[MAX],s,s_max,G,gr,nr_sol;
    char nume[MAX][MAX];
    void back(int k);
    int valid(int k);
    void optim();
    void citire();
    void afisare();
    main()
    {citire();
    back(1);
    afisare();
    }
    void back(int k)
    { int i;
    for(i=0;i<=1;i++)
    {v[k]=i;
    if (valid(k))
    if (k==n) optim();
    else back(k+1); }
    }
    int valid(int k)
    { gr=0;
    for(int j=1;j<=k;j++)
    gr=gr+v[j]*g[j];
    if(gr<=G) return 1 ;
    else return 0;
    }
    void optim()
    {int s=0; nr_sol++;
    for(int j=1;j<=n;j++)
    s=s+v[j]*c[j];
    {s_max=s;
    for(j=1;j<=n;j++)
    sol_max[j]=v[j];
    }
    }
    void citire()
    { ifstream f("RUCSAC.IN");
    f>>n>>G; //n-nr. obiecte, G-greutatea maxima
    for (int i=1;i<=n;i++)
    f>>nume[i]>>g[i]>>c[i];
    f.close();
    }
    void afisare()
    { nr_sol++;
    cout<<"Castigul maxim:"<<s_max<<"\n";
    for (int j=1;j<=n;j++)
    if(sol_max[j]) cout<<nume[j]<<" "<<g[j]<<" "<<c[j]<<endl;
    cout<<"\n";
    }

    You might also like