Cod sursa(job #1165145)
Utilizator | Data | 2 aprilie 2014 15:06:33 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("divprim.in");
ofstream g("divprim.out");
int i,j,n,x,y,v[1000000],a[8][1000000];
int main()
{
for(i=2;i<=1000000;i++)
{
if(!v[i]) for(j=i;j<=1000000;j+=i) v[j]++; //ciur
for(j=1;j<=7;++j) a[j][i]=a[j][i-1];
if(v[i]<=7) a[v[i]][i]=i;
}
f>>n;
for(i=1;i<=n;++i)
{
f>>x>>y;
g<<a[y][x]<<'\n';
}
return 0;
}