Scribd Logo
Upload

Welcome to Scribd!

  • Prob Numarare

    Uploaded by

    Vlad Armeanu
    8 views1 page
    This C++ program defines a function contor() that counts the number of divisors of an integer n using nested for loops. It then defines a function numarare() that counts the number of numbers between limits a and b that have exactly 3 divisors, by calling contor() and incrementing a counter. The main() function takes in two integers as input, calls numarare() to count numbers with 3 divisors between those limits, and outputs the final count.

    Original Description:

    Original Title

    prob numarare.txt

    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++ program defines a function contor() that counts the number of divisors of an integer n using nested for loops. It then defines a function numarare() that counts the number of numbers between limits a and b that have exactly 3 divisors, by calling contor() and incrementing a counter. The main() function takes in two integers as input, calls numarare() to count numbers with 3 divisors between those limits, and outputs the final count.

    Copyright:

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

    Prob Numarare

    Uploaded by

    Vlad Armeanu
    This C++ program defines a function contor() that counts the number of divisors of an integer n using nested for loops. It then defines a function numarare() that counts the number of numbers between limits a and b that have exactly 3 divisors, by calling contor() and incrementing a counter. The main() function takes in two integers as input, calls numarare() to count numbers with 3 divisors between those limits, and outputs the final count.

    Copyright:

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

    #include <iostream>

    using namespace std;

    int contor(int n){


    int cnt=0;
    for(int d =1 ; d * d <= n ; d ++ )
    if(n % d == 0)
    {
    ++cnt;
    if(d * d < n)
    ++cnt;
    }
    return cnt;
    }
    void numarare(int a, int b){
    int cnt = 0;
    for(int i=a; i<=b; ++i){
    if(contor(i) == 3)
    ++cnt;
    }
    cout << cnt;
    }

    int a[100][100],v[1001];
    int main(){
    int n,d;
    cin >> n >> d;
    numarare(n,d);
    }

    You might also like