Scribd Logo
Upload

Welcome to Scribd!

  • Exercicio 1

    Uploaded by

    Fernando Eugênio
    5 views3 pages
    The document contains C++ code to read in integers, sort and store them in a vector, print the sorted vector, then generate and print all permutations of the vector. It initializes a vector to store integers, uses a loop to read integers into the vector until zero is entered, sorts the vector, prints the sorted contents, then uses next_permutation to iteratively generate and print all permutations of the vector before clearing it to read the next set of integers.

    Original Description:

    Original Title

    Exercicio 1.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, 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 read in integers, sort and store them in a vector, print the sorted vector, then generate and print all permutations of the vector. It initializes a vector to store integers, uses a loop to read integers into the vector until zero is entered, sorts the vector, prints the sorted contents, then uses next_permutation to iteratively generate and print all permutations of the vector before clearing it to read the next set of integers.

    Copyright:

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

    Exercicio 1

    Uploaded by

    Fernando Eugênio
    The document contains C++ code to read in integers, sort and store them in a vector, print the sorted vector, then generate and print all permutations of the vector. It initializes a vector to store integers, uses a loop to read integers into the vector until zero is entered, sorts the vector, prints the sorted contents, then uses next_permutation to iteratively generate and print all permutations of the vector before clearing it to read the next set of integers.

    Copyright:

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

    #include <vector>

    #include <cstdio>
    #include<algorithm>

    #define PB push_back

    using namespace std;

    int main(){

    int n;

    vector<int> v;

    int a;

    bool blank = false;


    while(scanf("%d",&n) && n != 0){

    if(blank)

    printf("\n");

    for(int i = 0; i < n; i++){

    scanf("%d",&a);

    v.PB(a);

    sort(v.begin(),v.end());

    for(int i = 0; i < n; i++)

    printf("%d ",v[i]);

    printf("\n");

    while(next_permutation(v.begin(),v.end())){
    for(int i = 0; i < n; i++)

    printf("%d ",v[i]);

    printf("\n");

    blank = true;

    v.clear();

    You might also like