Cod sursa(job #1864095)
| Utilizator | Data | 31 ianuarie 2017 15:11:13 | |
|---|---|---|---|
| Problema | Divizori Primi | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divprim.in");
ofstream fout("divprim.out");
const int N=100000001;
char c[N];
int mx,k[100001];
int main()
{
int i,n,j,s=0,m,mx2=0,t;
fin>>t;
for(i=1;i<=t;i++)
{
fin>>n>>k[i];
if(mx<n){mx=n;}
}
for(i=2; i<=mx; i++)
{
if(c[i]==0)
{
for(j=i; j<=n; j+=i)
{
++c[j];
}
}
}
for(i=1;i<=t;i++)
{
mx2=0;
for(j=1; j<=n; j++)
{
if(c[j]==k[i])
{
if(mx2<j)mx2=j;
}
}
fout<<mx2<<'\n';
}
return 0;
}
