Cod sursa(job #57721)
Utilizator | Data | 2 mai 2007 21:02:23 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<fstream.h>
#include<math.h>
#define max 1000002
char x[max];
long m[max][8];
long i,a,b,n,j;
ifstream f("divprim.in");
ofstream g("divprim.out");
void prime()
{
long c=2,i;
while(c<=sqrt(1000000))
{
for(i=2*c;i<=1000000;i+=c)
x[i]++;
do{ c++;
}
while (x[c]);
}
}
int main()
{
prime();
f>>n;
for(i=1;i<=n;i++)
{
f>>a;
f>>b;
for(j=a;j>=1;j++)
if(x[j]==b)
{
g<<j<<"\n";
break;
}
}
f.close();
g.close();
return 0;
}