Cod sursa(job #2428573)
Utilizator | Data | 5 iunie 2019 20:14:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,i,j,c=0;
in>>n;
bool a[2000000];
for(i=2;i<=n;i++)
a[i]=true;
for(i=2;i<=n;i++)
{
if(a[i]==true)
{
c++;
for(j=i+i;j<=n;j=j+i)
a[j]=false;
}
}
out<<c;
}