Cod sursa(job #2123938)
Utilizator | Data | 6 februarie 2018 19:01:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
bool v[2000000];
int n,counter;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(int i=2;i<=n;i++)
{
if(v[i]==0)
{
counter++;
for(int j=i+i;j<=n;j=j+i)
{
v[j]=2;
}
}
}
fout<<counter;
}