Cod sursa(job #2380743)
Utilizator | Data | 15 martie 2019 14:42:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool prim[2000001];
int contor;
int main()
{
int n,i,a,j;
in>>n;
for(i=2; i<=n; i++)
prim[i]=1;
for(i=2; i<=n; i++)
{
if(prim[i] == 1)
{
contor++;
for(j=i+i; j<=n; j=j+i)
{
prim[j]=0;
}
}
}
out<<contor;
return 0;
}