Cod sursa(job #208309)
Utilizator | Data | 15 septembrie 2008 19:26:27 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
using namespace std;
#include<fstream>
int main()
{
ifstream in("divprim.in");
ofstream out("divprim.out");
int N, T, K, ndiv=0, i, x;
in>>T;
for( ;T>0;T--)
{
in>>N>>K;
for( ;N && ndiv!=K;N--)
{
x=N;i=2;ndiv=0;
while(x!=1)
{
if(!(x%i))
ndiv++;
while(!(x%i))
x/=i;
i++;
}
if (ndiv==K)
out<<N<<'\n';
}
if(!N)
out<<0<<'\n';
}
in.close();out.close();
return 0;
}