Cod sursa(job #1670510)
Utilizator | Data | 31 martie 2016 19:59:50 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream in("divprim.in");
ofstream out("divprim.out");
int ciur[1000001];
int main()
{
int t,n,i,k,cnt=0,x,d,j;
in>>t;
for(i=2; i<=1000000; i++)
if(ciur[i]==0)
for(d=i; d<=1000000; d+=i)
ciur[d]++;
for(i=1; i<=t; i++)
{
cnt=0;
in>>n>>k;
for(j=n;j>=1;j--)
if(ciur[j]==k)
break;
out<<j<<'\n';
}
return 0;
}