Cod sursa(job #328447)
Utilizator | Porcescu Alexandru TFifes | Data | 2 iulie 2009 05:04:17 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream.h>
#include<fstream.h>
#include<math.h>
#include<stdlib.h>
int main ()
{
int *v;
v=(int*)malloc(sizeof(int));
long n,c=0,i,j;
ifstream b("ciur.in");
b>>n;
b.close();
v[0]=1;
for(i=1;i<n;i++)
{
v[i]=1;
}
for(i=1;i<sqrt(n);i++)
{
if(v[i]==1)
{
for(j=1;j<n/1;j++)
{
v[i*j]=0;
}
}
}
for(i=0;i<n;i++)
{
if(v[i]==1)
{
c++;
}
}
ofstream x("ciur.out");
x<<c;
x.close();
return 0;
}