Prime_Factors of two numbers in c++.

 #include <bits/stdc++.h>

using namespace std;
void primefactors(int n){
    while(n%2 == 0){
        cout << 2 << " ";
        n/=2;
    }
    for(int i=3;i<=sqrt(n);i+=2)
    while(n%i == 0){
        cout << i << " ";
        n/=i;
    }
    if(n>2)
    cout << n << " ";
}
int main()
{
    int n ;
    cin >> n;
    primefactors(n);
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Problem——50A. Domino piling——Codeforces

 /* ou are given a rectangular board of M × N squares. Also you are given an unlimited number of standard domino pieces of 2 × 1 squares. You are allowed to rotate the pieces. You are asked to place as many dominoes as possible on the board so as to meet the following conditions: Each domino completely covers two squares. No two dominoes overlap. Each domino lies entirely inside the board. It is allowed to touch the edges of the board. Find the maximum number of dominoes, which can be placed under these restrictions. Input In a single line you are given two integers M and N — board sizes in squares (1 ≤ M ≤ N ≤ 16). Output Output one number — the maximal number of dominoes, which can be placed. */ #include <bits/stdc++.h> using namespace std; int main(){ long int n,m; while(cin >> n >> m){     cout << n*m/2 << endl; }     return 0; }
Read more

Euclid’s lemma

  #include   <bits/stdc++.h> using   namespace   std ; /* If p divides x*y and p is relatively prime to x, then p must divide y. In the above example,  5 is relatively prime to 6, therefore it must divide 15.  */ int   main () { int   a , b , ab , p ; cin   >>   a   >>   b   >>   p ; ab  =  a * b ; if ( ab % p  ==  0 ){      if ( a % p  ==  0  ||  b % p  ==  0 )      cout   <<   "YES \n " ;      else      cout   <<   "NO \n " ; }           return   0 ; }
Read more