Cod sursa(job #467149)
Utilizator | Data | 28 iunie 2010 12:17:59 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
#define MAX 1000002
ifstream in("divprim.in");
ofstream out("divprim.out");
int phi[MAX];
int sol[MAX][8];
int main ()
{
int i,j;
for(i=3;i<=MAX;i+=2)
{
if(phi[i]==0)
{
phi[i]=1;
for(j=2*i;j<=MAX;j+=i)
phi[j]++;
}
phi[i+1]++;
}
for(i=1;i<=MAX;i++)
{
for(j=0;j<=7;j++)
sol[i][j]=sol[i-1][j];
sol[i][phi[i]]=i;
}
int T;
in>>T;
while(T--)
{
in>>i>>j;
out<<sol[i][j]<<'\n';
}
}