Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Poezie Tudor Arghezii Adam & Eva

    Uploaded by

    Andrei Haiduc
    This C++ code snippet contains comments describing code to: 1) Count the occurrences of each digit (0-9) in a string input by the user. 2) Find the most frequently occurring digit and output it, or output "NU" if no digit occurs more than once.

    Copyright:

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

    You might also like

    Poezie Tudor Arghezii Adam & Eva

    Uploaded by

    Andrei Haiduc
    3 views1 page
    This C++ code snippet contains comments describing code to: 1) Count the occurrences of each digit (0-9) in a string input by the user. 2) Find the most frequently occurring digit and output it, or output "NU" if no digit occurs more than once.

    Original Description:

    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
    This C++ code snippet contains comments describing code to: 1) Count the occurrences of each digit (0-9) in a string input by the user. 2) Find the most frequently occurring digit and output it, or output "NU" if no digit occurs more than once.

    Copyright:

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

    Poezie Tudor Arghezii Adam & Eva

    Uploaded by

    Andrei Haiduc
    This C++ code snippet contains comments describing code to: 1) Count the occurrences of each digit (0-9) in a string input by the user. 2) Find the most frequently occurring digit and output it, or output "NU" if no digit occurs more than once.

    Copyright:

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

    #include <iostream>

    #include <cstring>
    using namespace std;
    /*int vf[11],i,maxx=0,j,ok;
    char s[300];
    int main() {
    cin.getline(s,300);
    while (s[i]!='\0')
    {
    if (s[i]=='0')
    vf[0]++;
    if (s[i]=='1')
    vf[1]++;
    if (s[i]=='2')
    vf[2]++;
    if (s[i]=='3')
    vf[3]++;
    if (s[i]=='4')
    vf[4]++;
    if (s[i]=='5')
    vf[5]++;
    if (s[i]=='6')
    vf[6]++;
    if (s[i]=='7')
    vf[7]++;
    if (s[i]=='8')
    vf[8]++;
    if (s[i]=='9')
    vf[9]++;
    i++;
    }
    for (j=0;j<=10;j++)
    if (vf[j]>maxx){
    maxx=vf[j],
    ok=j;
    }
    if (ok==0)
    cout<<"NU";
    else cout<<ok;
    return 0;
    }
    */

    /*cin.get(s1,21);
    cin.get(s2,21);
    for(i=0;i<=strlen(s2)-1;i++)
    if(!strchr(voc,s2[i]))
    x[j++]=s2[i];
    x[j++]=' ';
    for(i=0;i<=strlen(s1)-1;i++)
    x[j++]=s1[i];
    x[j]='\0';
    cout<<x;
    */

    You might also like