Cod sursa(job #1912502)
| Utilizator | Data | 8 martie 2017 09:19:10 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("divprim.in");
ofstream out("divprim.out");
int c[1000005];
int main()
{
int t,n,k,a,b,i;
in>>t;
for(i=1; i<=t; i++)
{
in>>n>>k;
for(a=2; a<=n; a=a+2)
c[a]=1;
for(a=3; a<=n; a=a+2)
if(!c[a])
for(b=a; b<=n; b=b+a)
c[b]++;
for(a=n; a>=1; a--)
if(c[a]==k)
{
out<<a<<"\n";
a=0;
}
if(a==0)
out<<0<<"\n";
memset(c,0,sizeof(c));
}
return 0;
}
