Pagini recente » Cod sursa (job #2654589) | Cod sursa (job #337694) | Cod sursa (job #83435) | Cod sursa (job #2976082) | Cod sursa (job #57717)
Cod sursa(job #57717)
#include<fstream.h>
#include<math.h>
#define max 100002
char x[max];
long m[max][9];
long i,a,b,n;
ifstream f("divprim.in");
ofstream g("divprim.out");
void prime()
{
long c=2,i;
while(c<=sqrt(100000))
{
for(i=2*c;i<=100000;i+=c)
x[i]++;
do{ c++;
}while (x[c]);
}
}
void matrice()
{long k;
for(long i=1;i<=100000;i++)
for(int j=1;j<=7;j++)
{
if(m[i][j-1]==0 && j>=2)
{
for(k=j;k<=7;k++)
m[i][k]=0;
}
else
{
for(k=i;k>=1;k--)
if(x[k]==j)
{
m[i][j]=k;
break;
}
}}
}
int main()
{
prime();
matrice();
f>>n;
for(i=1;i<=n;i++)
{
f>>a;
f>>b;
g<<m[a][b]<<"\n";
}
f.close();
g.close();
return 0;
}