Cod sursa(job #1083357)
Utilizator | Data | 15 ianuarie 2014 22:09:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
int n,i,x,nr,j;
bool prim[2000001];
int main()
{
cin>>n;
for(i=2;i<=n;i++)
prim[i]=1;
for(i=2;i<=n;i++)
if(prim[i]==1)
{
nr++;
for(j=i+i;j<=n;j+=i)
prim[j]=0;
}
cout<<nr;
}