Pagini recente » Cod sursa (job #3141768) | Cod sursa (job #1814985) | Cod sursa (job #859665) | Cod sursa (job #76434) | Cod sursa (job #236133)
Cod sursa(job #236133)
#include<fstream.h>
#define nmax 1000001
#define mmax 1001
int sol[nmax];
long t,i,j,a,b,max,x[mmax][mmax];
int main()
{
ifstream f("divprim.in");
ofstream g("divprim.out");
f>>t;
for(i=1;i<=t;i++)
{ f>>a>>b;
if(a>max) max=a;
}
for(i=2;i<=max;i++)
if(sol[i]==0)
for(j=i;j<=max;j=j+i)
sol[j]++;
f.close();
f.open("divprim.in");
for(i=2;i<=max;i++)
{
x[sol[i]][x[sol[i]][0]+1]=i;
x[sol[i]][0]++;
}
f>>t;
for(i=1;i<=t;i++)
{
f>>a>>b;
j=1;
while(j<=x[b][0])
if(x[b][j]<a)
while(x[b][j]<a&&j<=x[b][0])
j++;
else
break;
g<<x[b][j-1]<<"\n";
}
return 0;
}