Cod sursa(job #2509390)
| Utilizator | Data | 14 decembrie 2019 10:43:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.77 kb |
#include <iostream>
using namespace std;
int prim (int n)
{
int i,gogu=0;
if(n<=1)
return 0;
else
{
for(i=2; i*i<=n; i++)
{
if(n%i==0)
{
i=n;
gogu=1;
}
}
if(gogu==0)
return 1;
else
return 0;
}
}
int main()
{
int n,i,h=0,s=0;
cin>>n;
l=0;
for(i=2;i<=n;i++)
{
if(n%i==0 && prim(i)==1)
{
if(h==0)
{
cout<<i;
h=1;
}
else
cout<<"*"<<i;
n=n/i;
i--;
d=i;
l++;
}
}
return 0;
}
