Cod sursa(job #1909037)
Utilizator | Data | 7 martie 2017 11:29:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char v[2000005];
int main()
{
int n,c=0;
in >> n;
for (int i = 2; i<=n; i++)
v[i] = 1;
for (int i = 2; i<=n; i++)
if (v[i])
{
c++;
for (int j = i+i; j<=n; j+=i)
v[j] = 0;
}
out << c;
}