Thread: recursion lab exercise

Threaded View

Previous Post Previous Post   Next Post Next Post
  1. #1
    Registered User
    Join Date
    Nov 2019
    Posts
    4

    Question recursion lab exercise

    i need help guys ,i cant find out how to do this programm.
    ------------------------
    Make a program that reads two physical numbers from user (N *
    )
    ,N and S. The program should display all unique numbers
    combinations of N single digits whose sum equals S. Eg.
    for N = 3 and S = 10 the program should display:
    8+1+1=10
    7+2+1=10
    6+3+1=10
    5+4+1=10
    6+2+2=10
    5+3+2=10
    4+4+2=10
    4+3+3=10


    other whice If a number is out of the scope it will display
    "Wrong input".
    Code:
    int digits(N)
    {
        int i,j;
        for (i=1;i<=9;i++)
        {
            for (j=1;i<=N;j++)
            {
                if (i+9<S)
                {
                    
                }
            }
        }
    }
    int sum ()
    {
        if (n==0)
            return 0;
        else
        {
    
    
        }
    }
    
    
    int main()
    {
        int N,S,i;
        scanf("%d,%d",&N,&S);
        
        if (N*9 <= S)
        {
            
        }
        else 
        printf("Wrong Input");
        
        for (i=1;i<=N;i++)
        {
            printf("%d",digits(N));
            printf("+");
        }
        printf("=%d",S);
    
    
        return 0;
    }
    Last edited by Salem; 11-16-2019 at 03:36 AM. Reason: Added code tags

Popular pages Recent additions subscribe to a feed

Similar Threads

  1. Linked list recursion exercise Chapter 16 problem 3
    By Icyblizz in forum C++ Programming
    Replies: 2
    Last Post: 06-24-2017, 02:08 AM
  2. Exercise 1-13 in K&M
    By deckoff8 in forum C Programming
    Replies: 2
    Last Post: 12-02-2011, 07:08 PM
  3. An exercise from K&R
    By GL.Sam in forum C Programming
    Replies: 4
    Last Post: 05-07-2010, 09:31 AM
  4. K&R exercise
    By Tool in forum C Programming
    Replies: 1
    Last Post: 12-05-2009, 09:39 AM

Tags for this Thread