Pagini recente » Cod sursa (job #3042059) | Istoria paginii runda/concurstreiore | Istoria paginii runda/9_martie_simulare_oji_2024_clasa_10 | Cod sursa (job #341238) | Cod sursa (job #50550)
Cod sursa(job #50550)
#include <stdio.h>
#include <math.h>
long long nr[120000],i,j,d,n,p;
int main(){
FILE*f=fopen("frac.in","r");
FILE*g=fopen("frac.out","w");
fscanf(f,"%lld",&n);
fscanf(f,"%lld",&p);
for(i=2;i<=sqrt(n);i++)
if(n%i==0&&!nr[i])
for(j=1;j<=1200000;j++)
nr[i*j]=1;
for(i=1;i<=120000;i++){
if(nr[i]==0)p--;
if(!p)break;
}
fprintf(g,"%lld",i);
return 0;
}