Cod sursa(job #1872306)
Utilizator | Data | 8 februarie 2017 08:02:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int n,c;
char prim[2000005];
int main()
{
int i,j;
ifstream in("ciur.in");
ofstream out("ciur.out");
in >> n;
for (i = 2; i<=n; i++)
v[i] = 1;
for (i = 2; i<=n; i++)
if (v[i])
{
c++;
for (j = i+i; j<=n; j+=i)
v[j] = 0;
}
out << c;
}