Wednesday, 1 February 2017

Geeksforgeeks Solution For " Common Divisors "

GeeksforGeeks Solution For School Domain .Below You Can Find The Solution Of Basic ,Easy ,Medium ,Hard .You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Given two integer numbers, the task is to find count of all common divisors of given numbers?
Input : a = 12, b = 24
Output: 6
// all common divisors are 1, 2, 3, 
// 4, 6 and 12

Input : a = 3, b = 17
Output: 1
// all common divisors are 1

Input : a = 20, b = 36
Output: 3
// all common divisors are 1, 2, 4

Submit Your Solution Click Here 

Solution :-

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n,i,k,j,res=0;
        cin>>n>>k;
        for(i=1,j=1;i<=n/2||i<=k/2;i++,j++)
        {
        if(n%i==0 && k%j==0)
        res++;
}

    cout<<res<<endl;
    }
    return 0;
}

Output :-

Geeksforgeeks Solution For " Common Divisors "

No comments:
Write comments

Recommended Posts × +