Cod sursa(job #866790)
Utilizator | Data | 28 ianuarie 2013 19:16:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<iostream>
using namespace std;
char prim[2000005];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
long long n,contor=1,i,j;
in>>n;
for(i=3;i<=n;i+=2)
if(prim[i]==0)
{
contor++;
for(j=i*i;j<=n;j+=i)
prim[j]=1;
}
out<<contor;
return 0;
}