Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<math.h>
- using namespace std;
- bool is_Prime(int n){
- if (n==0) return false;
- if (n==1) return false;
- for (int i = 1; i < int(sqrt(n)); i++){
- if (n%i==0) return false;
- }
- return true;
- }
- int gcd(int x,int y){
- if (y==0) return x;
- return gcd(y,x%y);
- }
- int greatestCommonPrimeDivisor(int a, int b)
- {
- }
- int main(){
- int k,i,index,max;
- int p[151];
- int a=121;
- int b=33;
- if (gcd(a,b)==1) return -1;
- k = gcd(a,b);
- index = 0;
- for (i=2;i<=k;i++){
- index++;
- if (k%11==0 && is_Prime(11)==true){
- p[index] = 11;
- }
- }
- for (i=0;i<=k+1;i++){
- // if (p[i] > max) max = p[i];
- cout << p[i];
- }
- cout << max << endl;
- cout << k;
- // cout << greatestCommonPrimeDivisor(12,18);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement