Cod sursa(job #992241)
Utilizator | Data | 1 septembrie 2013 15:43:27 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
#include <cstdlib>
#define NMAX 1000001
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int m[NMAX][8],prim[NMAX],i,j,n,a,b;
int main()
{
for (i=2;i<=NMAX;++i)
{
if (!prim[i])
for (j=i;j<=NMAX;++prim[j],j+=i);
for (j=1;j<=7;++j)
m[i][j]=m[i-1][j];
m[i][prim[i]]=i;
}
f>>n;
while (n--)
f>>a>>b,g<<m[a][b]<<'\n';
return 0;
}