Cod sursa(job #1913944)
Utilizator | Data | 8 martie 2017 14:49:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <iostream>
using namespace std;
int main()
{
int d,n,p;
cin>>n;
d=2;
while(n!=1)
{
if(n%d==0){p=0;
while(n%d==0){n/=d; p++;}
cout<<d<<" la puterea "<<p<<endl;
}
d++;
}
return 0;
}