Cod sursa(job #1331295)
| Utilizator | Data | 31 ianuarie 2015 15:08:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
const int N = 2000001;
char prim[N];
int main()
{
int n;
in >> n;
int cnt=0;
for(int i=2;i<n;i++)
prim[i]=1;
for(int i=2;i*i<n;i++)
{
if(prim[i]==1)
{
for(int j=i*i;j<n;j+=i)
prim[j]=0;
}
}
for(int i=2;i<n;i++)
{
if(prim[i]==1)
{cnt++;}
}
ofstream out("ciur.out");
out<<cnt;
return 0;
}
