Pagini recente » Cod sursa (job #2518478) | Cod sursa (job #4684) | Cod sursa (job #1906848) | Cod sursa (job #3194451) | Cod sursa (job #1101662)
#include<fstream>
using namespace std;
int n,k,t,i,ok,z;
ifstream f("divprim.in");
ofstream g("divprim.out");
int div(int x)
{
int i,j,a[x],con=0;
for(i=1;i<=x;i++)
a[i]=0;
for(i=2;i<=x;i++)
if(a[i]==0)
{
for(j=i+i;j<=x;j++)
a[j]=1;
}
for(i=2;i<=x&&x>1;i++)
{
if(a[i]==0&&x%i==0)
con++;
while(x%i==0)
x/=i;
}
return con;
}
int main()
{
f>>t;
for(z=1;z<=t;z++)
{
f>>n>>k;
ok=1;
for(i=n;i>=1&&ok==1;i--)
if(div(i)==k)
{
ok=0;
g<<i<<"\n";
}
if(ok==1)
g<<0<<"\n";
}
return 0;
}