Pagini recente » Cod sursa (job #3260549) | Cod sursa (job #131099) | Cod sursa (job #718867) | Cod sursa (job #1652150) | Cod sursa (job #1340663)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
int i,j,n,k,t,a[1000005][15],b[1000005];
int main()
{
for(i=2;i<=1000000;++i)
if(!b[i])
{for(b[i]=1,j=2*i;j<=1000000;j+=i )
}
for(i=1;i<=1000000;++i)
{
for(j=0;j<=14;++j) a[i][j]=a[i-1][j];
a[i][b[i]]=i};
cin>>t;
while(t--)
cin>>n>>k;
cout<<a[n][k]<<'\n';
return 0;
}