Cod sursa(job #252758)
Utilizator | Data | 4 februarie 2009 21:32:44 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
#include<string>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int main(){
int n,k,nr,i,d,j;
f>>n>>k;
for(i=n;i>=2;i--){
nr=0;
j=i;
d=2;
while(i>1){
if(i%d==0){ nr++; while(i%d==0) i/=d;}
d++;}
if(nr==k) g<<j;}
f.close();
g.close();
return 0;
}