Scribd Logo
Upload

Welcome to Scribd!

  • BK Combinari

    Uploaded by

    Cristina Ungurean
    12 views1 page
    This C program uses backtracking to generate and print all combinations of numbers from 1 to m taken n at a time. It takes user input for m and n, initializes an array a of size n to store the combinations, defines a function combinari to recursively generate combinations by trying all numbers from 1 to m at each index k, and a function tipareste to print the combinations. The main function gets m and n from user, calls combinari to generate the first combination, and waits for input before exiting.

    Original Description:

    Original Title

    Bk combinari.txt

    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 generate and print all combinations of numbers from 1 to m taken n at a time. It takes user input for m and n, initializes an array a of size n to store the combinations, defines a function combinari to recursively generate combinations by trying all numbers from 1 to m at each index k, and a function tipareste to print the combinations. The main function gets m and n from user, calls combinari to generate the first combination, and waits for input before exiting.

    Copyright:

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

    BK Combinari

    Uploaded by

    Cristina Ungurean
    This C program uses backtracking to generate and print all combinations of numbers from 1 to m taken n at a time. It takes user input for m and n, initializes an array a of size n to store the combinations, defines a function combinari to recursively generate combinations by trying all numbers from 1 to m at each index k, and a function tipareste to print the combinations. The main function gets m and n from user, calls combinari to generate the first combination, and waits for input before exiting.

    Copyright:

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

    Backtracking combinari

    #include<stdio.h>
    #include<conio.h>
    int m,n,a[20];
    void tipareste(void)
    {
    int i;
    for(i=0;i<n;i++) printf("%d",a[i]+1);
    putchar('\n');
    }
    void combinari(int k)
    {
    int i;
    for(i=0;i<m;i++) { a[k]=i;
    if((k==0)||(a[k]>a[k-1]))
    if(k==n-1) tipareste();
    else combinari(k+1); }
    }
    void main(void)
    {
    clrscr();
    printf("introdu pe m: ");
    scanf("%d",&m);
    printf("introdu pe n: ");
    scanf("%d",&n);
    combinari(0);
    getch();
    }

    You might also like