Pagini recente » Cod sursa (job #1060955) | Cod sursa (job #2811177) | Cod sursa (job #2696909) | Cod sursa (job #1642187) | Cod sursa (job #670267)
Cod sursa(job #670267)
#include <fstream>
using namespace std;
int cr[1000001],v[8][1000001];
int main() {
ifstream f("divprim.in");
ofstream g("divprim.out");
int i,j,t,k,p;
for (i=2; i<=1000000; i++)
if (!cr[i]) {
j=1;
while (i*j<=1000000) {
cr[i*j]+=1;
j++;
}
}
for (i=2; i<=1000000; i++) {
for (j=0; j<=7; j++)
v[j][i]=v[j][i-1];
if (cr[i]<=7)
v[cr[i]][i]=i;
}
f>>t;
for (i=1; i<=t; i++) {
f>>p>>k;
g<<v[k][p]<<'\n';
}
g.close();
return 0;
}