Scribd Logo
Upload

Welcome to Scribd!

  • 17 views

    Probleme

    Uploaded by

    Teodora Dan
    The document contains code for two C++ programs. The first program reads in an array of integers, finds the minimum and maximum values, and outputs the positions of each value. The second program reads in an array representing a permutation, finds the minimum number of swaps to sort it by swapping elements, and outputs the swap positions.

    Copyright:

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

    You might also like

    Probleme

    Uploaded by

    Teodora Dan
    17 views2 pages
    The document contains code for two C++ programs. The first program reads in an array of integers, finds the minimum and maximum values, and outputs the positions of each value. The second program reads in an array representing a permutation, finds the minimum number of swaps to sort it by swapping elements, and outputs the swap positions.

    Original Description:

    Original Title

    probleme

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains code for two C++ programs. The first program reads in an array of integers, finds the minimum and maximum values, and outputs the positions of each value. The second program reads in an array representing a permutation, finds the minimum number of swaps to sort it by swapping elements, and outputs the swap positions.

    Copyright:

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

    Probleme

    Uploaded by

    Teodora Dan
    The document contains code for two C++ programs. The first program reads in an array of integers, finds the minimum and maximum values, and outputs the positions of each value. The second program reads in an array representing a permutation, finds the minimum number of swaps to sort it by swapping elements, and outputs the swap positions.

    Copyright:

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

    #92

    #include <fstream>
    #include <iostream>

    using namespace std;

    int main()
    {
    int a[1001],n,i,min,max,j;

    ifstream fin("proiecte.in");
    ofstream fout("proiecte.out");

    fin >> n;

    for(i=1;i<=n;i++)
    fin >>a[i];

    min=a[0];
    max=a[0];

    for(i=1;i<=n;i++)
    {
    if(a[i]>max) max=a[i];
    if(a[i]<min) min=a[i];
    }

    for(j=min;j<=max;j++)
    for(i=1;i<=n;i++)
    if (j==a[i])
    fout << i << " ";

    return 0;
    }

    #400

    #include <iostream>
    #include <fstream>

    using namespace std;

    ifstream in("pachete.in");
    ofstream out("pachete.out");

    int v[1005];
    struct rasp
    {
    int poz1,poz2;
    } m[1005];

    int main()
    {
    int n,pozg,c=0;
    in >> n;
    for (int i = 1; i<=n; i++)
    in >> v[i];
    pozg = n+1;
    v[pozg] = 0;
    for (int i = 1; i<=n; i++)
    {
    if (v[i]!=i)
    {
    if (i!=pozg)
    {
    c++;
    swap(v[i],v[pozg]);
    m[c].poz1 = i;
    m[c].poz2 = pozg;
    pozg = i;
    }
    for (int j = 1; j<=n+1; j++)
    if (v[j] == i)
    {
    c++;
    m[c].poz1 = j;
    m[c].poz2 = pozg;
    swap(v[pozg],v[j]);
    pozg = j;
    break;
    }
    }
    }
    out << c << "\n";
    for (int i = 1; i<=c; i++)
    out << m[i].poz1 << " " << m[i].poz2 << "\n";
    }

    You might also like