Pagini recente » Cod sursa (job #3130644) | Cod sursa (job #1696447) | Cod sursa (job #2771806) | Cod sursa (job #963938) | Cod sursa (job #337558)
Cod sursa(job #337558)
#include <fstream>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
#define Max 1000000
int n,k,t,v[Max],sol[Max][8];
int find_nr (int n, int k)
{
for (int i=n; i>=1; i--)
if (v[i]==k)
return i;
return 0;
}
void precompute ()
{
for (int i=2; i<=Max; i++)
if (v[i]==0)
for (int j=i; j<=Max; j += i )
v[j]++;
for (int i=1; i<=Max; i++)
for (int j=1; j<=7; j++)
{
if (v[i]==j)
sol[i][j]=i;
else sol[i][j]=sol[i-1][j];
}
}
int main ()
{
precompute ();
f>>t;
for (int i=1; i<=t; i++)
{
f>>n>>k;
g<<sol[n][k]<<'\n';
}
f.close (); g.close ();
return 0;
}