Cod sursa(job #2791893)
Utilizator | Data | 31 octombrie 2021 12:26:16 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream cin ("divprim.in");
ofstream cout ("divprim.out");
int t,n,k,i,d,ciur[2000050],ok,j;
int main()
{
for (i=2; i*i<=2000000; i++)
{
if (ciur[i]==0)
{
for (d=i; d<=2000000; d=d+i)
{
ciur[d]++;
}
}
}
cin >>t;
for (i=1; i<=t; i++)
{
cin >>n>>k;
ok=0;
for (j=n-1; j>=1; j--)
{
if (ciur[j]==k) {cout <<j<<'\n'; ok=1; break;}
}
if (ok==0) {cout <<ok<<'\n';}
}
return 0;
}