Cod sursa(job #1211755)
Utilizator | Data | 23 iulie 2014 11:37:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
char a[2000001]; long int n,i,j,nr;
f>>n;
for(i=2;i<=n;i++)
a[i]=1;
nr=0;
for(i=2;i<=n;i++)
if(a[i]==1)
{nr++;
for(j=i+i;j<=n+i;j+=i)
a[j]=0;
}
cout<<nr;
}