Cod sursa(job #61245)
Utilizator | Gabriel Bitis gabitzish1 | Data | 18 mai 2007 18:44:20 |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream.h>
long long t, n, k;
*c=new int[1000004];
ifstream in("divprim.in");
ofstream out("divprim.out");
void ciur(int n)
{
int i, j;
for (i=2; i<=n; i++)
{
if (c[i]==0)
{
for (j=2*i; j<=n; j+=i)
c[j]++;
}
}
}
void calcul()
{
int j;
in>>n>>k;
for (j=n; j>=1; j--)
if (c[j]==k) break;
out<<j<<'\n';
}
int main()
{
in>>t;
int i, j;
ciur(1000004);
for (i=1; i<=t; i++) calcul();
in.close();
out.close();
return 0;
}