Scribd Logo
Upload

Welcome to Scribd!

  • Problema Colorarii Hartii

    Uploaded by

    dimix
    10 views2 pages
    This document contains C++ code to generate and display all possible combinations of numbers in an array that satisfy certain constraints. It includes functions to increment the next element in the array, check if the combination is valid based on adjacency rules in a 2D matrix, and display the combination. The main function takes input for the number of elements, initializes the adjacency matrix, and uses a recursive backtracking approach to iterate through all valid combinations.

    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 document contains C++ code to generate and display all possible combinations of numbers in an array that satisfy certain constraints. It includes functions to increment the next element in the array, check if the combination is valid based on adjacency rules in a 2D matrix, and display the combination. The main function takes input for the number of elements, initializes the adjacency matrix, and uses a recursive backtracking approach to iterate through all valid combinations.

    Copyright:

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

    Problema Colorarii Hartii

    Uploaded by

    dimix
    This document contains C++ code to generate and display all possible combinations of numbers in an array that satisfy certain constraints. It includes functions to increment the next element in the array, check if the combination is valid based on adjacency rules in a 2D matrix, and display the combination. The main function takes input for the number of elements, initializes the adjacency matrix, and uses a recursive backtracking approach to iterate through all valid combinations.

    Copyright:

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

    #include<iostream.

    h>
    #include<math.h>
    typedef int sir[100];
    sir x;
    int m,i,k,n,j;
    int as,ev;
    int a[100][100];
    void succ(sir x, int k, int &as)
    {
    if(x[k]<n)
    {
    as=1;
    x[k]=x[k]+1;
    }
    else as=0;
    }
    void valid(sir x, int k, int &ev)
    {
    ev =1;
    for(i=1;i<=k-1;i++)
    if((a[k][i]==1)&&(x[k]==x[i]))
    ev=0;
    }
    void afis(sir x,int k)
    {
    int i;
    for(i=1;i<=k;i++)
    cout<<x[i]<<" ";
    cout<<endl;
    }
    Se verifică dacă ai,k=1 atunci
    xk¹xi, unde i=1,...k-1
    int main(void)
    {
    cout<<"Dati numarul de tari:";
    cin>>n;
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    {
    cin>>a[i][j];
    a[j][i]=a[i][j];
    }
    k=1;
    x[k]=0;
    while(k>0)
    {
    do
    {
    succ(x,k,as);
    if(as) valid(x,k,ev);
    }
    while(as&&!ev);
    if(as)
    if(k==n) afis(x,k);
    else
    {
    k=k+1; x[k]=0;
    }
    else k=k-1;
    }
    }

    You might also like