Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 29 views

    Subprograme: Varianta 80

    Uploaded by

    Florin Chiritoiu
    The document contains code snippets for several C++ programs that perform various tasks related to numbers and strings: 1. The first program finds the largest prime factor of a given number. 2. The second program replaces occurrences of one digit with another in a given number. 3. The third program finds the largest digit in a given number. 4. Further programs sort numbers from a file and print unique numbers from a file.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Subprograme: Varianta 80

    Uploaded by

    Florin Chiritoiu
    29 views7 pages
    The document contains code snippets for several C++ programs that perform various tasks related to numbers and strings: 1. The first program finds the largest prime factor of a given number. 2. The second program replaces occurrences of one digit with another in a given number. 3. The third program finds the largest digit in a given number. 4. Further programs sort numbers from a file and print unique numbers from a file.

    Original Title

    Tema

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains code snippets for several C++ programs that perform various tasks related to numbers and strings: 1. The first program finds the largest prime factor of a given number. 2. The second program replaces occurrences of one digit with another in a given number. 3. The third program finds the largest digit in a given number. 4. Further programs sort numbers from a file and print unique numbers from a file.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    29 views7 pages

    Subprograme: Varianta 80

    Uploaded by

    Florin Chiritoiu
    The document contains code snippets for several C++ programs that perform various tasks related to numbers and strings: 1. The first program finds the largest prime factor of a given number. 2. The second program replaces occurrences of one digit with another in a given number. 3. The third program finds the largest digit in a given number. 4. Further programs sort numbers from a file and print unique numbers from a file.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 7

    Subprograme

    Varianta 80
    #include <iostream>

    using namespace std;

    void divi(unsigned long n,unsigned long &d)

    unsigned long f,p;

    f=2;

    d=10000;

    while(n>1)

    p=0;

    while(n%f==0)

    n=n/f;

    p=p+1;

    if(p>0 && d>f)

    d=f;

    f++;

    int main()

    unsigned long n,d;

    cin>>n;

    divi(n,d);

    cout<<d;
    return 0;

    Varianta 86:
    #include <iostream>
    using namespace std;
    void numar(unsigned long &n,unsigned c1,unsigned c2)
    {
    unsigned long c,p,copie;
    c=0;
    p=1;
    copie=n;
    while(n>0)
    {
    if(n%10==c1)
    {
    c=c2p+c;
    p=p10;
    n=n/10;
    cout<<c<<endl;
    }
    else
    {
    c=c+p(n%10);
    n=n/10;
    p=p10;
    cout<<c<<endl;
    }
    }
    if(c!=0)
    n=c;
    else n=copie;
    }
    int main()
    {
    unsigned long n;
    unsigned c1,c2;
    cin>>n>>c1>>c2;
    numar(n,c1,c2);
    cout<<n;
    return 0;
    }

    Varianta 74:
    #include <iostream>
    using namespace std;
    void Cifra(unsigned long n,unsigned &x)
    {
    x=0;
    while(n>0)
    {
    if(n%10>x)
    x=n%10;
    n=n/10;
    }
    }
    int main()
    {
    unsigned long n;
    unsigned x;
    cin>>n;
    Cifra(n,x);
    cout<<x;
    return 0;
    }

    Siruri de caractere
    Varianta 3.
    #include <iostream>
    #include <fstream>
    using namespace std;

    int main()
    {
    int v[100],n=0,x,i,j,aux;
    ifstream f("NR.TXT");
    while(f>>x)
    {
    if(x>0)
    {
    v[n]=x;
    n=n+1;
    }
    }
    if(n==0)
    cout<<"nu exista";
    else
    for(i=0;i<n-1;i++)
    for(j=i+1;j<n;j++)
    if(v[i]>v[j])
    {
    aux=v[i];
    v[i]=v[j];
    v[j]=aux;
    }
    for(i=0;i<=n-1;i++)
    cout<<v[i]<<' ';
    return 0;
    }

    Varianta 45
    #include <iostream>
    #include <fstream>
    using namespace std;
    ifstream f("numere.txt");
    short n,i,v[100], num;
    int main()
    {
       f >> n;
       for (i=1; i<=n; ++i)
       {
           f >> num;
           v[num]=1;
       }
       for (num=0; num<100; ++num)
           if (v[num]==1) cout << num << " ";
    Varianta 16
    #include <iostream>
    #include <fstream>
    using namespace std;
    unsigned v[10];
    int main()
    {
        ifstream fin ("numere.txt");
        unsigned long n; int i;
        while (fin>>n)
        {
            while (n)
            {
                v[n%10]++;
                n/=10;
            }
        }
        for (i=9;i>-1;i--)
        {
            if (v[i]!=0)
            {
                while (v[i]>0)
                {
                    cout<<i;
                    v[i]--;
                }
            }
        }
        fin.close ();
        return 0;
    }

    You might also like