Cod sursa(job #1801389)
Utilizator | Data | 8 noiembrie 2016 22:50:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int a[2000000];
int main()
{
ifstream cin ("ciur.in");
ofstream cout ("ciur.out");
int n;
cin >> n;
for (int i = 2; i < n; i++)
if (a[i] == 0)
for (int j = i+i; j < n; j += i)
a[j] = 1;
int c = 0;
for (int i = 2; i < n; i++)
if (a[i] == 0)
c++;
cout << c;
return 0;
}