Scribd Logo
Upload

Welcome to Scribd!

  • Subprograme 5

    Uploaded by

    The Rebel Hunter
    8 views3 pages
    The document contains C++ code for several functions: - A sub function that counts the number of occurrences of a value in an array - A main function that reads data from a file, calls sub to check for occurrences, and writes results to a file - The code is split into multiple code blocks that suggest it is testing or demonstrating the sub function for different test cases and conditions

    Original Description:

    Original Title

    SUBPROGRAME 5

    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 for several functions: - A sub function that counts the number of occurrences of a value in an array - A main function that reads data from a file, calls sub to check for occurrences, and writes results to a file - The code is split into multiple code blocks that suggest it is testing or demonstrating the sub function for different test cases and conditions

    Copyright:

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

    Subprograme 5

    Uploaded by

    The Rebel Hunter
    The document contains C++ code for several functions: - A sub function that counts the number of occurrences of a value in an array - A main function that reads data from a file, calls sub to check for occurrences, and writes results to a file - The code is split into multiple code blocks that suggest it is testing or demonstrating the sub function for different test cases and conditions

    Copyright:

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

    pb 579

    #include <iostream>
    #include <fstream>
    using namespace std;
    ifstream f("date.in");
    ofstream g("date.out");
    int n,i,v[100],m,j,a,x,p,u,z,ok,maxi,k,w[100],nr;
    int sub(int v[100], int n, int x)
    {
    int nr=0,i;
    for(i=1; i<=n; i++)
    if(v[i]==x)
    nr++;
    return nr;
    }
    int main()
    {
    f>>n;
    for(i=1; i<=n; i++)
    f>>v[i];
    f>>x;
    if(sub(v,n,x)>0)
    g<<"DA";
    else g<<"NU";
    g<<endl;
    ok=1;
    for(i=1; i<=n; i++)
    if(sub(v,n,v[i])>1)
    ok=0;
    if(ok==1) g<<"DISTINCTE";
    else g<<"NEDISTINCTE";
    g<<endl;
    for(i=1; i<=n; i++)
    w[i]=v[i];
    m=n;
    for(i=1; i<=n; i++)
    if(sub(v,n,v[i])>maxi)
    maxi=sub(v,n,v[i]);
    for(i=1; i<=n; i++)
    if(sub(v,n,v[i])==maxi)
    {
    g<<v[i]<<" ";
    for(j=i+1; j<=n; j++)
    if(v[i]==v[j])
    {
    for(k=j; k<n; k++)
    v[k]=v[k+1];
    n--;
    j--;
    }
    }
    g<<endl<<endl<<endl;

    for(i=1; i<=m; i++)


    {
    nr=1;
    for(j=i+1; j<=m; j++)
    if(w[i]==w[j])
    nr++;
    g<<w[i]<<" "<<nr<<endl;
    for(j=i+1; j<=m; j++)
    if(w[i]==w[j])
    {
    for(k=j; k<m; k++)
    w[k]=w[k+1];
    m--;
    j--;
    }
    }

    return 0;
    }

    pb 580
    #include <iostream>
    #include <fstream>
    using namespace std;
    ifstream f("date.in");
    ofstream g("date.out");
    int n,i,v[100],m,j,a[100],b[100],x,p,u,z,ok,maxi,k,w[100],nr;
    int sub(int v[100], int n, int x)
    {
    int nr=0,i;
    for(i=1; i<=n; i++)
    if(v[i]==x)
    nr++;
    return nr;
    }
    int main()
    {
    f>>n;
    for(i=1;i<=n;i++)
    f>>a[i];
    for(i=1;i<=n;i++)
    f>>b[i];
    ok=1;
    for(i=1;i<=n;i++)
    if(sub(a,n,a[i])!=sub(b,n,a[i]))
    ok=0;
    if(ok==1) g<<"DA";
    else g<<"NU";

    return 0;
    }

    pb 581
    #include <iostream>
    #include <fstream>
    using namespace std;
    ifstream f("date.in");
    ofstream g("date.out");
    int n,i,v[100],s,m,j,a[100],b[100],x,p,u,z,ok,maxi,k,w[100],nr;
    int sub(int v[100], int n, int x)
    {
    int nr=0,i;
    for(i=1; i<=n; i++)
    if(v[i]<x)
    nr++;
    return nr;
    }
    int main()
    {
    f>>n;
    for(i=1;i<=n;i++)
    f>>v[i];
    for(i=1;i<=n;i++)
    s=s+sub(v,n,v[i]);
    if(s==n*(n-1)/2)
    g<<"DISTINCTE";
    else g<<"NEDISTINCTE";
    g<<endl;
    for(i=1;i<=n;i++)
    if(sub(v,n,v[i])==0) g<<v[i];
    g<<endl;
    for(i=1;i<=n;i++)
    if(sub(v,n,v[i])==n-1) g<<v[i];

    return 0;
    }

    pb 582
    #include <iostream>
    #include <fstream>
    using namespace std;
    ifstream f("date.in");
    ofstream g("date.out");
    int n,i,v[100],s,m,j,a[100],b[100],x,p,u,z,ok,maxi,k,w[100],nr;
    int poz(int v[100],int n,int x){
    int i=1;
    while(v[i]<x && i<=n)
    i++;
    if(i<=n) return i;
    else return -1;
    }
    void inserare(int v[100], int &n, int p, int x)
    {
    int i;
    n++;
    for(i=n;i>p;i--)
    v[i]=v[i-1];
    v[p]=x;
    }
    int main()
    {

    return 0;
    }

    You might also like