Cod sursa(job #713756)
Utilizator | Data | 14 martie 2012 21:56:53 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int k,p,t,n,i,j,v[1000001][9],a[1000010];
int main()
{for(i=2;i<=1000000;++i)
if(a[i]==0)
for(j=i;j<=1000000;j=j+i)
a[j]++;
for(i=2;i<=1000000;++i)
if(a[i]<=7)
v[i][a[i]]=i;
for(i=2;i<=1000000;++i)
for(j=1;j<=8;++j)
if(v[i][j]==0)
v[i][j]=v[i-1][j];
f>>t;
for(i=1;i<=t;++i)
{f>>p>>k;
g<<v[p][k]<<'\n';
}
f.close();
g.close();
return 0;
}