Cod sursa(job #375187)
Utilizator | Data | 19 decembrie 2009 19:23:19 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
# include <fstream>
using namespace std;
# define N (2*i+1)
int k, v[100000000], n=0;
ofstream fout ("prim.out");
void erat ()
{
int j, i, c=1;
for (i=1;c<k;i++)
if (!v[N])
{
c++;
for (j=2;j<=2*N;j++)
v[j*N]=1;
}
for (;!n;i++)
if (!v[N])
n=N*N;
}
int main ()
{
ifstream fin ("prim.in");
fin>>k;
erat();
fout<<n;
return 0;
}