0

I am given a number n and a number b.
i have n products and for each product a grade like 'e' for electronics or 'f' for food.
I must show only the products with a number of grades smaller or equal to my given b
It's like:
n=4
b=1
grades: 'e' 'f' 'f' 'e'
The result will be:
1
1 2
1 3
2
2 4
3
3 4
4

Please help :D Or ask for more info's.
I started with a basic subset program using backtracking:

#include<iostream.h>
#include<fstream.h>
ifstream f("magazin.in");
ofstream g("magazin.out");
int st[100],n,b;
int gr[100];
int valid(int p)
{
        // here comes a condition    
    return 1;
}
void back(int k)
{
    int i,j;
    for(i=st[k-1]+1;i<=n;i++)
    {
        st[k]=i;
        if(valid(k)==1)

        {
            for(j=1;j<=k;j++)
                g<<st[j]<<" ";
            g<<endl;
        }
                back(k+1);
    }
}
int main()
{
    f>>n;
    f>>b;
    for(int i=1;i<=n;i++)
        f>>gr[i];

    back(1);
    return 0;
}

Edited by happygeek: Moved from C to C++ forum

1
Contributor
1
Reply
16
Views
4 Years
Discussion Span
Last Post by untitled69
This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.