Cod sursa(job #2241251)
Utilizator | Data | 15 septembrie 2018 13:32:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, raspuns;
char prim[20000002];
int main()
{
fin>>n;
for (i=2; i<=n; i++)
if(prim[i]==0)
{
raspuns++;
for(j=2*i;j<=n;j+=i)
{
prim [j]=1;
}
}
fout<<raspuns;
return 0;
}