Cod sursa(job #3338635)
| Utilizator | Data | 4 februarie 2026 12:59:48 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 15 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <fstream>
using namespace std;
ifstream cin("divprim.in");
ofstream cout("divprim.out");
long long aux[1000005],i,j,n,x,k,ok;
int main()
{
aux[1]=0;
for(i=2; i*i<=100005; i++)
{
if(aux[i]==0)
{
for(j=1;i*j<=100005;j++)
{
aux[i*j]++;
}
}
}
/*for(i=1;i<=100;i++)
{
cout<<i<<" "<<aux[i]<<endl;
}*/
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x>>k;
ok=0;
for(j=x;j>=1;j--)
{
if(aux[j]==k)
{
cout<<j<<endl;
ok=1;
break;
}
}
if(ok==0)
{
cout<<0<<endl;
}
}
return 0;
}
