Pagini recente » Cod sursa (job #895114) | Cod sursa (job #2580545) | Cod sursa (job #2284676) | Solutii preONI 2007, Runda 4 | Cod sursa (job #1340170)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
int i,j,a[1000005][15],b[1000005],n,k,t;
int main()
{
for(i=2; i<=1000000; ++i)
if(!b[i])
{
for(b[i]=1,j=2*i; j<=1000000; j+=i)
++b[j];
}
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;
}