Cod sursa(job #887512)
| Utilizator | Data | 23 februarie 2013 20:33:45 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | leitennine | Marime | 0.5 kb |
#include<fstream>
#define div 1000000
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
int k,p,t,n,i,j,v[1000001][9],a[1000010];
int main()
{
for(i=2;i<=div;++i)
if(a[i]==0)
for(j=i;j<=div;j=j+i)
a[j]++;
for(i=2;i<=div;++i)
if(a[i]<=7)
v[i][a[i]]=i;
for(i=2;i<=div;++i)
for(j=1;j<=8;++j)
if(v[i][j]==0)
v[i][j]=v[i-1][j];
fin>>t;
for(i=1;i<=t;++i)
{
fin>>p>>k;
fout<<v[p][k]<<'\n';
}
return 0;
}