Cod sursa(job #2326122)
Utilizator | Data | 23 ianuarie 2019 12:44:05 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("prim.in");
ofstream fout("prim.out");
long long prime[100005];
long long k;
int e_prim(long long n)
{
if(n == 1)
return 0;
for( long long i = 2 ; i*i <= n; ++i )
if(n % i == 0)
return 0;
return 1;
}
int main()
{
long long k, j = 2 , i = 1;
fin >> k;
while(i <= k)
{
while(!e_prim(j))
++j;
prime[i] = j;
++j;
++i;
}
for(long long i = prime[k] + 1 ; i ; ++i)
if(e_prim(i))
{
fout << i * i;
break;
}
}