Cod sursa(job #2382611)
Utilizator | Ghica Tudor Tghica | Data | 18 martie 2019 15:35:34 |
---|---|---|---|
Problema | Divizori Primi | Scor | 35 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
short int ciur[1000002];
int main()
{
for(int i=2;i<=1000000;i+=2)
++ciur[i];
for(int i=3;i<=100000;i+=2)
{
if(ciur[i]==0)
{
for(int j=i;j<=1000000;j+=i)
++ciur[j];
}
}
int n,a,k;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a;
cin>>k;
++a;
while(a)
{
--a;
if(ciur[a]==k)
break;
}
cout<<a<<"\n";
}
return 0;
}