Cod sursa(job #1112967)
Utilizator | Data | 20 februarie 2014 10:48:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
long int n,k=0;
f>>n;
long int a[n+1];
for(long int i=2;i<=n;i++)
a[i]=1;
for(long int i=2;i<=n;i++)
if(a[i]==1)
{
k++;
for(long int j=i+i;j<=n;j=j+i)
a[j]=0;
}
g<<k;
return 0;
}