Cod sursa(job #1512557)
Utilizator | Data | 28 octombrie 2015 11:31:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include<algorithm>
using namespace std;
int main()
{
int x,y,n,d[100],i,a,b;
cin>>x>>y;
n=0;
a=1;
while(a*a<x)
{
if(x%a==0)
{
if(y%a==0)
{
d[n]=a;
n++;
}
b=x/a;
if(y%b==0)
{
d[n]=b;
n++;
}
}
a++;
}
if(a*a==x and y%a==0)
{
d[n]=a;
n++;
}
sort(d,d+n);
for(i=0;i<n;i++)
cout<<d[i]<<" ";
return 0;
}