Cod sursa(job #965519)
Utilizator | Panea Anca Anca_Panea | Data | 24 iunie 2013 01:37:01 |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<fstream>
#define Nmax 1000005
using namespace std;
ifstream eu("divprim.in");
ofstream tu("divprim.out");
int k,p,t,n,i,j,v[Nmax][9],a[Nmax];
int main()
{
for(i=2;i<=Nmax;i++)
if(a[i]==0)
for(j=i;j<=Nmax;j=j+i)
a[j]++;
for(i=2;i<=Nmax;i++)
{
for(j=0;j<=7;j++)
if(a[i]==j)
v[i][j]=i;
else
v[i][j]=v[i-1][j];
}
eu>>t;
for(i=1;i<=t;i++)
{
eu>>p>>k;
tu<<v[p][k]<<'\n';
}
return 0;
}