Cod sursa(job #2080377)
Utilizator | Data | 2 decembrie 2017 21:02:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, a[2000001];
int main()
{
f >> n;
int sol=1;
for(int i=3;i<=n;i+=2)
{
if(a[i]==0)
{
sol++;
for(int j=(i<<1);j<=n;j+=i) a[j]=1;
}
}
g << sol;
}