Cod sursa(job #2114815)
Utilizator | Data | 25 ianuarie 2018 21:35:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
int nr;
int main()
{
int n;
in>>n;
for(int i=2; i<=n; i=i+2)
v[i]=1;
nr++;
for(int i=3; i<=n; i=i+2)
{
if(v[i]==0)
nr++;
for(int j=3; j<=n; j=j+i)
v[j]=1;
}
out<<nr;
}