Scribd Logo
Upload

Welcome to Scribd!

  • Info

    Uploaded by

    stefan
    5 views3 pages
    The document contains C++ code to generate permutations and combinations of numbers. It uses arrays and loops to increment through the possible combinations, outputting the first 5 solutions to a file. The code is modified in subsequent sections to generate combinations of 5 numbers taken 3 at a time and to avoid duplicate combinations.

    Original Description:

    Exercitiu

    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
    The document contains C++ code to generate permutations and combinations of numbers. It uses arrays and loops to increment through the possible combinations, outputting the first 5 solutions to a file. The code is modified in subsequent sections to generate combinations of 5 numbers taken 3 at a time and to avoid duplicate combinations.

    Copyright:

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

    Info

    Uploaded by

    stefan
    The document contains C++ code to generate permutations and combinations of numbers. It uses arrays and loops to increment through the possible combinations, outputting the first 5 solutions to a file. The code is modified in subsequent sections to generate combinations of 5 numbers taken 3 at a time and to avoid duplicate combinations.

    Copyright:

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

    1.

    Permutari P5
    #include <iostream>
    #include <fstream>

    using namespace std;


    int st[10], n, k, ev, i, nr;

    int main()
    {
    ofstream f("date.out");

    cin >> n;
    k = 1;st[k] = 0;
    do{
    while(st[k]<n){
    ev = 1;st[k]++;
    for(i=1;i<=k-1;i++)
    if(st[k]==st[i])
    ev = 0;
    if(ev == 1)
    if(k == n)
    {
    nr++;
    if(nr<=5){
    for(i=1;i<=k;i++)
    f<<st[i]<< " ";
    f<<endl;}
    }
    else{
    k++;
    st[k] = 0;
    }

    }
    k--;
    }while(k>0);
    f.close();

    return 0;
    }

    2.//Aranjamente de 5 luate cate 3

    #include <iostream>
    #include <fstream>

    using namespace std;


    int st[10], n, k, ev, i, nr, p;

    int main()
    {
    ofstream f("date.out");

    cin >> n;
    cin >> p;
    k = 1;st[k] = 0;
    do{
    while(st[k]<n){
    ev = 1;st[k]++;
    for(i=1;i<=k-1;i++)
    if(st[k]==st[i])
    ev = 0;
    if(ev == 1)
    if(k == p)
    {
    //nr++;
    //if(nr<=5){
    for(i=1;i<=k;i++)
    f<<st[i]<< " ";
    f<<endl;}
    //}
    else{
    k++;
    st[k] = 0;
    }

    }
    k--;
    }while(k>0);
    f.close();

    return 0;
    }
    Primele 5 solutii
    //Aranjamente de 5 luate cate 3

    #include <iostream>
    #include <fstream>

    using namespace std;


    int st[10], n, k, ev, i, nr, p;

    int main()
    {
    ofstream f("date.out");

    cin >> n;
    cin >> p;
    k = 1;st[k] = 0;
    do{
    while(st[k]<n){
    ev = 1;st[k]++;
    for(i=1;i<=k-1;i++)
    if(st[k]==st[i])
    ev = 0;
    if(ev == 1)
    if(k == p)
    {
    nr++;
    if(nr<=5){
    for(i=1;i<=k;i++)
    f<<st[i]<< " ";
    f<<endl;}
    }
    else{
    k++;
    st[k] = 0;
    }
    }
    k--;
    }while(k>0);
    f.close();

    return 0;
    }
    3.Combinari de 5 luate cate 3; primele 5 solutii!

    #include <iostream>
    #include <fstream>

    using namespace std;


    int st[10], n, k, ev, i, nr, p;

    int main()
    {
    ofstream f("date.out");

    cin >> n;
    cin >> p;
    k = 1;st[k] = 0;
    do{
    while(st[k]<n){
    ev = 1;st[k]++;
    for(i=1;i<=k-1;i++)
    if(st[k]<=st[i])
    ev = 0;
    if(ev == 1)
    if(k == p)
    {
    nr++;
    if(nr<=5){
    for(i=1;i<=k;i++)
    f<<st[i]<< " ";
    f<<endl;}
    }
    else{
    k++;
    st[k] = 0;
    }

    }
    k--;
    }while(k>0);
    f.close();

    return 0;
    }

    You might also like