Cod sursa(job #459603)
Utilizator | Data | 30 mai 2010 13:40:25 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream in("divprim.in");
ofstream out("divprim.out");
int phi[1000005];
int main ()
{
int i,j;
for(i=3;i<=500000;i+=2)
{
phi[i+1]++;
if(phi[i]==0)
for(j=2*i;j<=1000000;j+=i)
phi[j]++;
}
//for(i=1;i<=100;i++)out<<phi[i]<<'\n';return 0;
int T,n,k;
in>>T;
while(T--)
{
in>>n>>k;
while(phi[n]!=k&&n>0)
n--;
out<<n<<'\n';
}
}