Cod sursa(job #1662401)
Utilizator | Data | 24 martie 2016 19:03:05 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int prim(int x)
{
int d;
for(d=2;d<=x/2;d++)
if(x%d==0)
return 0;
return 1;
}
int nrdiv_primi(int n)
{
int d,nr=0;
if(prim(n)==1)
return 1;
for(d=2;d<=n/2;d++)
if(n%d==0&&prim(d)==1)
nr++;
return nr;
}
int main()
{
int t,n,k,i;
f>>t;
while(f>>n>>k)
{
int ok=1;
for(i=n;i>=2&&ok==1;i--)
if(nrdiv_primi(i)==k)
{
g<<i<<endl;
ok=0;
}
if(ok==1)
g<<'0'<<endl;
}
return 0;
}