Cod sursa(job #992258)
Utilizator | Data | 1 septembrie 2013 16:10:00 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
#define NX 1000002
#define FX 1000000
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int m[8][NX],prim[NX],i,j,n,a,b;
int main()
{
for (i=2;i<=FX;m[prim[i]][i]=i,++i)
{
if (!prim[i])
for (j=i;j<=FX;++prim[j],j+=i);
for (j=1;j<=7;m[j][i]=m[j][i-1],++j);
}
f>>n;
while (n--)
f>>a>>b,g<<m[b][a]<<'\n';
return 0;
}