Scribd Logo
Upload

Welcome to Scribd!

  • Descompunere in Factori Primi 2 NR

    Uploaded by

    Mr. Gaby
    7 views1 page
    This C++ program defines a function called "factori" that takes in two integers, n and m, as parameters. The factori function finds the common prime factors between n and m and returns the number of common factors. It uses a while loop to iterate from 2 up to n and m, checking if each number is divisible by i using the modulo (%) operator. It counts the occurrences of each factor in n and m, and prints any factors that are common between the two numbers. The main function prompts the user to input two numbers, calls the factori function on them, and prints the return value, which is the number of common factors.

    Original Description:

    Original Title

    Descompunere in Factori Primi 2 Nr

    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 called "factori" that takes in two integers, n and m, as parameters. The factori function finds the common prime factors between n and m and returns the number of common factors. It uses a while loop to iterate from 2 up to n and m, checking if each number is divisible by i using the modulo (%) operator. It counts the occurrences of each factor in n and m, and prints any factors that are common between the two numbers. The main function prompts the user to input two numbers, calls the factori function on them, and prints the return value, which is the number of common factors.

    Copyright:

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

    Descompunere in Factori Primi 2 NR

    Uploaded by

    Mr. Gaby
    This C++ program defines a function called "factori" that takes in two integers, n and m, as parameters. The factori function finds the common prime factors between n and m and returns the number of common factors. It uses a while loop to iterate from 2 up to n and m, checking if each number is divisible by i using the modulo (%) operator. It counts the occurrences of each factor in n and m, and prints any factors that are common between the two numbers. The main function prompts the user to input two numbers, calls the factori function on them, and prints the return value, which is the number of common factors.

    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;


    DESCOMPUNERI FACTORI PRIMI 2 NUMERE:
    int factori(int n, int m)
    {
    int nr=0,i=2,p,pp;
    while(n!=1 && m!=1)
    { if(n%i==0 && m%i==0)
    {
    p=0;
    while(n%i==0){
    p++;
    n=n/i;}
    pp=0;
    while(m%i==0){
    pp++;
    m=m/i;}
    if(p==pp){
    nr++;
    cout<<i<<" ";}
    }
    else
    {
    while(n%i==0)
    n=n/i;
    while(m%i==0)
    m=m/i;
    }

    i++;
    }
    cout<<endl;
    return nr;
    }

    int main()
    {
    int n, m;
    cin>>n>>m;
    cout<<factori(n,m);
    }

    You might also like