Equal Sum Sets

Let us consider sets of positive integers less than or equal to n. Note that all elements of a set aredifferent. Also note that the order of elements doesnt matter, that is, both {3, 5, 9} and {5, 9, 3} meanthe same set.Specifying the number of set elements and their sum to be k and s, respectively, sets satisfying theconditions are limited. When n = 9, k = 3 and s = 23, {6, 8, 9} is the only such set. There may bemore than one such set, in general, however. When n = 9, k = 3 and s = 22, both {5, 8, 9} and {6, 7, 9}are possible.You have to write a program that calculates the number of the sets that satisfy the given conditions.InputThe input consists of multiple datasets. The number of datasets does not exceed 100.Each of the datasets has three integers n, k and s in one line, separated by a space. You may assume1 ≤ n ≤ 20, 1 ≤ k ≤ 10 and 1 ≤ s ≤ 155.The end of the input is indicated by a line containing three zeros.OutputThe output for each dataset should be a line containing a single integer that gives the number of thesets that satisfy the conditions. No other characters should appear in the output.You can assume that the number of sets does not exceed 231 − 1.Sample Input9 3 239 3 2210 3 2816 10 10720 8 10220 10 10520 10 1553 4 34 2 110 0 0Sample Output1202015425448100

#include<stdio.h>
#include<string.h>
int vis[50];
int cnt;
int n,s,k;
int vv[50];
int ff(int n)
{
    int sum=1;
    for(int i=1;i<=n;i++)
        sum*=i;
    return sum;
}
void bfs(int step,int sum,int j)
{

    if(step==k)
    {
        if(sum==s)
        {
            cnt++;
//
        }
        return;
    }
    if(sum>s||step>k)
         return;
    for(int i=j;i<=n;i++)
    {
        if(vis[i]==0)
        {
            vis[i]=1;
            vv[step]=i;
            bfs(step+1,sum+i,i+1);
            vis[i]=0;
        }
    }
}
int main()
{

    while(~scanf("%d%d%d",&n,&k,&s),n,k,s)
    {
        cnt=0;
        memset(vis,0,sizeof(vis));
        bfs(0,0,1);

        printf("%d\n",cnt);
    }
    return 0;
}

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
struct node
{
    int step;
    int id;
    int sum;
};

int cnt,n,k,s;
void bfs(int n,int k,int s)
{
   node a;
   int i,j;
   queue<node>q;
   for( i=1;i<=n;i++)
   {
        a.step=1;
       a.id=i;
       a.sum=i;
       q.push(a);
       while(!q.empty())
       {
           node t=q.front();
           q.pop();

           if(t.sum==s&&t.step==k)
           {
               cnt++;
           }


               for(j=t.id+1;j<=n;j++)
               {

                   {
                       node aa=t;
                   aa.step++;
                   aa.id=j;
                   aa.sum+=j;
                   q.push(aa);
                   }

               }


       }

   }

}
int main()
{

    while(~scanf("%d%d%d",&n,&k,&s),n,k,s)
    {
        cnt=0;

        bfs(n,k,s);

        printf("%d\n",cnt);
    }
    return 0;
}